Straightforward Parallelization of Polynomial Multiplication Using Parallel Collections in Scala

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.