Towards solving the Table Maker’s Dilemma on GPU
Laboratoire d’Informatique de Paris 6 (LIP6), CNRS : UMR7606 – Universite Pierre et Marie Curie – Paris VI
HAL: hal-00642337, 2011
@article{fortin2011towards,
title={Towards solving the Table Maker’s Dilemma on GPU},
author={Fortin, P. and Gouicem, M. and Graillat, S. and others},
year={2011}
}
Since 1985, the IEEE 754 standard defines formats, rounding modes and basic operations for floating-point arithmetic. In 2008 the standard has been extended, and recommendations have been added about the rounding of some elementary functions such as trigonometric functions (cosine, sine, tangent and their inverses), exponentials, and logarithms. However to guarantee the exact rounding of these functions one has to approximate them with a sufficient precision. Finding this precision is known as the Table Maker’s Dilemma. To determine this precision, it is necessary to find the hardest-to-round argument of these functions. Lefevre et al. proposed in 1998 an algorithm which improves the exhaustive search by computing a lower bound on the distance between a line segment and a grid. We present in this paper an analysis of this algorithm in order to deploy it efficiently on GPU. We manage to obtain a speedup of 15.4 on a NVIDIA Fermi GPU over one single high-end CPU core.
November 23, 2011 by hgpu
