Some models for scheduling parallel programs with communication delays

Discrete Applied Mathematics

Volumn 72, Issue 1-2, 1997, Pages 5-24

  Bampis, Evripidis ^a   Guinand, Frédéric ^b   Trystram, Denis ^b  

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

^b INPG IMAG   (France)

Author keywords

Complete trees; DAGs, grids; Parallel processing; Scheduling, communications

Indexed keywords

EID: 0042722590     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00034-0     Document Type: Article

References (34)

1. F. Afrati, C.H. Papadimitriou and G. Papageorgiou, Scheduling DAGs to minimize time and computation, in: Proceedings of the Aegian Workshop on Computing (AWOC) (1988) 134-138.
2. R.J. Anderson, P. Beame and W. Ruzzo, Low overhead parallel schedules for task graphs, in: Proceedings of SPAA (1990) 66-75.
3. A. Aggarwal, A.K. Chandra and M. Snir, Communication complexity of PRAMs, Theoret. Comput. Sci. 71 (1990) 3-28.
4. E. Bampis, L'impact des communications sur la complexité des algorithmes parallèles, Ph.D. Thesis. University of Paris-Sud, France (1993).
5. E. Bampis, C. Delorme and J-C. König, Optimal schedules for dD-grid graphs with communication delays, in: C. Puech, R. Reischuk eds., STACS'96 LNCS No. 1046, 655-666.
6. E. Bampis, J-C. König and D. Trystram, Impact of communications on the complexity of the parallel Gaussian elimination, Parallel Comput. 17 (1991) 55-61.
7. E. Bampis, J-C. König and D. Trystram, A low overhead schedule for a 3D-Grid Graph, Parallel Process. Lett. 2 (1992) 363-372.
8. E. Bampis, J-C. König and D. Trystram, Optimal parallel execution of complete binary trees and grids into most popular interconnection networks, Theoret. Comput. Sci. 147 (1995) 1-18.
9. E. Bampis, J.-C. König and D. Trystram, Minimizing the schedule length for a parallel 3D-grid precedence graph, European J. Oper. Res., to appear.
10. E.G. Coffman and P.J. Denning, Operating Systems Theory (Prentice Hall, Englewood Cliffs, NJ, 1972).
11. J.-Y. Colin and P. Chretienne, CPM scheduling with small interprocessor communication delays, Oper. Res. 39 (1991) 680-684.
12. M. Cosnard and A. Ferreira, Designing parallel non numerical algorithms, in: D.J. Evan et al., eds., Parallel Computing '91, (North-Holland, Amsterdam, 1991) 3-18.
13. J. DE Rumeur, Communications dans les réseaux de processeurs, Masson, collection ERI, 1994.
14. L. Gao, A.L. Rosenberg and R.K. Sitaraman, Optimal architecture-independent scheduling of fine-grain tree-sweep computations, in: Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing (1995) 620-629.
15. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
16. F. Guinand, Ordónnancement avec communications pour architectures multiprocesseurs dans divers modèles d'exécution, Ph.D. Thesis, INPG, Grenoble, France (1995).
17. F. Guinand and D. Trystram, Optimal scheduling of UECT trees on two processors, Technical Report APACHE, no 3, LMC-IMAG, Grenoble, France (1993).
18. A. Jakoby and R. Reischuk, The complexity of scheduling problems with communication delays for trees, in: Proceedings of the Scandinavian Workshop of Algorithmic Theory, Lecture Notes in Computer Science, Vol. 621 (Springer, Berlin, 1992) 165-177.
19. H. Jung, L. Kirousis and P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, in: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (1989) 254-264. Inform. Comput. 105 (1993) 94-104.
20. H. Jung, L. Kirousis and P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, in: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures (1989) 254-264. Inform. Comput. 105 (1993) 94-104.
21. B.J. Lageweg, J.K. Lenstra and B. Veltman, Multiprocessor scheduling with communication delays, Parallel Comput 16 (1990) 173-182.
22. E.L. Lawler, Scheduling trees on multiprocessors with unit communication delays, Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake Como, Italy, 14-18 June (1993).
23. T. Leighton, Methods for message routing in parallel machines, in: Proceedings of the 24th Annual ACM Symposium on Theory Comput. (1992) 77-96.
24. M.G. Norman, P. Thanisch and K.-F. Chang Partitioning DAG computations: a cautionary note, in: W. Joosen and E. Milgrom, eds., Parallel Computing: From Theory to Sound Practice (IOS Press, 1992) 360-363.
25. C. Papadimitriou and J. Ullman, A communication time tradeoff, SIAM J. Comput. 16 (1987) 639-646.
26. C. Papadimitriou and M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms. in: Proceedings of 20th ACM Symposium on Theory of Computing (1988). SIAM J. Comput. 19 (1990) 322-328.
27. C. Papadimitriou and M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms. in: Proceedings of 20th ACM Symposium on Theory of Computing (1988). SIAM J. Comput. 19 (1990) 322-328.
28. C. Picouleau, Elude des Problèmes d'Optimisation dans les Systèmes Distribués, Ph.D. Thesis, University of Paris VI, France (1993).
29. V.J. Rayward-Smith, UET scheduling with unit interprocessor communication delays, Discrete Appl. Math. 18 (1987) 55-71.
30. T. Varvarigou, V.P. Roychowdhury and T. Kailath, Scheduling in and out forests in the presence of communication delays. in: Proceedings of International Parallel Processing Symp. (IPPS'93) (1993) 173-182.
31. T. Varvarigou, V.P. Roychowdhury and T. Kailath, E. Lawler, Scheduling in and out forests in the presence of communication delays, IEEE Tran. Parallel Distributed Systems, to appear.
32. M. Veldhorst, A linear time algorithm to schedule trees with communication delays optimally on two machines. Technical Report RUU-CS-93-04, Department of Computer Science, Utrecht (January 1993).
33. B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, CWI-Amsterdam, Holland (1993).
34. B. Veltman, B.J. Lageweg and J.K. Lenstra, Multiprocessor scheduling with communication delays, Parallel Comput. 16 (1990) 173-182.