Zobrazeno 1 - 10
of 47
pro vyhledávání: '"A. P. Panchekha"'
Latency is a major concern for web rendering engines like those in Chrome, Safari, and Firefox. These engines reduce latency by using an incremental layout algorithm to redraw the page when the user interacts with it. In such an algorithm, elements t
Externí odkaz:
http://arxiv.org/abs/2411.10659
Autor:
Saiki, Brett, Brough, Jackson, Regehr, Jonas, Ponce, Jesús, Pradeep, Varun, Akhileshwaran, Aditya, Tatlock, Zachary, Panchekha, Pavel
New low-precision accelerators, vector instruction sets, and library functions make maximizing accuracy and performance of numerical code increasingly challenging. Two lines of work$\unicode{x2013}$traditional compilers and numerical compilers$\unico
Externí odkaz:
http://arxiv.org/abs/2410.14025
Autor:
Yadrov, Artem, Panchekha, Pavel
Evaluating real-valued expressions to high precision is a key building block in computational mathematics, physics, and numerics. A typical implementation uses a uniform precision for each operation, and doubles that precision until the real result c
Externí odkaz:
http://arxiv.org/abs/2410.07468
Achieving speed and accuracy for math library functions like exp, sin, and log is difficult. This is because low-level implementation languages like C do not help math library developers catch mathematical errors, build implementations incrementally,
Externí odkaz:
http://arxiv.org/abs/2311.01515
Autor:
Misback, Edward, Chan, Caleb C., Saiki, Brett, Jun, Eunice, Tatlock, Zachary, Panchekha, Pavel
In recent years, researchers have proposed a number of automated tools to identify and improve floating-point rounding error in mathematical expressions. However, users struggle to effectively apply these tools. In this paper, we work with novices, e
Externí odkaz:
http://arxiv.org/abs/2305.10599
Satisfiability Modulo Theory (SMT) solvers and equality saturation engines must generate proof certificates from e-graph-based congruence closure procedures to enable verification and conflict clause generation. Smaller proof certificates speed up th
Externí odkaz:
http://arxiv.org/abs/2209.03398
Autor:
Briggs, Ian, Panchekha, Pavel
Identities compactly describe properties of a mathematical expression and can be leveraged into faster and more accurate function implementations. However, identities must currently be discovered manually, which requires a lot of expertise. We propos
Externí odkaz:
http://arxiv.org/abs/2206.07086
Garbage-collected language runtimes carefully tune heap limits to reduce garbage collection time and memory usage. However, there's a trade-off: a lower heap limit reduces memory use but increases garbage collection time. Classic methods for setting
Externí odkaz:
http://arxiv.org/abs/2204.10455
Autor:
Flatt, Oliver, Panchekha, Pavel
Interval arithmetic is a simple way to compute a mathematical expression to an arbitrary accuracy, widely used for verifying floating-point computations. Yet this simplicity belies challenges. Some inputs violate preconditions or cause domain errors.
Externí odkaz:
http://arxiv.org/abs/2107.05784
Autor:
Briggs, Ian, Panchekha, Pavel
Standard library implementations of functions like sin and exp optimize for accuracy, not speed, because they are intended for general-purpose use. But applications tolerate inaccuracy from cancellation, rounding error, and singularities-sometimes ev
Externí odkaz:
http://arxiv.org/abs/2107.05761