An approximation algorithm for scheduling dependent tasks on m processors with small communication delays

Discrete Applied Mathematics

Volumn 108, Issue 3, 2001, Pages 239-257

  Hanen, C ^a   Munier, A ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

68M20; Communication delays; Makespan; Scheduling

Indexed keywords

EID: 0345817191     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00179-7     Document Type: Article

References (16)

1. Chrétienne P., Picouleau C. Scheduling with communication delays: a survey. Chretienne P., Coffman E.G., Lenstra J.K., Liu Z. Scheduling Theory and its Applications. 1995;65-89 Wiley, New York.
2. Coffman E.G., Graham R.L. Optimal scheduling for two processor systems. Acta Inform. 1:1972;200-213.
3. Graham R.L. Bounds on the performance of scheduling algorithms. Coffman E.G. Computer and Job-Shop Scheduling Theory. 1976;Wiley, New York.
4. F. Guinand, R. Rapine, D. Trystram, Worst case analysis of Lawler's algorithm for scheduling trees with communication delays, Technical Report IMAG, 1995.
5. Hanen C., Munier A. Performance of Coffman-Graham schedules in presence of unit communication delay. Discrete Appl. Math. 81:1998;93-108.
6. C. Hanen, A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, in: IEEE Symposium on Emerging Technologies and Factory Automation, Paris, France, September 1995, pp. 167-190.
7. Hoogeven J.A., Lenstra J.K., Veltman B. 3, 4, 5, 6, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16:1994.
8. Hwang J., Chow Y., Anger F., Lee C. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J. Comput. 18:1989;244-257.
9. Lawler E.L. Scheduling trees on multiprocessors with unit communication delays, in: Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni. 1993;Lake Como, Italy.
10. R.H. Mohring, M.W. Schaffter, Approximation algorithms for scheduling series-parallel orders subject to unit time communication delays, Technical Report 483, Technische universitat Berlin, 1995.
11. R.H. Mohring, M.W. Schaffter, A simple approximation algorithm for scheduling forest with unit processing times and zero-one communication delays Technical Report 506, Technische universitat Berlin, 1996.
12. Munier A., Konig J.-C. A heuristic for a scheduling problem with communications delays. Oper. Res. 45(1):1997;145-148.
13. Picouleau C. Two new NP-complete scheduling problems with communication delays and unlimited number of processors. Discrete Appl. Math. 60:1995;331-342.
14. Rayward-Smith V.J. UET scheduling with unit interprocessor communication delays. Discrete Appl. Math. 18:1987;55-71.
15. M.W. Schaffter, Approximation Algorithm for scheduling with communication delays, Ph.D. Thesis, Technische universitat Berlin, 1996.
16. Veltman B., Lageweg B.J., Lenstra J.K. Multiprocessor scheduling with communication delays. Parallel Comput. 16:1990;173-182.