The Community for Technology Leaders
2013 Workshops of 27th International Conference on Advanced Information Networking and Applications (WAINA) (2013)
Barcelona
March 25, 2013 to March 28, 2013
ISBN: 978-1-4673-6239-9
pp: 1436-1438
R. Jolly , Databeans, Velizy-Villacoublay, France
ABSTRACT
In the context of computer algebra, we present a parallelized version of a polynomial multiplication algorithm developped using the high-level parallel abstractions offered by the Scala collections. The parallelized algorithm is tested against a well-known benchmark of sparse polynomial multiplication. The experiments show that a speedup of 1.25 to 1.40 with two processors is reachable. Reasons why it is not better are analyzed.
INDEX TERMS
Polynomials, Algebra, Computers, Benchmark testing, Program processors, Java, Timing
CITATION
R. Jolly, "Straightforward Parallelization of Polynomial Multiplication Using Parallel Collections in Scala", 2013 Workshops of 27th International Conference on Advanced Information Networking and Applications (WAINA), vol. 00, no. , pp. 1436-1438, 2013, doi:10.1109/WAINA.2013.29
102 ms
(Ver 3.3 (11022016))