Scheduling algorithms for parallel Gaussian elimination with communication costs

IEEE Transactions on Parallel and Distributed Systems

Volumn 9, Issue 7, 1998, Pages 679-686

  Amoura, Abdel Krim ^a   Bampis, Evripidis ^b   König, Jean Claude ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Communication delays; Distributed architectures; Gaussian elimination method; Mapping; Partitioning; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; GRAPH THEORY; MATHEMATICAL MODELS; STORAGE ALLOCATION (COMPUTER);

PARALLEL DISTRIBUTED MEMORY ARCHITECTURES; PARALLEL GAUSSIAN ELIMINATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0032114741     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.707547     Document Type: Article

References (21)

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 System Theory. Englewood Cliffs, N.J.: Prentice Hall, 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 Speed-ups 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. Garey and D. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman, 1979.
9. T.H. Dunigan, "Performance of the Intel iPSC/860 and n-Cube 6400 Hypercubes," Parallel Computing, vol. 17, nos. 10 and 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 Trans. 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. 2 and 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, no 9, pp. 951-967, Sept. 1994.