Performance of Coffmann-Graham schedules in presence of unit communication delays - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 1998

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

Résumé

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)]$.

Dates et versions

hal-01195781 , version 1 (08-09-2015)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More