2013 IEEE 34th Real-Time Systems Symposium (1999)
Dec. 1, 1999 to Dec. 3, 1999
Srikanth Ramamurthy , Transarc Corporation
Mark Moir , University of Pittsburgh
This paper concerns the problem of scheduling sets of preemptable, periodic tasks on multiple resources. We consider a task model that allows arbitrary mixes of fixed and migratable tasks, and prove the existence of an optimal pfair scheduler in this model. Fixed tasks must always be scheduled on a given resource, while migratable tasks can be scheduled on different resources at different times. A pfair scheduler produces a periodic schedule in which the times each task is allocated a processor are approximately evenly spread throughout its period. This work extends work of Baruah et al, who proved a similar result for systems in which all tasks are migratable.
multiprocessor, scheduling, pfair, task migration
Srikanth Ramamurthy, Mark Moir, "Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources", 2013 IEEE 34th Real-Time Systems Symposium, vol. 00, no. , pp. 294, 1999, doi:10.1109/REAL.1999.818857