Parallel polynomial operations on SMPs: an overview
Journal of Symbolic Computation - Special issue on parallel symbolic computation
Scheduling multithreaded computations by work stealing
Journal of the ACM (JACM)
Hoard: a scalable memory allocator for multithreaded applications
ACM SIGPLAN Notices
Polynomial Algorithms in Computer Algebra
Polynomial Algorithms in Computer Algebra
PARSAC-2: A Parallel SAC-2 Based on Threads
AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Virtual Tasks for the PACLIB Kernel
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
The S-Threads Environment for Parallel Symbolic Computation
Proceedings of the Second International Workshop on Computer Algebra and Parallelism
Comparing the speed of programs for sparse polynomial multiplication
ACM SIGSAM Bulletin
Scalable locality-conscious multithreaded memory allocation
Proceedings of the 5th international symposium on Memory management
Intel threading building blocks
Intel threading building blocks
SINGULAR: a computer algebra system for polynomial computations
ACM Communications in Computer Algebra
Parallel sparse polynomial multiplication using heaps
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Development of TRIP: fast sparse multivariate polynomial multiplication using burst tries
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
TRIP: a computer algebra system dedicated to celestial mechanics and perturbation series
ACM Communications in Computer Algebra
POLY: a new polynomial data structure for Maple 17
ACM Communications in Computer Algebra
Parallel sparse polynomial multiplication on modern hardware architectures
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
| Hi-index | 0.00 |
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memory management and load-balancing in order to obtain linear speedup. The widely used Poisson bracket during the studies of the dynamical systems had been parallelized on these computers. Benchmarks are presented, comparing our implementation to the other computer algebra systems.