Scheduling in and out forests in the presence of communication delays

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 10, 1996, Pages 1065-1074

  Varvarigou, Theodora A ^a,d   Roychowdhury, Vwani P ^b,d   Kailath, Thomas ^c,d   Lawler, Eugene ^e  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Stanford University   (United States)

^d IEEE

^e NONE

Author keywords

Communication delays; Multiprocessor architectures; Optimal deterministic schedules; Out forest precedence graphs; Polynomial time algorithms

Indexed keywords

COMMUNICATION DELAYS; LINEAR TIME ALGORITHM; OPTIMAL DETERMINISTIC SCHEDULES; OUT FOREST PRECEDENCE GRAPHS; POLYNOMIAL TIME ALGORITHMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; GRAPH THEORY; MULTIPROCESSING SYSTEMS; POLYNOMIALS; SCHEDULING;

COMPUTER OPERATING SYSTEMS;

EID: 0030261032     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.539738     Document Type: Article

References (19)

1. F.D. Anger, J.-J. Hwang, and Y.-C. Chow, "Scheduling with Sufficient Loosely Coupled Processors," J. Parallel and Distributed Computing, vol. 9, pp. 87-92, 1990.
2. P. Chretienne, "A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System Under Tree-Like Precedence Graphs," European J. Operational Research, vol. 43, pp. 225-230, 1988.
3. P. Chretienne, "Task Scheduling Over Distributed Memory Machines," Proc. Int'l Workshop Parallel and Distributed Algorithms, 1988.
4. J. Colin and P. Chretienne, "Cpm Scheduling with Small Communication Delays and Task Duplication," Technical Report M.A.S.I 90.1, Université Pierre et Marie Curie, France, Jan. 1990.
5. D. Dolev and M.K. Warmuth, "Profile Scheduling of Opposing Forests and Level Orders," SIAM J. Algorithms and Discrete Methods, vol. 6, pp. 87-92, Oct. 1985.
6. M. Fujii, T. Kasami, and K. Ninomiya, "Optimal Scheduling of Two Equivalent Processors," SIAM J. Applied Math., vol. 17, pp. 784-789, 1969.
7. H.N. Gabow, "A Linear Time Recognition Algorithm for Interval DAGs," Information processing Letters, vol. 12, pp. 20-22, 1981.
8. H.N. Gabow, "An Almost Linear Algorithm for Two Processor Scheduling," J. ACM, vol. 29, pp. 766-780, 1982.
9. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman, 1979.
10. M.R. Garey, D.S. Johnson, R.E. Tarjan, and M. Yannakakis, "Scheduling Opposing Forests," SIAM J. Algorithms and Discrete Methods, vol. 4, pp. 72-93, Mar. 1983.
11. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, "Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey," Annals Discrete Math., vol. 5, pp. 287-326, 1979.
12. T.C. Hu, "Parallel Sequencing and Assembly Line Problems," Operations Research, vol. 9, pp. 841-848, 1961.
13. E.W. Mayr, "Well Structured Parallel Programs Are Not Easy to Schedule," Technical Report STAN-CS-81-880, Stanford Univ., Stanford, Calif., 1981.
14. C.H. Papadimitriou and M. Yannakakis, "Scheduling Interval Order Tasks," SIAM J. Computing, vol. 10, pp. 405-409, 1979.
15. C.H. Papadimitriou and M. Yannakakis, "Towards an Architecture-Independent Analysis of Parallel Algorithms," SIAM J. Computing, vol. 19, no 2, pp. 322-328, Apr. 1990.
16. J.D. Ullman, "NP-Complete Scheduling Problems," J. Computer and Systems Science, vol. 10, pp. 384-393, 1975.
17. T.A. Varvarigou, "Scheduling and Fault Tolerance Issues in Multiprocessor Systems," PhD thesis, Stanford Univ., Stanford, Calif., Dec. 1991.
18. T. Varvarigou, V.P. Roychowdhury, and T. Kailath, "Scheduling In and Out Forests in the Presence of Communication Delays," Proc. Int'l Parallel Processing Symp. (IPPS '93), pp. 222-229, Newport Beach, Calif., Apr. 1993.
19. M.K. Warmuth, "Scheduling in Profiles of Constant Breadth," PhD thesis, Dept. of Computer Science, Univ. of Colorado, Boulder, Aug. 1981.