Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-core Systems
IMCCE-CNRS UMR8028, Observatoire de Paris, UPMC, Astronomie et Systemes Dynamiques, 77 Avenue Denfert-Rochereau, 75014 Paris, France
arXiv:1303.7425 [cs.SC],
We present a highly scalable algorithm for multiplying sparse multivariate polynomials represented in a distributed format. This algo- rithm targets not only the shared memory multicore computers, but also computers clusters or specialized hardware attached to a host computer, such as graphics processing units or many-core coprocessors. The scal- ability on the large number of cores is ensured by the lacks of synchro- nizations, locks and false-sharing during the main parallel step.
April 8, 2013 by hgpu