FFT-based dense polynomial arithmetic on multi-cores

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

Volumn 5976 LNCS, Issue , 2010, Pages 378-399

  Moreno Maza, Marc ^a   Xie, Yuzhen ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cilk++; Multi core; Parallel multi dimensional FFT TFT; Parallel normal form; Parallel polynomial arithmetic; Parallel polynomial multiplication

Indexed keywords

BIVARIATE; CUT-OFF; EFFICIENT IMPLEMENTATION; FINITE FIELDS; IN-DEPTH STUDY; LEVEL ALGORITHMS; MULTI CORE; MULTIVARIATE POLYNOMIAL; NORMAL FORM; PARALLEL POLYNOMIALS; PEAK PERFORMANCE; POLYNOMIAL ARITHMETIC; POLYNOMIAL MULTIPLICATION;

FAST FOURIER TRANSFORMS; OPTIMIZATION;

POLYNOMIALS;

EID: 77952351456     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12659-8_28     Document Type: Conference Paper

References (20)

1. Becker, E., Mora, T., Marinari, M.G., Traverso, C.: The shape of the shape lemma. In: Proc. of ISSAC 1994, pp. 129-133. ACM Press, New York (1994)
2. Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. In: IEEE FOCS 1994 (1994)
3. Cilk Arts. Cilk++, http://www.cilk.com/
4. Intel Company. Intel VTune Performance Analyzer 9.1 for Linux, http://www.intel.com/
5. Cook, S.: On the minimum computation time of function. PhD thesis, Harvard Univ. (1966)
6. Cooley, J., Tukey, J.: An algorithm for the machine calculation of complex Fourier series. Math. Comp. 19, 297-301 (1965)
7. Cox, D., Little, J., O'Shea, D.: Using Algebraic Geometry. Graduate Text in Mathematics, vol.185. Springer, New York (1998)
8. Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: 40th Annual Symposium on Foundations of Computer Science, pp. 285-297 (1999)
9. Frigo, M., Leiserson, C.E., Randall, K.H.: The implementation of the cilk-5 multithreaded language. In: ACM SIGPLAN (1998)
10. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge Univ. Press, Cambridge (1999)
11. van der Hoeven, J.: Truncated Fourier transform. In: Proc. ISSAC 2004. ACM Press, New York (2004)
12. Huss-Lederman, S., Jacobson, E.M., Tsao, A., Turnbull, T., Johnson, J.R.: Implementation of Strassen's algorithm for matrix multiplication. In: Supercomputing 1996: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM), Washington, DC, USA, p. 32. IEEE Computer Society, Los Alamitos (1996)
13. Kung, H.T.: On computing reciprocals of power series. NumerischeMathematik 22, 341-348 (1974)
14. Li, X., Moreno Maza, M.: Multithreaded parallel implementation of arithmetic operations modulo a triangular set. In: Proc. PASCO 2007, pp. 53-59. ACM Press, New York (2006)
15. Li, X., Moreno Maza, M., Pan, W.: Computations modulo regular chains. In: Proc. of ISSAC 2009, pp. 239-246. ACM Press, New York (2009)
16. Li, X., Moreno Maza, M., Rasheed, R., Schost, É.: The modpn library: Bringing fast polynomial arithmetic into maple. In: MICA 2008 (2008)
17. Li, X., Moreno Maza, M., Schost, É.: Fast arithmetic for triangular sets: From theory to practice. In: Proc. ISSAC 2007, pp. 269-276. ACM Press, New York (2007)
18. Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519-521 (1985)
19. Moreno Maza, M., Xie, Y.: Balanced dense polynomial multiplication on multicores. In: Proc. PDCAT 2009, Hiroshima, Japan (2009)
20. Sieveking, M.: An algorithm for division of powerseries. Computing 10, 153-156 (1972)