Journal
REAL-TIME SYSTEMS
Volume 47, Issue 5, Pages 389-429Publisher
SPRINGER
DOI: 10.1007/s11241-011-9130-0
Keywords
Real-time scheduling; Multiprocessor scheduling; Sporadic tasks; Constrained deadlines; Fair scheduling
Categories
Ask authors/readers for more resources
We consider the problem of optimal real-time scheduling of periodic and sporadic tasks on identical multiprocessors. A number of recent papers have used the notions of fluid scheduling and deadline partitioning to guarantee optimality and improve performance. This article develops a unifying theory with the DP-Fair scheduling policy and examines how it overcomes problems faced by greedy scheduling algorithms. In addition, we present DP-Wrap, a simple DP-Fair scheduling algorithm which serves as a least common ancestor to other recent algorithms. The DP-Fair scheduling policy is extended to address the problem of scheduling sporadic task sets with arbitrary deadlines.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available