An optimal parallel algorithm for Gaussian elimination
This paper presents the 2-steps graph which occurs in the parallelization of Gaussian elimination with partial pivoting. We compute the task deadlines and the lower bound of processors popt (n) for executing the task graph in minimal time (n is the size of the considered matrix). Finally, we present an optimal parallel algorithm with two processors.
KeywordsComplexity analysis Gaussian elimination Optimal parallel algorithm 2-steps graph
Unable to display preview. Download preview PDF.
- E. G. Coffman Jr., P. J. Denning, Operating system theory, Prentice Hall, Englewood Cliffs, NJ, 1973Google Scholar