On the Efficiency of Scheduling Algorithms for Parallel Gaussian Elimination with Communication Delays

Authors:
Raimondas Ciegis;Vadimas Starikovicius;Jerzy Wasniewski
Affiliations:
-;-;-
Venue:
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Year:
2000

Citing 4
Cited 1

Early prediction of MPP performance: the SP2, T3D, and Paragon experiences

Parallel Computing
A heuristic for scheduling task graphs with communication delays onto multiprocessors

Parallel Computing
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs

IEEE Transactions on Parallel and Distributed Systems
ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performance

PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science

A Scheme for Partitioning Regular Graphs

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Gaussian elimination method on parallel distributed memory computers. A theoretical model for the performance prediction is developed. It takes into account the workload distribution and the communication overhead. We investigate the efficiency of the parallel Gaussian algorithm with matrices distributed in 1D and 2D block and cyclic layouts. The results are generalized for block-block and block-cyclic distributions. We find the condition when communications are overlapped by the computations. Using this analysis we propose a simple heuristic for scheduling Gaussian elimination tasks. We compare the efficiency of this scheduling algorithm with the efficiency of the block and cycling data distributions.