A parallel Gauss-Seidel algorithm for sparse power system matrices
- Syracuse Univ., NY (United States)
The authors describe the implementation and performance of an efficient parallel Gauss-Seidel algorithm that has been developed for irregular, sparse matrices from electrical power systems applications. Although, Gauss-Seidel algorithms are inherently sequential, by performing specialized orderings on sparse matrices, it is possible to eliminate much of the data dependencies caused by precedence in the calculations. A two-part matrix ordering technique has been developed--first to partition the matrix into block-diagonal-bordered form using diakoptic techniques and then to multi-color the data in the last diagonal block using graph coloring techniques. The ordered matrices often have extensive parallelism, while maintaining the strict precedence relationships in the Gauss-Seidel algorithm. They present timing results for a parallel Gauss-Seidel solver implemented on the Thinking Machines CM-5 distributed memory multi-processor. The algorithm presented here requires active message remote procedure calls in order to minimize communications overhead and obtain good relative speedup.
- OSTI ID:
- 87622
- Report Number(s):
- CONF-941118-; ISBN 0-8186-6605-6; TRN: IM9535%%254
- Resource Relation:
- Conference: Supercomputing `94 meeting, Washington, DC (United States), 14-18 Nov 1994; Other Information: PBD: 1994; Related Information: Is Part Of Supercomputing `94: Proceedings; PB: 849 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Threshold partitioning of sparse matrices and applications to Markov chains
Implementation of a cell-wise Block-Gauss-Seidel iterative method for SN transport on a hybrid parallel computer architecture