Scheduling an interval ordered precedence graph with communication delays and a limited number of processors - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2013

Scheduling an interval ordered precedence graph with communication delays and a limited number of processors

Fadi Kacem
  • Fonction : Auteur
Benoit Dupont de Dinechin
  • Fonction : Auteur
Lucian Finta
  • Fonction : Auteur

Résumé

We consider the scheduling of an interval order precedence graph of unit execution time tasks with communication delays, release dates and deadlines. Tasks must be executed by a set of processors partitioned into K classes; each task requires one processor from a fixed class. The aim of this paper is to study the extension of the Leung–Palem–Pnueli (in short LPP) algorithm to this problem. The main result is to prove that the LPP algorithm can be extended to dedicated processors and monotone communication delays. It is also proved that the problem is NP–complete for two dedicated processors if communication delays are non monotone. Lastly, we show that list scheduling algorithm cannot provide a solution for identical processors.

Dates et versions

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

Identifiants

Citer

Alix Munier-Kordon, Fadi Kacem, Benoit Dupont de Dinechin, Lucian Finta. Scheduling an interval ordered precedence graph with communication delays and a limited number of processors. RAIRO - Operations Research, 2013, 47 (1), pp.73-87. ⟨10.1051/ro/2013028⟩. ⟨hal-01195937⟩
276 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More