Propagation mechanism for a non-preemptive strictly periodic scheduling problem - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2013

Propagation mechanism for a non-preemptive strictly periodic scheduling problem

Résumé

We study a non-preemptive strictly periodic scheduling prob- lem. This problem, introduced in [6, 4], arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, etc.) has to be scheduled on P processors distributed on the plane. In the related fi eld of cyclic scheduling, some notable success has been recently achieved through the use of speci c constraint propagation. In this article, we consider a heuristic, first proposed by Al Sheikh et al. 2012, which is based on the notion of equilibrium. Following a game theory analogy, each task tries successively to optimize its own schedule and therefore to produce the best response, given the other schedules. We present a propagation mechanism for non-overlapping constraints which signi cantly improves this heuristic.
Fichier principal
Vignette du fichier
rapportLAAS-13007.pdf (479.33 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00784363 , version 1 (04-02-2013)

Identifiants

  • HAL Id : hal-00784363 , version 1

Citer

Clément Pira, Christian Artigues. Propagation mechanism for a non-preemptive strictly periodic scheduling problem. 2013. ⟨hal-00784363⟩
152 Consultations
56 Téléchargements

Partager

Gmail Facebook X LinkedIn More