BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160057Z
LOCATION:Track 4
DTSTART;TZID=America/New_York:20201118T110000
DTEND;TZID=America/New_York:20201118T113000
UID:submissions.supercomputing.org_SC20_sess167_pap329@linklings.com
SUMMARY:Scalable yet Rigorous Floating-Point Error Analysis
DESCRIPTION:Paper\n\nScalable yet Rigorous Floating-Point Error Analysis\n
 \nDas, Briggs, Gopalakrishnan, Krishnamoorthy, Panchekha\n\nAutomated tech
 niques for rigorous floating-point round-off error analysis are a prerequi
 site to placing important activities in HPC such as precision allocation, 
 verification and code optimization on a formal footing. Yet existing techn
 iques cannot provide tight bounds for expressions beyond a few dozen opera
 tors; barely enough for HPC. In this work, we offer an approach embedded i
 n a new tool called SATIRE that scales error analysis by four orders of ma
 gnitude compared to today’s best-of-class tools. We explain how three key 
 ideas underlying SATIRE help it attain such scale; path strength reduction
 , bound optimization and abstraction. SATIRE provides tight bounds and rig
 orous guarantees on significantly larger expressions with well over a hund
 red thousand operators, covering important examples including FFT, matrix 
 multiplication and PDE stencils.\n\nTag: Algorithms, Floating Point\n\nReg
 istration Category: Tech Program Reg Pass\n\nAward Finalist: Best Student 
 Paper Finalists
END:VEVENT
END:VCALENDAR