Methods for high-throughput computation of elementary functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8384 LNCS, Issue PART 1, 2014, Pages 86-95

  Dukhan, Marat ^a   Vuduc, Richard ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Elementary functions; Fused multiply add; SIMD

Indexed keywords

ARTIFICIAL INTELLIGENCE; SIGNAL PROCESSING; TABLE LOOKUP;

DESIGN PRINCIPLES; ELEMENTARY FUNCTION; FLOATING-POINT COMPUTATION; FUSED MULTIPLY-ADD; INTEGER OPERATIONS; MICRO ARCHITECTURES; SIGNAL PROCESSING ALGORITHMS; SIMD;

ALGORITHMS;

EID: 84901257035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-55224-3_9     Document Type: Conference Paper

References (19)

1. Bailey, R.: Polar generation of random variates with the t-distribution. Math. Comput. 62(206), 779-782 (1994)
2. Box, G., Muller, M.: A note on the generation of random normal deviates. Ann. Math. Stat. 29(2), 610-611 (1958)
3. ∞-approximations. In: 18th IEEE Symposium on Computer Arithmetic, 2007. ARITH'07. pp. 169-176. IEEE (2007)
4. Cody, W., Waite, W.: Software Manual for the Elementary Functions. Prentice- Hall, New Jersey (1980)
5. de Dinechin, F., Defour, D., Lauter, C., et al.: Fast correct rounding of elementary functions in double precision using double-extended arithmetic (2004)
6. Fog, A.: Instruction tables: lists of instruction latencies, throughputs and microoperation breakdowns for Intel. AMD and VIA CPUs, Technical report (2012)
7. Fousse, L., Hanrot, G., Lefèvre, V., Pélissier, P., Zimmermann, P.: MPFR: a multipleprecision binary floating-point library with correct rounding. ACM Trans. Math. Softw. (TOMS) 33(2), 13 (2007)
8. Gal, S.: An accurate elementary mathematical library for the ieee floating point standard. ACM Trans. Math. Softw. (TOMS) 17(1), 26-45 (1991)
9. Gentle, J.E.: Random Number Generation and Monte Carlo Methods. Springer, New York (2003)
10. Markstein, P.: IA-64 and Elementary Functions: Speed and Precision. Prentice Hall, New Jersey (2000)
11. Muller, J.-M.: Elementary Functions: Algorithms and Implementation. Birkhauser, Boston (1997)
12. Muller, J.-M., Brisebarre, N., de Dinechin, F., Jeannerod, C.-P., Lefevre, V., Melquiond, G., Revol, N., Stehle, D., Torres, S., Muller, J.-M., Brisebarre, N., Dinechin, F., Jeannerod, C.-P., Lefevre, V., Melquiond, G., Revol, N., Stehle, D., Torres, S.: Handbook of Floating-Point Arithmetic. Birkhauser, Boston (2010)
13. Ng, K.C.: Argument reduction for huge arguments: Good to the last bit (1992)
14. Payne, M., Hanek, R.: Radian reduction for trigonometric functions. ACM SIGNUM Newsl. 18(1), 19-24 (1983)
15. Press, W., Teukolsky, S., Vetterling, W., Flannery, B.: Numerical Recipes: The Art of Scientific Computing. Cambridge University Press, Cambridge (2007)
16. Shibata, N.: Efficient evaluation methods of elementary functions suitable for SIMD computation. Comput. Sci.-Res. Dev. 25(1), 25-32 (2010)
17. Tang, P.: Table-lookup algorithms for elementary functions and their error analysis. In: Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991. pp. 232-236. IEEE (1991)
18. Williams, C.K.I., Rasmussen, C.E.: Gaussian Processes for Machine Learning, MIT Press, Cambridge (2006)
19. Wong, W.-F., Goto, E.: Fast evaluation of the elementary functions in single precision. IEEE Trans. Comput. 44(3), 453-457 (1995)