BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES

DOI10.1142/S0129054111008556MaRDI QIDQ3173933zbMATH OpenFDO

Authors Marc Moreno Maza, Yuzhen Xie

Publication date 10 October 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

multi-coreCilk++parallel multi-dimensional FFT/TFTparallel polynomial multiplicationparallel symbolic computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Software, source code, etc. for problems pertaining to computer science (68-04)

Recommendations

• Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
• Dense polynomial multiplication with reduced array manipulation overhead
• Massively parallel computations on many-variable polynomials
• On the parallel evaluation of multivariate polynomials
• Very Fast Parallel Polynomial Arithmetic
• Parallel sparse polynomial multiplication on modern hardware architectures
• Parallel multiplication and powering of polynomials
• scientific article; zbMATH DE number 3866580

Cites work

• Modern computer algebra

Cited in

(7)

• Efficient implementation of polynomial arithmetic in a multiple-level programming environment
• Dense polynomial multiplication with reduced array manipulation overhead
• The basic polynomial algebra subprograms
• Basic polynomial algebra subprograms
• Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
• BPAS
• Design and implementation of multi-threaded algorithms in polynomial algebra

Describes a project that uses

Uses Software

• modpn
• Cilk

This page was built for publication: BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES

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