FFT-Based Dense Polynomial Arithmetic on Multi-cores

We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study dedicated to polynomial multiplication and obtained a complete set of efficient parallel routines in Cilk++ for polynomial arithmetic such as normal form computation. Since bivariate multiplication applied to balanced data is a good kernel for these routines, we provide an in-depth study on the performance and the cut-off criteria of our different implementations for this operation. We also show that, not only optimized parallel multiplication can improve the performance of higher-level algorithms such as normal form computation but also this composition is necessary for parallel normal form computation to reach peak performance on a variety of problems that we have tested.

• Type: Conference
• Year: 2009
• Where: HPCS
• Authors: Marc Moreno Maza, Yuzhen Xie
• Keywords: Distributed And Parallel Computing, HPCS 2009, Multivariate Polynomial Arithmetic, Normal Form Computation, Polynomial Arithmetic