An Efficient Parallel Algorithm for the Solution of Large Sparse Linear Matrix Equations
- 1 March 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (3), 265-273
- https://doi.org/10.1109/tc.1983.1676218
Abstract
An algorithm for the parallel solution of large sparse sets of linear equations, given their factor matrices, is developed. It is aimed at efficient practical implementation on a processor of the multiple instruction multiple data stream (MIMD) type. The software required to implement the algorithm is described. In addition, the amount of memory necessary for data retention during execution is considered and related to that which is required on single processor systems. Hardware developed for the implementation of the algorithm is described. Bus contention for the system is outlined and shown to be insignificant. Possible bus contention problems for systems differing in the number of processors and speed of processing elements are also considered. A simulator modeling the execution of the algorithm on large systems has been implemented. The performance of the algorithm, in terms of execution speed enhancement relative to the theoretical maximum, is shown to be good.Keywords
This publication has 5 references indexed in Scilit:
- Performance of Processor-Memory Interconnections for MultiprocessorsIEEE Transactions on Computers, 1981
- A Computation Model of Parallel Solution of Linear EquationsIEEE Transactions on Computers, 1980
- On Block-Parallel Methods for Solving Linear EquationsIEEE Transactions on Computers, 1980
- Parallel Processing of Power System Analysis Problems Via Simple Parallel Microcomputer StructuresIEEE Transactions on Power Apparatus and Systems, 1978
- A feasibility study for the solution of transient stability problems by multiprocessor structuresIEEE Transactions on Power Apparatus and Systems, 1977