Fairness in periodic real-time scheduling
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. ii (10528725) , 200-209
- https://doi.org/10.1109/real.1995.495210
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.Keywords
This publication has 8 references indexed in Scilit:
- Fast scheduling of periodic tasks on multiple resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fairness in SchedulingJournal of Algorithms, 1998
- Guaranteeing Fair Service to Persistent Dependent TasksSIAM Journal on Computing, 1998
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996
- Balanced allocations (extended abstract)Published by Association for Computing Machinery (ACM) ,1994
- Distributed broadcast channel accessComputer Networks (1976), 1979
- A data structure for manipulating priority queuesCommunications of the ACM, 1978
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973