An optimal schedule for Gaussian elimination on an MIMD architecture

Authors:
Rachid Saad
Affiliations:
Gatineau, Québec, Canada
Venue:
Journal of Computational and Applied Mathematics
Year:
2006

Citing 8
Cited 0

Optimal scheduling algorithms for parallel Gaussian elimination

Theoretical Computer Science - Special issue on high performance computer systems
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
Methods for message routing in parallel machines

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Parallelization of the Gaussian elimination algorithm on systolic arrays

Journal of Parallel and Distributed Computing
Some models for scheduling parallel programs with communication delays

Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Solving Linear Algebraic Equations on an MIMD Computer

Journal of the ACM (JACM)
Parallel Computer Architecture: A Hardware/Software Approach

Parallel Computer Architecture: A Hardware/Software Approach
A New Clustering Algorithm for Large Communication Delays

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Quantified Score

Hi-index	7.29

Visualization

Abstract

In this paper, we propose an algorithm for allocating the tasks of the well known Gaussian Elimination Algorithm on an MIMD architecture and prove that the schedule is optimal in order of magnitude, up to a polylog factor.