Parallel sparse polynomial division using heaps

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.

• Type: Journal
• Year: 2010
• Where: CAP
• Authors: Michael B. Monagan, Roman Pearce
• Keywords: CAP 2010, Distributed And Parallel Computing, Significant Data Dependencies, Sparse Distributed Polynomials, Sparse Polynomial Division