The Community for Technology Leaders
Issue No. 04 - April (2009 vol. 58)
ISSN: 0018-9340
pp: 480-495
Michael D. Lemmon , University of Notre Dame, Notre Dame
Thidapat (Tam) Chantem , University of Notre Dame, Notre Dame
Xiaobo Sharon Hu , University of Notre Dame, Notre Dame
ABSTRACT
The elastic task model is a powerful model for adapting periodic real-time systems in the presence of uncertainty. This work generalizes the existing elastic scheduling approach in several directions. First, it presents a general framework, which formulates a trade-off between task schedulability and a specific performance metric as an optimization problem. Such a framework allows real-time systems under overloads to graciously adapt by adjusting their performance level. Second, it is shown in this work that the well-known task compression algorithm in fact solves a quadratic programming problem that seeks to minimize the sum of the squared deviation of a task's utilization from initial desired utilization. This finding indicates that the task compression algorithm may be applied to efficiently solve other similar types of problems that often arise in real-time applications. In particular, an iterative approach is proposed to solve the period selection problem for real-time tasks with deadlines less than respective periods. Further, the framework is adapted to solve the deadline selection problem, which is useful in some control systems with fixed periods.
INDEX TERMS
Real-time and embedded systems, sequencing and scheduling, performance of systems.
CITATION
Michael D. Lemmon, Thidapat (Tam) Chantem, Xiaobo Sharon Hu, "Generalized Elastic Scheduling for Real-Time Tasks", IEEE Transactions on Computers, vol. 58, no. , pp. 480-495, April 2009, doi:10.1109/TC.2008.175
FULL ARTICLE
CITATIONS
SHARE
90 ms
(Ver 3.3 (11022016))