An optimal schedule for Gaussian elimination on an MIMD architecture

DOI10.1016/j.cam.2005.01.028zbMath1086.65024OpenAlexW2062231973MaRDI QIDQ2570029

Rachid Saad

Publication date: 26 October 2005

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.01.028

zbMATH Keywords

computational complexityschedulingparallel computationGaussian eliminationMIMD

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Unnamed Item
• Scheduling parallel iterative methods on multiprocessor systems
• Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem
• Communication complexity of the Gaussian elimination algorithm on multiprocessors
• Parallel Gaussian elimination on an MIMD computer
• An approximation algorithm for scheduling trees of malleable tasks
• Impact of communications of the complexity of the parallel Gaussian elimination
• Optimal Parallel Scheduling of Gaussian Elimination DAG's
• Solving Linear Algebraic Equations on an MIMD Computer
• Some models for scheduling parallel programs with communication delays

This page was built for publication: An optimal schedule for Gaussian elimination on an MIMD architecture