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.
@article{arxiv.1303.7425,
title = {Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-core Systems},
author = {Mickael Gastineau and Jacques Laskar},
journal= {arXiv preprint arXiv:1303.7425},
year = {2013}
}