Performance of Coffmann-Graham schedules in presence of unit communication delays

Abstract : This paper studies the relative performance of the Coffman-Graham algorithm for scheduling unitary tasks onm processors with unitary communication delays.Using a particular decomposition of CG-schedules, we prove that its worst case relative performance is bounded by $4/3$ for $m = 2$ and that this bound is tight. For $m \geq 3$, we provide an instance of the problem for which the performance ratio is $3 - [6/(m + 1)]$.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01195781
Contributor : Lip6 Publications <>
Submitted on : Tuesday, September 8, 2015 - 2:17:24 PM
Last modification on : Friday, May 24, 2019 - 5:26:00 PM

Links full text

Identifiers

Citation

Claire Hanen, Alix Munier. Performance of Coffmann-Graham schedules in presence of unit communication delays. Discrete Applied Mathematics, Elsevier, 1998, 81 (1-3), pp.93-108. ⟨10.1016/S0166-218X(97)00077-2⟩. ⟨hal-01195781⟩

Share

Metrics

Record views

77