DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling |
| |
Authors: | Shelby Funk Greg Levin Caitlin Sadowski Ian Pye Scott Brandt |
| |
Affiliation: | 1. University of Georgia, Athens, GA, USA 2. University of California at Santa Cruz, Santa Cruz, CA, USA
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|