Skip to Main content Skip to Navigation
Conference papers

Laxity-Based Restricted-Migration Scheduling

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00620399
Contributor : Serge Midonnet <>
Submitted on : Tuesday, March 19, 2013 - 1:16:34 PM
Last modification on : Wednesday, February 26, 2020 - 7:06:05 PM
Long-term archiving on: : Thursday, March 30, 2017 - 2:33:37 PM

File

etfa2011.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

563

Files downloads

694