Scheduling balanced task-graphs to LogP-machines

Parallel Computing

Volumn 26, Issue 9, 2000, Pages 1083-1108

  Löwe, Welf ^a   Zimmermann, Wolf ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; FAST FOURIER TRANSFORMS; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; PARTIAL DIFFERENTIAL EQUATIONS; RESPONSE TIME (COMPUTER SYSTEMS);

SCHEDULING TASK GRAPHS;

PARALLEL PROCESSING SYSTEMS;

EID: 0343789659     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(00)00030-2     Document Type: Article

References (39)

1. A. Alexandrov, M. Ionescu, K.E. Schauser, C. Scheimann, LogGP: Incorporating long messages into the LogP-model - one step closer towards a realistic model for parallel computation, in: Seventh Annual Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1995, pp. 95-105.
2. Anger F.D., Hwang J., Chow Y. Scheduling with sufficient loosely coupled processors. J. Parallel Distributed Comput. 9:1990;87-92.
3. M.C.S. Boeres, Versatile communication cost modelling for multicomputer task scheduling heurstics, Ph.D.Thesis, University of Edinburgh, 1996.
4. C. Boeres, V.E.F. Rebello, D. Skillicorn, Static scheduling using task replication for LogP- and BSP-models, in: Europar'98: Parallel Processing, Lecture Notes in Computer Science, vol. 1470, 1998, pp. 337-346.
5. Brent R.P. The parallel evaluation of general arithmetic expressions. Journal of the ACM. 1974;201-206.
6. Chretienne P. A polynomial algorithm to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints. European J. Oper. Res. 2:1989;225-230.
7. P. Chretienne, C. Picouleau, Scheduling with communication delays, in: P. Chretienne, E.G. Hoffmann, J.K. Lenstra (Eds.), Scheduling Theory and its Applications, 1995, pp. 65-90.
8. Cole R., Hopcroft J. On edge coloring bipartite graphs. SIAM J. Comput. 11(3):1982;540-546.
9. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), 1993, pp. 1-12, published in: SIGPLAN Notices vol. 28 (7).
10. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP 93), 1993, pp. 1-12, published in: SIGPLAN Notices vol. 28 (7).
11. Culler D., Karp R., Patterson D., Sahay A., Schauser K.E., Santos E., Subramonian R., von Eicken T. LogP: a practical model of parallel computation. Commun. ACM. 39(11):1996;78-85.
12. S. Darbha, D.P. Agrawal, SBDS: a task duplication based optimal algorithm, in: Scalable High Performance Conference, 1994.
13. B. Di Martino, G. Ianello, Parallelization of non-simultaneous iterative methods for systems of linear equations, in: Parallel Processing: CONPAR 94 - VAPP VI, Lecture Notes in Computer Science, vol. 854, Springer, Heidelberg, 1994, pp. 253-264.
14. J. Eisenbiegler, W. Löwe, W. Zimmermann, Optimizing parallel programs on machines with expensive communication, in: Europar' 96 Parallel Processing vol. 2, Lecture Notes in Computer Science, vol. 1124, Springer, Heidelberg, 1996, pp. 602-610.
15. J. Eisenbiegler, W. Löwe, A. Wehrenpfennig, On the optimization by redundancy using an extended LogP-model, in: International Conference on Advances in Parallel and Distributed Computing (APDC'97), IEEE Computer Soc. Press, Silver Spring, MD, 1997, pp. 149-155.
16. J. Eisenbiegler, W. Löwe, W. Zimmermann, BSP, LogP, and Oblivious Algorithms, in: Europar'98: Parallel Processing, Lecture Notes in Computer Science, vol. 1470, 1998, pp. 865-874.
17. A. Gerasoulis, T. Yang, On the granularity and clustering of directed acyclic task-graphs, IEEE Trans. Parallel Distributed Sys. 4 (June), 1993, pp. 686-701.
18. Hoogreven J.A., Lenstra J.K., Veltmann B. Three, four, five, six or the complexity of scheduling with communication delays. Oper. Res. Lett. 16:1994;129-137.
19. Jung H., Kirousis L.M., Spirakis P. Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. Inf. Comput. 105:1993;94-104.
20. T. Kalinowski, I. Kort, D. Trystram, List Scheduling of General Task-Graphs under LogP-Model, Technical Report 865, Institute of Computer Science, Polish Academy of Sciences, 1998.
21. R.M. Karp, V. Ramachandran, Parallel algorithms for shared memory machines, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, MIT Press, Cambridge, MA, 1990, pp. 871-941.
22. R.M. Karp, A. Sahay, E.E. Santos, K.E. Schauser, Optimal broadcast and summation in the LogP-model, in: Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York, 1993, pp. 142-153.
23. I. Kort, D. Trystram, Scheduling fork graphs under LogP with an unbounded number of processors, in: Europar'98: Parallel Processing, Lecture Notes in Computer Science, vol. 1470, 1998, pp. 940-943.
24. Lenstra J.K., Veldhorst M., Veltmann B. The complexity of scheduling trees with communication delays. J. Alg. 20:1996;157-173.
25. W. Löwe, W. Zimmermann, On finding optimal clusterings in task-graphs, in: N. Mirenkov (Ed.), Parallel Algorithms/Architecture Synthesis pAs'95, IEEE Press, New York, 1995, pp. 241-247.
26. W. Löwe, W. Zimmermann, Upper time bounds for executing PRAM-programs on the LogP-machine, in: M. Wolfe (Ed.), Proceedings of the Ninth ACM International Conference on Supercomputing, ACM Press, New York, 1995, pp. 41-50.
27. W. Löwe, W. Zimmermann, J. Eisenbiegler, On linear schedules for task-graphs for generalized LogP-machines, in: Europar'97: Parallel Processing, Lecture Notes in Computer Science, vol. 1300, 1997, pp. 895-904.
28. W. Löwe, J. Eisenbiegler, W. Zimmermann, Optimizing parallel programs on machines with fast communication, in: Ninth International Conference on Parallel and Distributed Computing Systems, 1996, pp. 100-103.
29. Middendorf M., Löwe W., Zimmermann W. Scheduling inverse trees under the communication model of the LogP-machine. Theor. Comput. Sci. 125(3):1999;137-168.
30. Papadimitriou C.H., Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 19(2):1990;322-328.
31. C. Picouleau, New complexity results on the UET-UCT scheduling algorithm, in: Proceedings of Summer School on Scheduling Theory and its Applications, 1992, pp. 187-201.
32. J. Siddhiwala, L.-F. Cha, Path-based task replication for scheduling with communication cost, in: Proceedings of the International Conference on Parallel Processing II, 1995, pp. 186-190.
33. Rayward-Smith V.J. UET scheduling with unit interprocessor communication delays. Disc. Appl. Math. 18:1987;55-71.
34. H. Saranand, V. Vazirani, Finding k-cuts within twice the optimal, in: 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 743-751, IEEE Computer Soc. Press, Silver Spring, MD, 1991.
35. V. Sarkar, Partitioning and scheduling parallel programs for multiprocessors, Res. Monographs Parallel Distributed Comput., MIT Press, Cambridge MA, 1989.
36. J. Verriet, Scheduling tree-structured programs in the LogP-model, Technical Report UU-CS-1997-18, Department of Computer Science, Utrecht University, 1997.
37. Yang T., Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel Distributed Sys. 5(9):1994;951-967.
38. W. Zimmermann, W. Löwe, An approach to machine-independent parallel programming, in: Parallel Processing: CONPAR 94 - VAPP VI, Lecture Notes in Computer Science, vol. 854, Springer, Heidelberg, 1994, pp. 277-288.
39. W. Zimmermann, M. Middendorf, W. Löwe, On optimal k-linear scheduling of tree-like task-graphs for LogP-machines, in: Europar'98: Parallel Processing, Lecture Notes in Computer Science, vol. 1470, 1998, pp. 328-336.