On a resource-constrained scheduling problem with application to distributed systems reconfiguration - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2007

On a resource-constrained scheduling problem with application to distributed systems reconfiguration

Résumé

This paper is devoted to the study of a resource-constrained scheduling problem, the Process Move Programming problem, which arises in relation to the operability of certain high availability real-time distributed systems. Informally, this problem consists, starting from an arbitrary initial distribution of processes on the processors of a distributed system, in finding the least disruptive sequence of operations (non-impacting process migrations or temporary process interruptions) at the end of which the system ends up in another predefined arbitrary state. The main constraint is that the capacity of the processors must not be exceeded during the reconfiguration. After a brief survey of the literature, we prove the NP-hardness of the problem and exhibit a few polynomial special cases. We then present a branch-and-bound algorithm for the general case along with computational results demonstrating its practical relevance.
Fichier principal
Vignette du fichier
EJOR.pdf (238.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00311377 , version 1 (14-08-2008)

Identifiants

Citer

Renaud Sirdey, Jacques Carlier, Hervé Kerivin, Dritan Nace. On a resource-constrained scheduling problem with application to distributed systems reconfiguration. European Journal of Operational Research, 2007, 183, pp.546-563. ⟨10.1016/j.ejor.2006.10.011⟩. ⟨inria-00311377⟩
147 Consultations
321 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More