May 1st FPTalks Community Meeting: David K. Zhang on Fast Branch-Free Algorithms for Extended-Precision Floating-Point Arithmetic

[Ian Briggs]

Hi Everyone!

Next Thursday, May 1st at 9:00-10:00 AM pacific time, we’ll have the next FPTalks Community Meeting on this Zoom: https://washington.zoom.us/j/92831331326

We’re super excited to welcome David K. Zhang from Stanford University to present on Fast Branch-Free Algorithms for Extended-Precision Floating-Point Arithmetic.

In his own words:

Many scientific and mathematical problems demand extremely precise calculations exceeding the limits of the double precision (IEEE binary64) floating-point format. However, existing methods for extended-precision computation involve complex branching algorithms that perform poorly on modern data-parallel processors, including SIMD CPUs and GPUs. In this talk, I introduce a class of algorithms called floating-point accumulation networks (FPANs) that enable fast branch-free extended-precision arithmetic. FPAN-based algorithms outperform standard multiprecision libraries by orders of magnitude, achieving up to 11.7x the peak performance of QD, 34.4x over CAMPARY, 35.6x over MPFR, and 41.4x over FLINT. I also introduce a new formal verification technique that leverages automatic theorem provers to rigorously establish the correctness of these new algorithms.

Looking forward to seeing everyone!

-Ian

As a reminder, if you would like to give a talk or know of someone that would be great for an FPBench Community meeting, please have them fill out the speaker suggestion form!

FPTalks Discussion: https://fpbench.org/subscribe

Nominate a speaker: https://fpbench.org/nominate

[Ian Briggs]

Hi Everyone!

This Thursday, May 1st at 9:00-10:00 AM pacific time, we’ll have the next FPTalks Community Meeting on this Zoom: https://washington.zoom.us/j/92831331326