Title :
Worst case analysis of Lawler´s algorithm for scheduling trees with communication delays
Author :
Guinand, F. ; Rapine, C. ; Trystram, D.
Author_Institution :
IMAG, Grenoble, France
fDate :
10/1/1997 12:00:00 AM
Abstract :
This paper establishes the exact upper bound for Lawler´s heuristic proving that its schedule of a UECT tree on m identical processors does not exceed an optimal solution by more than m/2 time units
Keywords :
communication complexity; delays; processor scheduling; trees (mathematics); Lawler´s algorithm; UECT tree; communication delays; exact upper bound; heuristic proving; scheduling trees; worst case analysis; Algorithm design and analysis; Computer aided software engineering; Costs; Delay effects; Optimal scheduling; Parallel machines; Processor scheduling; Scheduling algorithm; Tree graphs; Upper bound;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
