Proceedings of the 4th International Workshop on Parallel and Symbolic Computation 2010
DOI: 10.1145/1837210.1837220
|View full text |Cite
|
Sign up to set email alerts
|

Parallel operations of sparse polynomials on multicores

Mickaël Gastineau

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 20 publications
0
5
0
Order By: Relevance
“…-Example 2 : f 2 × g 2 with f = (1 + x + y + 2z 2 + 3t 3 + 5u 5 ) 25 and g 2 = (1 + u + t + 2z 2 + 3y 3 + 5x 5 ) 25 . As shown in [2] and [1], a linear speedup is quite difficult to obtain on this very sparse example. f 2 and g 2 have 142506 terms and the result contains 312855140 terms.…”
Section: Benchmarksmentioning
confidence: 91%
See 2 more Smart Citations
“…-Example 2 : f 2 × g 2 with f = (1 + x + y + 2z 2 + 3t 3 + 5u 5 ) 25 and g 2 = (1 + u + t + 2z 2 + 3y 3 + 5x 5 ) 25 . As shown in [2] and [1], a linear speedup is quite difficult to obtain on this very sparse example. f 2 and g 2 have 142506 terms and the result contains 312855140 terms.…”
Section: Benchmarksmentioning
confidence: 91%
“…Several parallel algorithms have been proposed for modern parallel hardware. An algorithm for the recursive representation has been designed using a work-stealing technique [1]. It scales at least up to 128 cores for large polynomials.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The (RD) time is the optimized recursive dense data structure POLPV. Both use multiprecision rational coefficients and Trip's parallel routines [5].…”
Section: A Factorization Benchmarkmentioning
confidence: 99%
“…As these operations rely on products, the series multiplication has been tuned and takes advantage of the multiple processors and cores available on several computers [5] . Instead of performing the full product, the product could be truncated on the partial or total degree of one or more variables.…”
Section: Operationsmentioning
confidence: 99%