 |
HAL UPEC - UPEM Portal |  |
 |
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.
Cited literature [19 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00620399
Contributor : Serge Midonnet Connect in order to contact the contributor
Submitted on : Tuesday, March 19, 2013 - 1:16:34 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:25 AM
Long-term archiving on: : Thursday, March 30, 2017 - 2:33:37 PM
Contributor : Serge Midonnet Connect in order to contact the contributor
Submitted on : Tuesday, March 19, 2013 - 1:16:34 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:25 AM
Long-term archiving on: : Thursday, March 30, 2017 - 2:33:37 PM
File
etfa2011.pdf
Files produced by the author(s)