Laxity-Based Restricted-Migration Scheduling - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Laxity-Based Restricted-Migration Scheduling

Résumé

We focus on the real-time multiprocessor scheduling of periodic tasksets. We propose a new static priority scheduling algorithm based on the restricted-migration approach. Restricted-migration approach is a global scheduling approach for which the number of migrations is bounded just by one migration per job at most. Our algorithm uses the laxity of already admitted jobs to decide the admission of newly arrived jobs. We prove that this algorithm is predictable. We give a feasible interval and we propose a utilization bound for this algorithm. We also compare our algorithm to other global algorithms in terms of schedulability by simulations.
Fichier principal
Vignette du fichier
etfa2011.pdf (272.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00620399 , version 1 (19-03-2013)

Identifiants

Citer

Frédéric Fauberteau, Serge Midonnet, Laurent George. Laxity-Based Restricted-Migration Scheduling. 16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'11), 2011, United States. pp.1-8, ⟨10.1109/ETFA.2011.6059012⟩. ⟨hal-00620399⟩
275 Consultations
456 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More