The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an attractive choice for scheduling soft-real-time systems on multiprocessors. Previous work has demonstrated that the maximum tardiness is bounded, and has derived formulas for computing tardiness bounds, in EDF-scheduled real-time systems that can be modeled as collections of recurrent tasks modeled using the well-known implicit-deadline (Liu and Layland) task model. This research extends the applicability of previous techniques to systems that are modeled using the more general arbitrary sporadic task model. It also improves on prior work even for implicit-deadline systems. An algorithm is derived here that computes tardiness bounds in polynomial time. Previously, these bounds could only have been approximated in sub-exponential time.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||14th International Conference on Principles of Distributed Systems, OPODIS 2010|
|Period||14/12/10 → 17/12/10|
- Computer Science(all)
- Theoretical Computer Science