2013 27th International Conference on Advanced Information Networking and Applications Workshops (2013)

Barcelona, Spain Spain

Mar. 25, 2013 to Mar. 28, 2013

ISBN: 978-1-4673-6239-9

pp: 1436-1438

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WAINA.2013.29

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

CITATION

R. Jolly, "Straightforward Parallelization of Polynomial Multiplication Using Parallel Collections in Scala,"

*2013 27th International Conference on Advanced Information Networking and Applications Workshops(WAINA)*, Barcelona, Spain Spain, 2013, pp. 1436-1438.

doi:10.1109/WAINA.2013.29

CITATIONS

SEARCH