Choosing Mathematical Function Implementations for Speed and Accuracy
Fri 17 Jun 2022 01:30 - 01:50 at Toucan - Numbers
Standard implementations of functions like sin
and exp
optimize for accuracy, not speed, because they are intended for general-purpose use. But just like many applications tolerate inaccuracy from cancellation, rounding error, and singularities, many application could also tolerate less-accurate function implementations. This raises an intriguing possibility: speeding up numerical code by using different function implementations.
This paper thus introduces OpTuner, an automated tool for selecting the best implementation for each mathematical function call site. OpTuner uses error Taylor series and integer linear programming to compute optimal assignments of 297 function implementations to call sites and presents the user with a speed-accuracy Pareto curve. In a case study on the POV-Ray ray tracer, OpTuner speeds up a critical computation by 2.48x, leading to a whole program speedup of 1.09x with no change in the program output; human efforts result in slower code and lower-quality output. On a broader study of 36 standard benchmarks, OpTuner demonstrates speedups of 2.05x for negligible decreases in accuracy and of up to 5.37x for error-tolerant applications.
Thu 16 JunDisplayed time zone: Pacific Time (US & Canada) change
13:30 - 14:50 | |||
13:30 20mTalk | Choosing Mathematical Function Implementations for Speed and Accuracy PLDI DOI | ||
13:50 20mTalk | Guaranteed bounds for posterior inference in universal probabilistic programming PLDI Raven Beutner CISPA Helmholtz Center for Information Security, Germany, C.-H. Luke Ong University of Oxford, Fabian Zaiser University of Oxford DOI Pre-print | ||
14:10 20mTalk | Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries PLDI Mridul Aanjaneya Rutgers University, Jay P. Lim Yale University, Santosh Nagarakatte Rutgers University Link to publication DOI Pre-print | ||
14:30 20mTalk | Karp: A Language for NP Reductions PLDI Chenhao Zhang Northwestern University, Jason D. Hartline Northwestern University, Christos Dimoulas PLT @ Northwestern University DOI |
Fri 17 JunDisplayed time zone: Pacific Time (US & Canada) change
01:30 - 02:50 | |||
01:30 20mTalk | Choosing Mathematical Function Implementations for Speed and Accuracy PLDI DOI | ||
01:50 20mTalk | Guaranteed bounds for posterior inference in universal probabilistic programming PLDI Raven Beutner CISPA Helmholtz Center for Information Security, Germany, C.-H. Luke Ong University of Oxford, Fabian Zaiser University of Oxford DOI Pre-print | ||
02:10 20mTalk | Progressive Polynomial Approximations for Fast Correctly Rounded Math Libraries PLDI Mridul Aanjaneya Rutgers University, Jay P. Lim Yale University, Santosh Nagarakatte Rutgers University Link to publication DOI Pre-print | ||
02:30 20mTalk | Karp: A Language for NP Reductions PLDI Chenhao Zhang Northwestern University, Jason D. Hartline Northwestern University, Christos Dimoulas PLT @ Northwestern University DOI |