ABSTRACT
<p><b>Abstract</b>—This paper establishes the exact upper bound for Lawler's heuristic proving that its schedule of a UECT tree on <it>m</it> identical processors does not exceed an optimal solution by more than <tmath>${m \mathord{\left/ {\vphantom {m 2}} \right. \kern-\nulldelimiterspace} 2}$</tmath> time units.</p>
INDEX TERMS
Worst case analysis, trees precedence graph, m-machine problem.
CITATION
C. Rapine, F. Guinand, D. Trystram, "Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays", IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 1085-1086, October 1997, doi:10.1109/71.629491
CITATIONS
SHARE
87 ms
(Ver 3.3 (11022016))