Skip to Main content Skip to Navigation
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.
Document type :
Conference papers
Complete list of metadata

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

File

aoun.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00336513, version 1

Collections

Citation

Dalia Aoun, Anne-Marie Déplanche, Yvon Trinquet. Pfair scheduling improvement to reduce interprocessor migrations. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Isabelle Puaut, Oct 2008, Rennes, France. ⟨inria-00336513⟩

Share

Metrics

Record views

265

Files downloads

485