Parallel sparse polynomial multiplication using heaps

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2009, Pages 263-269

  Monagan, Michael ^a   Pearce, Roman ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Multiplication; Parallel; Polynomial; Sparse

Indexed keywords

COMPUTER ALGEBRA SYSTEMS; HIGH PERFORMANCE ALGORITHMS; INTERMEDIATE RESULTS; LOCAL CACHE; MULTI-CORE PROCESSOR; PARALLEL POLYNOMIALS; SHARED CACHE; SPARSE POLYNOMIALS; SUPERLINEAR;

POLYNOMIALS;

EID: 77950403264     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1576702.1576739     Document Type: Conference Paper

References (21)

1. D. Bini, V. Pan. Improved parallel polynomial division. SIAM J. Comp. 22 (3) 617-626, 1993.
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
3. R. Fateman. Comparing the speed of programs for sparse polynomial multiplication. ACM SIGSAM Bulletin, 37 (1) (2003) 4-15.
4. M. Gastineau, J. Laskar. Development of TRIP: Fastz Sparse Multivariate Polynomial Multiplication Using Burst Tries. Proceedings of ICCS 2006, Springer LNCS 3992 (2006) 446-453.
5. G.-M. Greuel, G. Pfister, and H. Schönemann. Singular 3.1.0 - A computer algebra system for polynomial computations. http://www.singular.uni-kl. de (2009).
6. T. Granlund. The GNU Multiple Precision Arithmetic Library, version 4.2.2. http://www.gmplib.org/ (2008).
7. S.C. Johnson. Sparse polynomial arithmetic. ACM SIGSAM Bulletin, 8 (3) (1974) 63-71.
8. M. Lam, E. Rothberg, and M. Wolf. The cache performance and optimizations of blocked algorithms. ACM SIGOPS Operating Systems Review., 25 (1991) 63-74.
9. X. Li and M. Moreno Maza. Multithreaded parallel implementation of arithmetic operations modulo a triangular set. Proc. of PASCO '07, ACM Press, 53-59, 2007.
10. M. Monagan, K. Geddes, K. Heal, G. Labahn, S. Vorkoetter, J. McCarron, P. DeMarco. Maple 13 Introductory Programming Guide Maplesoft, 2009.
11. M. Monagan, R. Pearce. Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. Proc. of CASC 2007, Springer (2007) 295-315.
12. M. Monagan, R. Pearce. Sparse Polynomial Division Using a Heap. submitted to J. Symb. Comp., October 2008.
13. A. Norman, J. Fitch. CABAL: Polynomial and power series algebra on a parallel computer. Proc. of PASCO '97, ACM Press, pp. 196-203, 1997.
14. PARI/GP, version 2.3.4, Bordeaux, 2008, http://pari.math.u-bordeaux.fr/.
15. D. Reed, R. Kanodia. Synchronization with eventcounts and sequencers. Comm. of the ACM, 22 (2) (1979) 115-123.
16. L. Rudolph, M. Slivkin-Allalouf, and E. Upfal. A simple load balancing scheme for task allocation in parallel machines. Proc. of the third annual ACM symposium on Parallel algorithms and architectures., (1991), 237-245.
17. P. Sweazey, A. Smith. A Class of Compatible Cache Consistency Protocols and their Support by the IEEE Futurebus. Proc. of 13th Annual International Symposium on Computer Architecture, (1986), 414-423.
18. P. Wang. Parallel Polynomial Operations on SMPs. J. Symbolic. Comp., 21 397-410, 1996.
19. B. Wilkinson, M. Allen. Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice Hall, 1999.
20. C. Xavier, S. Iyengar. Introduction to Parallel Algorithms Wiley, 1998. Section 10.5 has an FFT based univariate multiplication.
21. T. Yan. The Geobucket Data Structure for Polynomials. J. Symb. Comput. 25 (1998) 285-293..