Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays

Authors:
F. Guinand;C. Rapine;D. Trystram
Affiliations:
LMC-IMAG, Grenoble, France;LMC-IMAG, Grenoble, France;LMC-IMAG, Grenoble, France
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1997

Citing 2
Cited 0

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Scheduling In and Out Forests in the Presence of Communication Delays

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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 \mathord{\left/ {\vphantom {m 2}} \right. \kern-\nulldelimiterspace} 2}$ time units.