This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs
July 1998 (vol. 9 no. 7)
pp. 679-686

Abstract—We consider a graph theoretical model and study a parallel implementation of the well-known Gaussian elimination method on parallel distributed memory architectures, where the communication delay for the transmission of an elementary data is higher than the computation time of an elementary instruction. We propose and analyze two low-complexity algorithms for scheduling the tasks of the parallel Gaussian elimination on an unbounded number of completely connected processors. We compare these two algorithms with a higher-complexity general-purpose scheduling algorithm, the DSC heuristic, proposed by Gerasoulis and Yang.

[1] A.K. Amoura, E. Bampis, and J.-C. König, "Efficient Algorithms for Parallel Gaussian Elimination on Distributed Memory Machines," Report No. 1026, LRI, UniversitéParis-Sud, Orsay, France, 1995.
[2] E. Bampis, J.-C. König, and D. Trystram, "Impact of Communications on the Complexity of the Parallel Gaussian Elimination," Parallel Computing, vol. 17, no. 1, pp. 55-61, Apr. 1991.
[3] E.G. Coffman and P.J. Denning,Operating Systems Theory, Prentice-Hall Inc., Englewood Cliffs, N.J., 1973.
[4] M. Cosnard, M. Marrakchi, Y. Robert, and D. Trystram, "Parallel Gaussian Elimination on a MIMD Computer," Parallel Computing, vol. 6, no. 3, pp. 275-296, Mar. 1988.
[5] M. Cosnard, J.M. Muller, Y. Robert, and D. Trystram, "Communication Costs versus Computation Costs in Parallel Gaussian Elimination," Parallel Algorithmes and Architectures, pp. 19-29, 1986.
[6] M. Cosnard, Y. Robert, and B. Tourancheau, "Evaluating Speedups on Distributed Memory Architectures," Parallel Computing, vol. 10, no. 2, pp. 247-253, Apr. 1989.
[7] M. Cosnard and D. Trystram, Algorithmes et Architectures Paralléles.France: Inter-Editions, 1993.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[9] T.H. Dunigan, "Performance of the Intel iPSC/860 and n-Cube 6400 Hypercubes," Parallel Computing, vol. 17, nos. 10and 11, pp. 1,285-1,302, Dec. 1991.
[10] A. Gerasoulis and T. Yang,"On the granularity and clustering of directed acyclic task graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 686-701, June 1993.
[11] A. Gerasoulis and T. Yang, "A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors," J. Parallel and Distributed Computing, vol. 16, no. 1, pp. 276-291, Dec. 1992.
[12] R.E. Lord, J.S. Kowalik, and S.P. Kumar, "Solving Linear Algebraic Equations on an MIMD Computer," J. ACM, vol. 30, no. 3, pp. 103-117, Jan. 1983.
[13] C. Picouleau, "Etude des Problémes d'Optimisation dans les Systémes Distribués," PhD thesis, Univ. Paris-VI, France, 1992.
[14] Y. Robert, The Impact of Vector and Parallel Architectures on Gaussian Elimination Algorithm. Halsted Press, 1990.
[15] Y. Robert and D. Trystram, "Optimal Scheduling Algorithms for Parallel Gaussian Elimination," Theoretical Computer Science, vol. 64, pp. 159-173, 1989.
[16] Y. Saad, "Communication Complexity of the Gaussian Elimination Algorithm on Multiprocessors," Report DCS/348, Yale Univ., 1985.
[17] Y. Saad and M.H. Schultz, "Data Communication in Parallel Architectures," Parallel Computing, vol. 11, no. 2, pp. 131-150, Aug. 1989.
[18] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.
[19] B. Veltman, B.J. Lageweg, and J.K. Lenstra, "Multiprocessor Scheduling with Communication Delays," Parallel Computing, vol. 16, nos. 2and 3, pp. 173-182, Dec. 1990.
[20] T. Yang and A. Gerasoulis, “PYRROS: Static Scheduling and Code Generation for Message Passing Multiprocessors,” Proc. Sixth ACM Int'l Conf. Supercomputing, pp. 428-437, 1992.
[21] T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 951-967, 1994.

Index Terms:
Distributed architectures, Gaussian elimination method, communication delays, partitioning, mapping, scheduling.
Citation:
Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König, "Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 7, pp. 679-686, July 1998, doi:10.1109/71.707547
Usage of this product signifies your acceptance of the Terms of Use.