Fairness in periodic real-time scheduling

Authors:
S. K. Baruah
Affiliations:
-
Venue:
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Year:
1995

Citing 0
Cited 7

Optimal Reward-Based Scheduling for Periodic Real-Time Tasks

IEEE Transactions on Computers
Pfair Scheduling of Generalized Pinwheel Task Systems

IEEE Transactions on Computers
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Journal of Computer and System Sciences
Adaptive dissemination of data in time-critical asymmetric communication environments

Mobile Networks and Applications
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems
Static-priority periodic scheduling on muitiprocessors

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Multiprocessor schedulability analyser

Proceedings of the 2011 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.01

Visualization

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.