Worst case analysis of Lawler's algorithm for scheduling trees with communication delays

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 10, 1997, Pages 1085-1086

  Guinand, F ^b   Rapine, C ^b   Trystram, D ^a,b  

^a IEEE   (France)

^b LMC   (France)

Author keywords

m machine problem; Trees precedence graph; Worst case analysis

Indexed keywords

ALGORITHMS; COMMUNICATION; GRAPH THEORY; HEURISTIC METHODS; MULTIPROCESSING SYSTEMS; OPTIMIZATION; TREES (MATHEMATICS);

COMMUNICATION DELAY;

SCHEDULING;

EID: 0031249870     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.629491     Document Type: Article

References (3)

1. V.J. Rayward-Smith, "UET Scheduling with Unit Interprocessor Communication Delays," Discrete Applied Mathematics, vol. 18, pp. 55-71, 1987.
2. B. Veltman, "Multiprocessor Scheduling with Communication Delays," PhD thesis, Univ. of Technology of Eindhoven, Dept. of Operations Research, Amsterdam, May 1993.
3. T.A. Varvarigou, V.P. Roychowdhury, T. Kailath, and E. Lawler, "Scheduling In and Out Forests in the Presence of Communication Delays," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 10, pp. 1,065-1,074, 1996.