The Community for Technology Leaders
Computer Arithmetic, IEEE Symposium on (2005)
Cape Cod, Massachusetts, USA
June 27, 2005 to June 29, 2005
ISSN: 1063-6889
ISBN: 0-7695-2366-8
pp: 288-295
Florent de Dinechin , LIP, ÉNS de Lyon
Alexey V. Ershov , Intel Corporation
Nicolas Gast , École Normale Supérieure
ABSTRACT
This article presents advances on the subject of correctly rounded elementary functions since the publication of the libultim mathematical library developed by Ziv at IBM. This library showed that the average performance and memory overhead of correct rounding could be made negligible. However, the worst-case overhead was still a factor 1000 or more. It is shown here that, with current processor technology, this worst-case overhead can be kept within a factor of 2 to 10 of current best libms. This low overhead has very positive consequences on the techniques for implementing and proving correctly rounded functions, which are also studied. These results lift the last technical obstacles to a generalisation of (at least some) correctly rounded double precision elementary functions.
INDEX TERMS
null
CITATION
Florent de Dinechin, Alexey V. Ershov, Nicolas Gast, "Towards the Post-Ultimate libm", Computer Arithmetic, IEEE Symposium on, vol. 00, no. , pp. 288-295, 2005, doi:10.1109/ARITH.2005.46
91 ms
(Ver 3.3 (11022016))