| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Pfair scheduling improvement to reduce interprocessor migrations
Abstract : Proportionate-fair (Pfair) scheduling is a particulary promising global scheduling technique for multiprocessor systems. Actually three Pfair scheduling algorithms have been proved optimal for scheduling periodic, sporadic and rate-based tasks on a real-time multiprocessor. However, task migration is unrestricted under Pfair scheduling. In the worst case, a task may be migrated each time it is scheduled. To correct this problem, we propose to complement initial Pfair scheduling algorithm by some heuristics that strive to minimize the total number of migrations. Experimental simulations are presented to evaluate and compare the proposed heuristics and we show that the number of migrations can be substantially reduced by adding these simple rules.
https://hal.inria.fr/inria-00336513
Contributor : Anne Jaigu <>
Submitted on : Tuesday, November 4, 2008 - 1:01:57 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:03 PM
Long-term archiving on: : Monday, June 7, 2010 - 10:44:17 PM
Contributor : Anne Jaigu <>
Submitted on : Tuesday, November 4, 2008 - 1:01:57 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:03 PM
Long-term archiving on: : Monday, June 7, 2010 - 10:44:17 PM
File
aoun.pdf
Files produced by the author(s)