Scheduling inverse trees under the communication model of the LogP-machine

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 137-168

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

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038030568     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00161-8     Document Type: Article

References (26)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullmann, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. F.D. Anger, J. Hwang, Y. Chow, Scheduling with sufficient loosely coupled processors, J. Parallel Distrib. Comput. 9 (1990) 87-92.
3. S. Chen, M.M. Eshaghian, Y.-C. Wu, Mapping arbitrary non-uniform task graphs onto arbitrary non-uniform system graphs, in: Proc. Internat. Conf. on Parallel Processing, 1995, pp. II 191-195.
4. P. Chretienne, A polynomial algorithm to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints, Eur. J. Oper. Res. 2 (1989) 225-230.
5. J.Y. Colin, P. Chretienne, CPM scheduling with small communication time, Oper. Res. 39 (1991) 680-684.
6. D. Culler, A.C. Dusseau, R.P. Martin, K.E. Schauser, Fast parallel sorting under LogP: from theory to practice, in: T. Hey, J. Ferrante (Eds.), Portability and Performance of Parallel Processing, Wiley, New York, 1994, pp. 71-98.
7. 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: 4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPOPP 93), published in: SIGPLAN Notices (28) 7 (1993) 1-12.
8. S. Darbha, D.P. Agrawal, SBDS: a task duplication based optimal algorithm, in: Scalable High Performance Conf., 1994.
9. 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, Berlin, 1994, pp. 254-264.
10. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
11. A. Gerasoulis, T. Yang, On the granularity and clustering of directed acyclic task graphs, IEEE Trans. Parallel Distrib. Systems 4 (1993) 686-701.
12. J.A. Hoogreven, J.K. Lenstra, B. Veltmann, Three, four, five, six or the complexity of scheduling with communication delays, Oper. Res. Lett. 16 (1994) 129-137.
13. H. Jung, L. Kirousis, P. Spirakis, Lower bounds and efficient algorithms for multiprocessor scheduling of DAGs with communication delays, Information and Computation 105 (1993) 94-104.
14. 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.
15. R.M. Karp, A. Sahay, E.E. Santos, K.E. Schauser, Optimal broadcast and summation in the LogP model, in: 5th Annual ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1993, pp. 142-153.
16. E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Management Sci. 19 (1973) 544-546.
17. J.K. Lenstra, M. Veldhorst, B. Veltmann, The complexity of scheduling trees with communication delays, J. Algorithms 20 (1996) 157-173.
18. 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.
19. W. Löwe, W. Zimmermann, Upper time bounds for executing PRAM-programs on the LogP-machine, in: M. Wolfe (Ed.), Proc. 9th ACM Internat. Conf. on Supercomputing, ACM, 1995, New York, pp. 41-50.
20. C.H. Papadimitrou, M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput. 19 (2) (1990) 322-328.
21. C. Picouleau, New complexity results on the UET-UCT scheduling algorithm, Proc. Summer School on Scheduling Theory and its Applications, 1992, pp. 187-501.
22. V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors, MIT Press, Cambridge, MA, 1989.
23. J. Siddhiwala, L.-F. Cha, Path-based task replication for scheduling with communication costs, in: Proc. Internat. Conf. on Parallel Processing, 1995, pp. II 186-190.
24. T. Yang, A. Gerasoulis, DSC: Scheduling parallel tasks on an unbounded number of processors, IEEE Trans. Parallel Distrib. Systems 5 (9) (1994) 951-967.
25. 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, Berlin, 1994, pp. 277-288.
26. W. Zimmermann, W. Löwe, J. Gottlieb, On the design and implementation of parallel algorithms for solving inverse problems, in: J. Gottlieb, P. Duchateav (Eds.), Parameter Identification and Inverse Problems in Hydrology, Geology and Ecology, Kluwer Academic Publishers, Dordrecht 1996, pp. 283-300.