1545

Efficient evaluation methods of elementary functions suitable for SIMD computation

Naoki Shibata
Department of Information Processing & Management, Shiga University, 522-8522, Hikone, Japan
Computer Science – Research and Development, Volume 25, Numbers 1-2, 25-32 (20 April 2010)

@article{shibata2010efficient,

   title={Efficient evaluation methods of elementary functions suitable for SIMD computation},

   author={Shibata, N.},

   journal={Computer Science-Research and Development},

   volume={25},

   number={1},

   pages={25–32},

   issn={1865-2034},

   year={2010},

   publisher={Springer}

}

Source Source   

701

views

Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Although some SIMD and SIMT instruction sets include double-precision arithmetic and bitwise operations, there are no instructions dedicated to evaluating elementary functions like trigonometric functions in double precision. Thus, these functions have to be evaluated one by one using an FPU or using a software library. However, traditional algorithms for evaluating these elementary functions involve heavy use of conditional branches and/or table look-ups, which are not suitable for SIMD computation. In this paper, efficient methods are proposed for evaluating the sine, cosine, arc tangent, exponential and logarithmic functions in double precision without table look-ups, scattering from, or gathering into SIMD registers, or conditional branches. We implemented these methods using the Intel SSE2 instruction set to evaluate their accuracy and speed. The results showed that the average error was less than 0.67 ulp, and the maximum error was 6 ulps. The computation speed was faster than the FPUs on Intel Core 2 and Core i7 processors.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: