Minimizing Aperiodic Response Times in a Firm Real-Time Environment
IEEE Transactions on Software Engineering
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Performance Evaluation of Dependable Real-Time Communication with Elastic QoS
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
A Technique for Adaptive Scheduling of Soft Real-Time Tasks
Real-Time Systems
Enhanced fixed-priority scheduling with (m,k)-firm guarantee
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
| Hi-index | 0.00 |
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. For example, in video reception, missing a deadline is acceptable, provided that most deadlines are met. We deal with the problem of scheduling hybrid sets of tasks, consisting of firm periodic tasks (i.e., tasks with deadlines which can occasionally skip one instance) and soft aperiodic requests, which have to be served as soon as possible to minimize their average response time. We propose and analyze an algorithm, based on a variant of earliest deadline first scheduling, which exploits skips to enhance the response time of aperiodic requests. Schedulability bounds are also derived to perform off-line analysis.