Abstract

The issue of temporal fairness in periodic real-time scheduling is considered. It is argued that such fairness is often a desirable characteristic in real-time schedules. A concrete criterion for temporal fairness -- pfairness -- is described. The weight-monotonic scheduling algorithm, a static priority scheduling algorithm for generating pfair schedules, is presented and proven correct. A feasibility test is presented which, if satisfied by a system of periodic tasks, ensures that the weight-monotonic scheduling algorithm will schedule the system in a pfair manner.

Citations

2571	Scheduling algorithms for multiprogramming in a hard-real-time environment - Liu, Layland - 1973
622	Flows in Networks - Ford, Fulkerson - 1962
210	Balanced allocations - Azar, Broder, et al. - 1994
200	Proportionate progress: a notion of fairness in resource allocation - Baruah, Cohen, et al. - 1996
171	Control robotics: the procedural control of physical processes - Dertouzos - 1974
93	Fast Scheduling of Periodic Tasks on Multiple Resources - Baruah, Gehrke, et al. - 1996
84	A data structure for manipulating priority queues - Vuillemin - 1978
37	Scheduling algorithms for multiprocessors in a hard real-time environment - Liu - 1969
20	Guaranteeing Fair Service to Persistent Dependent Tasks - Bar-Noy, Mayer, et al. - 1995
16	Task management techniques for enforcing ED scheduling on a periodic task set - Mok - 1988
8	Fairness in scheduling - Atjai, Aspnes, et al. - 1995
2	Distributed broadcast channel access - Mok, Ward - 1979