Efficient parallel algorithm for the solution of large sparse linear matrix equations

Journal Article · Tue Mar 01 00:00:00 EST 1983 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1983.1676218· OSTI ID:5170320

Arnold, C P; Parr, M I; Dewe, M B

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 execution speed enhancement relative to the theoretical maximum is shown to be good. 12 references.

• Research Organization: Univ. of Canterbury, Christchurch, New Zealand
• OSTI ID: 5170320
• Journal Information: IEEE Trans. Comput.; (United States), Vol. 3
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
MATRICES
ALGORITHMS
ARCHITECTURE
COMPUTERS
EQUATIONS
PARALLEL PROCESSING
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers