Communication costs versus computation costs in parallel Gaussian elimination
Proceedings of the international workshop on Parallel algorithms & architectures
Optimal scheduling algorithms for parallel Gaussian elimination
Theoretical Computer Science - Special issue on high performance computer systems
The impact of vector and parallel architectures on the Gaussian elimination algorithm
The impact of vector and parallel architectures on the Gaussian elimination algorithm
PYRROS: static task scheduling and code generation for message passing multiprocessors
ICS '92 Proceedings of the 6th international conference on Supercomputing
Solving Linear Algebraic Equations on an MIMD Computer
Journal of the ACM (JACM)
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Parallel Algorithms and Architectures
Parallel Algorithms and Architectures
Operating Systems Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Granularity and Clustering of Directed Acyclic Task Graphs
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Journal of Parallel and Distributed Computing
A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
Data parallel scheduling of operations in linear algebra on heterogeneous clusters
DIWEB'06 Proceedings of the 5th WSEAS International Conference on Distance Learning and Web Engineering
A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters
High Performance Computing for Computational Science - VECPAR 2008
| Hi-index | 0.00 |
We consider a graph theoretical model and study a parallel implementation of the well-known Gaussian elimination method on parallel distributed memory architectures, where the communication delay for the transmission of an elementary data is higher than the computation time of an elementary instruction. We propose and analyze two low-complexity algorithms for scheduling the tasks of the parallel Gaussian elimination on an unbounded number of completely connected processors. We compare these two algorithms with a higher-complexity general-purpose scheduling algorithm, the DSC heuristic, proposed by Gerasoulis and Yang.