The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1983 vol.32)
pp: 1109-1117
M.A. Srinivas , Department of Computer Science, Pennsylvania State University
ABSTRACT
A parallel algorithm for Gaussian elimination (GE) is described, which solves a linear system of size n using m = n parallel processors and a shared random access memory. Converting the serial GE algorithm to parallel form involves scheduling its computation DAG (directed acyclic graph) on m processors. A lower bound for schedule length is established for dense GE DAG's and it is proved that the proposed algorithm produces schedules which achieve these bounds. Finally, both the construction and execution of the schedule are incorporated into a single concurrent program which is shown to run in optimal time.
INDEX TERMS
scheduling, Dense matrices, directed acyclic graphs, Gaussian elimination, linear systems, parallel computation
CITATION
M.A. Srinivas, "Optimal Parallel Scheduling of Gaussian Elimination DAG's", IEEE Transactions on Computers, vol.32, no. 12, pp. 1109-1117, December 1983, doi:10.1109/TC.1983.1676171
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool