skip to main content
10.1145/1837210.1837227acmotherconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
research-article

Parallel sparse polynomial division using heaps

Published:21 July 2010Publication History

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.

References

  1. D. Bini, V. Pan. Improved parallel polynomial division. SIAM J. Comp. 22 (3) 617--626, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. W. Bosma, J. Cannon, and C. Playoust. The Magma algebra system. I. The user language. J. Symb. Comp., 24 (3--4) 235--265, 1997 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. Fateman. Comparing the speed of programs for sparse polynomial multiplication. ACM SIGSAM Bulletin, 37 (1) 4--15, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Gastineau, J. Laskar. Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries. Proc. ICCS 2006, Springer LNCS 3992, 446--453. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. G.-M. Greuel, G. Pfister, and H. Schönemann. Singular 3.1.0 -- A computer algebra system for polynomial computations, 2009. http://www.singular.uni-kl.deGoogle ScholarGoogle Scholar
  6. L. H. Harper, T. H. Payne, J. E. Savage, E. Straus. Sorting X+Y. Comm. ACM 18 (6), pp. 347--349, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. C. Johnson. Sparse polynomial arithmetic. ACM SIGSAM Bulletin, 8 (3) 63--71, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. X. Li and M. Moreno Maza. Multithreaded parallel implementation of arithmetic operations modulo a triangular set. Proc. of PASCO '07, ACM Press, 53--59. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. T. Mattson, B. Sanders, B. Massingill. Patterns for Parallel Programming. Addison-Wesley, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Matooane. Parallel Systems in Symbolic and Algebraic Computation. Ph.D Thesis, Cambridge, 2002.Google ScholarGoogle Scholar
  11. M. Monagan, R. Pearce. Parallel Sparse Polynomial Multiplication Using Heaps. Proc. of ISSAC 2009, 295--315. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. Monagan, R. Pearce. Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. Proc. of CASC 2007, Springer LNCS 4770, 295--315. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Monagan, R. Pearce. Sparse Polynomial Division Using a Heap. submitted to J. Symb. Comp., October 2008.Google ScholarGoogle Scholar
  14. A. Norman, J. Fitch. CABAL: Polynomial and power series algebra on a parallel computer. Proc. of PASCO '97, ACM Press, pp. 196--203. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. P. Wang. Parallel Polynomial Operations on SMPs. J. Symbolic. Comp., 21 397--410, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Parallel sparse polynomial division using heaps

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      PASCO '10: Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
      July 2010
      192 pages
      ISBN:9781450300674
      DOI:10.1145/1837210

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 21 July 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader