This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Parallel Algorithm for the Solution of Large Sparse Linear Matrix Equations
March 1983 (vol. 32 no. 3)
pp. 265-273
C.P. Arnold, Department of Electrical Engineering, University of Canterbury
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.
Index Terms:
synchronization schemes, Computer architecture, linear equations, MIMD, parallel processors, power systems analysis, simulation, speedup
Citation:
C.P. Arnold, M.I. Parr, M.B. Dewe, "An Efficient Parallel Algorithm for the Solution of Large Sparse Linear Matrix Equations," IEEE Transactions on Computers, vol. 32, no. 3, pp. 265-273, March 1983, doi:10.1109/TC.1983.1676218
Usage of this product signifies your acceptance of the Terms of Use.