Task-based parallel programming for scalable matrix product algorithms

DOI10.1145/3583560MaRDI QIDQ6601371zbMATH OpenFDO

Authors E. Agullo, Alfredo Buttari, Abdou Guermouche, Julien Herrmann, Antoine Jego

Publication date 10 September 2024

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

zbMATH Keywords

parallel programming modelsruntime systemsdistributed memory parallelismscalable linear algebra algorithmssequential task flow

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• scientific article; zbMATH DE number 554769 (Why is no real title available?)
• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• Accelerating scientific computations with mixed precision algorithms
• Communication lower bounds for distributed-memory matrix multiplication
• Communication-optimal parallel and sequential QR and LU factorizations
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• Minimizing communication in numerical linear algebra
• Parallel matrix multiplication: a systematic journey
• Programming matrix algorithms-by-blocks for thread-level parallelism

This page was built for publication: Task-based parallel programming for scalable matrix product algorithms

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