Scheduling a computational dag on a parallel system with communication delays and replication of node execution

Proceedings of 7th International Parallel Processing Symposium, IPPS 1993

Volumn , Issue , 1993, Pages 113-117

  Markenscoff, P ^a   Li, Y Y ^a  

^a UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; ELECTRONIC DATA INTERCHANGE; OPTIMIZATION; SCHEDULING;

COMMUNICATION DELAYS; COMPUTATIONAL GRAPH; COMPUTATIONAL TASK; DIRECTED ACYCLIC GRAPH (DAG); IDENTICAL PROCESSORS; OPTIMAL SCHEDULING; OPTIMIZATION CRITERIA; PRECEDENCE CONSTRAINTS;

PARALLEL PROCESSING SYSTEMS;

EID: 33244491610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPPS.1993.262865     Document Type: Conference Paper

References (15)

1. C. Gordon Bell. Gordon Bell on the Future of Computers. Interview in SIAM News, pp 2, February 1987.
2. C. V. Coffman and R. L. Graham. Optimal Scheduling for Two-Processor Systems. Acta Informatica, Vol. 1, pp 200-213, 1972.
3. E. G. Coffman. Computer and Job-Shop Scheduling Theory. New York, Wiley, 1976.
4. K. Efe Heuristic. Models of Task Assignment Scheduling in Distributed Systems. Computer J, Vol. IS, pp S0-S6, 1982.
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Compleleness. San Francisco, CA, Freeman, 1979.
6. T. C. Hu. Parallel Sequencing and Assembly Line Problem. Oper. Res. Vol. 9, pp 841-848, 1961.
7. J. J. Hwang, Y. C. Chow, F. D. Angers and C. Y. Lee. Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. Comput., Vol. 18, pp 244-269, 1989.
8. K. B. Irani and K. W. Chen. Minimization of Interprocessor Communication for Compulation. IEEE Trans. Comput., Vol. c-31. ppl067-1075, 1982.
9. H. Jung, L. Kirousis and P. Spirakis. Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of DAGs with Communication Delays. ACM Proc. Symposium on Theory of Computing (STOC), pp 254264, 1989.
10. R. M. Karp. Reducibility among Combinatorial Problems. Complexity of Computer Computations. R. E. Miller and J. W. Chatcher, eds. Plenum Press. New York, pp 85-103, 1972.
11. J. K. Lenstra and A. G. Kan. Complexity of Scheduling under Precedence Constraints. Oper. Res., Vol. 26, pp 22-35, 1978.
12. P. R. Ma, E. Y. S. Lee, and M. Tsuchiya. A Task Allocation Model for Distributed Computing Systems. IEEE Trans. Comput., Vol. C-31, pp 41-47, 1982.
13. P. Markenscoff and Y. Y. Li. An Optimal Algorithm for Scheduling the Nodes of a Computational Tree to the Processors of a Parallel System. Proc. of the 1991 ACM Computer Science Conference, pp 289-297, 1991.
14. C. H. Papadimitriou and J. D. Ullman. A Communication-time Tradeoff. ACM Proc. Symposium on Theory of Computing (STOC), pp 256-262, 1984.
15. C. H. Papadimitriou and M. Yannakakis. Towards an Architecture-Independent Analysis of Parallel Algorithms. ACM Proc. Symposium on Theory of Computing (STOC), pp 510-513, 1988.