Parallel sparse polynomial division using heaps

  • Authors:

  • Michael Monagan;Roman Pearce

  • Affiliations:

  • Simon Fraser University, Burnaby, B.C. Canada;Simon Fraser University, Burnaby, B.C. Canada

  • Venue:
  • Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solution requires fine-grained parallelism. Our algorithm manages to avoid waiting for each term of the quotient to be computed, and it achieves superlinear speedup over the fastest known sequential method. We present benchmarks comparing the performance of our C implementation of sparse polynomial division to the routines of other computer algebra systems.