
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Theodora A. Varvarigou, Vwani P. Roychowdhury, Thomas Kailath, Eugene Lawler, "Scheduling In and Out Forests in the Presence of Communication Delays," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 10651074, October, 1996.  
BibTex  x  
@article{ 10.1109/71.539738, author = {Theodora A. Varvarigou and Vwani P. Roychowdhury and Thomas Kailath and Eugene Lawler}, title = {Scheduling In and Out Forests in the Presence of Communication Delays}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {10}, issn = {10459219}, year = {1996}, pages = {10651074}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.539738}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Scheduling In and Out Forests in the Presence of Communication Delays IS  10 SN  10459219 SP1065 EP1074 EPD  10651074 A1  Theodora A. Varvarigou, A1  Vwani P. Roychowdhury, A1  Thomas Kailath, A1  Eugene Lawler, PY  1996 KW  Communication delays KW  outforest precedence graphs KW  multiprocessor architectures KW  outforest precedence graphs KW  optimal deterministic schedules KW  polynomialtime algorithms. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We consider the problem of scheduling tasks on multiprocessor architectures in the presence of communication delays. Given a set of dependent tasks, the
[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. 8792, 1990.
[2] P. Chretienne, "A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System Under TreeLike Precedence Graphs," European J. Operational Research, vol. 43, pp. 225230, 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. 8792, Oct. 1985.
[6] M. Fujii, T. Kasami, and K. Ninomiya, "Optimal Scheduling of Two Equivalent Processors," SIAM J. Applied Math., vol. 17, pp. 784789, 1969.
[7] H.N. Gabow, "A Linear Time Recognition Algorithm for Interval DAGs," Information Processing Letters, vol. 12, pp. 2022, 1981.
[8] H.N. Gabow, "An Almost Linear Algorithm for Two Processor Scheduling," J. ACM, vol. 29, pp. 766780, 1982.
[9] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.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. 7293, 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. 287326, 1979.
[12] T.C. Hu, "Parallel Sequencing and Assembly Line Problems," Operations Research, vol. 9, pp. 841848, 1961.
[13] E.W. Mayr, "Well Structured Parallel Programs Are Not Easy to Schedule," Technical Report STANCS81880, Stanford Univ., Stanford, Calif., 1981.
[14] C.H. Papadimitriou and M. Yannakakis, "Scheduling Interval Order Tasks," SIAM J. Computing, vol. 10, pp. 405409, 1979.
[15] C.H. Papadimitriou and M. Yannakakis,"Towards an architectureindependent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322328, Apr. 1990.
[16] J.D. Ullman, "NPComplete Scheduling Problems," J. Computer and Systems Science, vol. 10, pp. 384393, 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. 222229,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.