Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors

Discrete Optimization

Volumn 6, Issue 1, 2009, Pages 79-91

  Kubiak, Wieslaw ^a   Rebaine, Djamal ^b   Potts, Chris ^c  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

^c UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Complexity; Divide and conquer graph; HLF; Identical parallel processors; Makespan

Indexed keywords

CONTROL SYSTEM ANALYSIS; CONTROL THEORY; LEARNING SYSTEMS; POLYNOMIAL APPROXIMATION; SCHEDULING;

COMPLEXITY; DIVIDE-AND-CONQUER GRAPH; HLF; IDENTICAL PARALLEL PROCESSORS; MAKESPAN;

GRAPH THEORY;

EID: 56249084517     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2008.09.001     Document Type: Article

References (13)

1. J. Bruno, Deterministic and stochastic scheduling problems with treelike precedence constraints, in: NATO conference, Durham, England, 1981
2. Chardon M., and Moukrim A. The Coffman-Graham algorithm optimally solves UET task systems with over-interval orders. SIAM J. Discrete Math. 19 1 (2005) 109-121
3. Coffman E.G., and Graham R.L. Optimal scheduling for two-processor systems. Acta Inform. 1 (1972) 200-213
4. Dasgupta S., Papadimitriou C.H., and Vazirani U.V. Algorithms (2006), McGraw Hill
5. Dolev D., and Warmuth M.K. Profile scheduling of opposing forest and level orders. SIAM J. Algebr. Discrete Methods 6 (1985) 665-687
6. Dolev D., and Warmuth M.K. Scheduling flat graphs. SIAM J. Comput. 14 3 (1985) 638-657
7. Dolev D., and Warmuth M.K. Scheduling precedence graphs with bounded height. J. Algorithms 5 (1982) 48-59
8. Garey M.R., Johnson D.S., Tarjan R.E., and Yannakakis M. Scheduling opposing forests. SIAM J. Algebr. Discrete Methods 4 (1983) 72-93
9. Horowitz E., and Sahni S. Fundamentals of Computer Algorithms (1978), Computer Science Press
10. Hu T.C. Parallel sequencing and assembly line problems. Oper. Res. 9 (1961) 841-848
11. Moukrim A. Optimal scheduling on parallel machines for a new order class. Oper. Res. Lett. 24 (1999) 91-95
12. V.J. Rayward-Smith, A.J. Clark, Scheduling Theory Applied to Divide-and-Conquer Task Systems on Identical Parallel Machines, in: C.R. Jessehope, K.D. Reinartz (Eds.), in: Conpar'88, BCS Workshop Series, Cambridge University Press, Cambridge, 1989
13. Valdes J., Tarjan R.E., and Lawler E.L. The recognition of series parallel digraphs. SIAM J. Comput. 11 (1982) 298-317