Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems

DOI10.1007/978-3-319-02297-0_8MaRDI QIDQ5168463zbMATH OpenOpenAlexFDO

Authors Mickaël Gastineau, Jacques Laskar

Publication date 7 July 2014

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.7425

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99) Numerical algorithms for specific classes of architectures (65Y10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30)

Abstract: We present a highly scalable algorithm for multiplying sparse multivariate polynomials represented in a distributed format. This algo- rithm targets not only the shared memory multicore computers, but also computers clusters or specialized hardware attached to a host computer, such as graphics processing units or many-core coprocessors. The scal- ability on the large number of cores is ensured by the lacks of synchro- nizations, locks and false-sharing during the main parallel step.

Recommendations

• Parallel sparse polynomial multiplication on modern hardware architectures
• Parallel sparse polynomial multiplication using heaps
• scientific article; zbMATH DE number 1263395
• On the parallelization of subproduct tree techniques targeting many-core architectures
• BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES

Cited in

(10)

• On the parallelization of subproduct tree techniques targeting many-core architectures
• Parallel sparse polynomial multiplication using heaps
• BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
• Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
• scientific article; zbMATH DE number 852328 (Why is no real title available?)
• High-performance symbolic-numerics via multiple dispatch
• Basic polynomial algebra subprograms
• Parallel sparse polynomial multiplication on modern hardware architectures
• The basic polynomial algebra subprograms
• Design and implementation of multi-threaded algorithms in polynomial algebra

Describes a project that uses

Uses Software

• StarPU

This page was built for publication: Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168463)