BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260202T201809Z
LOCATION:274
DTSTART;TZID=America/Chicago:20251118T161500
DTEND;TZID=America/Chicago:20251118T163700
UID:submissions.supercomputing.org_SC25_sess304_pap766@linklings.com
SUMMARY:High-Performance Branch-Free Algorithms for Extended-Precision Flo
 ating-Point Arithmetic
DESCRIPTION:David Kai Zhang and Alex Aiken (Stanford University)\n\nWe pre
 sent new branch-free algorithms for floating-point arithmetic at double, t
 riple, or quadruple the native machine precision. These algorithms are the
  fastest known by at least an order of magnitude and are conjectured to be
  optimal, not only in an asymptotic sense, but in their exact FLOP count a
 nd circuit depth. Unlike previous algorithms, which either use complex bra
 nching logic or are only correct on specific classes of inputs, our algori
 thms have computer-verified proofs of correctness for all floating-point i
 nputs within machine overflow and underflow thresholds. Compared to state-
 of-the-art multiprecision libraries, our algorithms achieve up to 11.7x th
 e peak performance of QD, 34.4x over CAMPARY, 35.6x over MPFR, and 41.4x o
 ver FLINT.\n\nTag: Algorithms, Applications, Architectures & Networks\n\nR
 ecording: Livestreamed, Recorded\n\nRegistration Category: Technical Progr
 am Reg Pass\n\nSession Chair: Hartwig Anzt (Technical University of Munich
 ; University of Tennessee, Knoxville)\n\n
END:VEVENT
END:VCALENDAR