Scheduling tree-dags using FIFO queues: A control-memory trade-off

Journal of Parallel and Distributed Computing

Volumn 33, Issue 1, 1996, Pages 55-68

  Bhatt, Sandeep N ^a,b   Chung, Fan R K ^c   Leighton, F Thomas ^d   Rosenberg, Arnold L ^e  

^a TELCORDIA TECHNOLOGIES   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030600713     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0024     Document Type: Article

References (18)

1. 1. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou, Cilk: An efficient multithreaded runtime system, 5th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 1995.
2. 2. A. Gerasoulis and T. Yang, A comparison of clustering heuristics for scheduling dags on multiprocessors, J. Parallel Distrib. Comput. 16, 276-291 (1992).
3. 3. A. Gerasoulis and T. Yang, Scheduling program task graphs on MIMD architectures, in Algorithm Derivation and Program Transformation (R. Paige, J. Reif, and R. Wachter, Eds.) Kluwer, Dordrecht, 1992.
4. 4. A. Gerasoulis and T. Yang, Static scheduling of parallel programs for message passing architectures, Parallel Processing: CONPAR 92 - VAPP V. Lecture Notes in Computer Science, Vol. 634, Springer-Verlag, Berlin, 1992, pp. 601-612.
5. 5. L. S. Heath, F. T. Leighton, and A. L. Rosenberg, Comparing queues and stacks as mechanisms for laying out graphs, SIAM J. Discrete Math. 5, 398-412 (1992).
6. 6. L. S. Heath, S. V. Pemmaraju, and A. Trenk, Stack and queue layouts of directed acyclic graphs, in Planar Graphs (W. T. Trotter, Ed.), Amer. Math. Soc. Providence, RI, 1993, pp. 5-11.
7. 7. L. S. Heath and A. L. Rosenberg, Laying out graphs using queues, SIAM J. Comput. 21, 927-958 (1992).
8. 8. S. J. Kim and J. C. Browne, A general approach to mapping of parallel computations upon multiprocessor architectures, Intl. Conf. on Parallel Processing, 1988, Vol. 3, pp. 1-8.
9. 9. M. Litzkow, M. Livny, and M. Matka, Condor - A hunter of idle workstations. 8th Ann. Intl. Conf. on Distributed Computing Systems, 1988.
10. 10. D. Nichols, Multiprocessing in a network of workstations, Ph.D. thesis, CMU, 1990.
11. 11. C. H. Papadimitriou and M. Yannakakis, Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput. 19, 322-328 (1990).
12. 12. M. S. Paterson and C. E. Hewitt, Comparative schematology, Project MAC Conf. on Concurrent Systems and Parallel Computation, ACM Press, New York, 1970, pp. 119-128.
13. 13. S. V. Pemmaraju, Exploring the powers of stacks and queues via graph layouts, Ph.D. Thesis, Virginia Polytechnic Inst., 1992.
14. 14. A. L. Rosenberg, Encoding data structures in trees, J. Assoc. Comput. Mach. 26, 668-689 (1979).
15. 15. S. W. White and D. C. Torney, Use of a workstation cluster for the physical mapping of chromosomes, SIAM NEWS March, 14-17 (1993).
16. 16. J. Yang, L. Bic, and A. Nicolau, A mapping strategy for MIMD computers, Intl. Conf. on Parallel Processing, 1991, Vol. 1, pp. 102-109.
17. 17. T. Yang and A. Gerasoulis, A fast static scheduling algorithm for dags on an unbounded number of processors, Supercomputing '91, pp. 633-642.
18. 18. T. Yang and A. Gerasoulis, PYRROS: static task scheduling and code generation for message passing multiprocessors, 6th ACM Conf. on Supercomputing, 1992, pp. 428-437.