Balanced dense polynomial multiplication on multi-cores
Name
Maza-2009-Balanced dense polynomial multiplication on multi-cores.pdf
Size
356.65 KB
Format
Adobe PDF
Checksum (MD5)
f349147e609f7000288a055f24ebd261
Author(s) •
Xie, Yuzhen
Maza, Marc Moreno
Date Issued
February 2010
Journal
International Conference on Parallel and Distributed Computing, Applications and Technologies, 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Maza, M.M., and Yuzhen Xie. “Balanced Dense Polynomial Multiplication on Multi-Cores.” Parallel and Distributed Computing, Applications and Technologies, 2009 International Conference on. 2009. 1-9. ©2010 IEEE.
Version
Final published version
Abstract
In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementation strategies for FFT-based dense polynomial multiplication targeting multi-cores. We show that balanced input data can maximize parallel speedup and minimize cache complexity for bivariate multiplication. However, unbalanced input data, which are common in symbolic computation, are challenging. We provide efficient techniques, what we call contraction and extension, to reduce multivariate (and univariate) multiplication to balanced bivariate multiplication. Our implementation in Cilk++ demonstrates good speedup on multi-cores.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/PDCAT.2009.87