Stack-based scheduling for realtime processes
Real-Time Systems
Aperiodic servers in a deadline scheduling environment
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Robust aperiodic scheduling under dynamic priority systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A multiframe model for real-time tasks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
ICECCS '97 Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems
Multiple Servers and Capacity Sharing for Implementing Flexible Scheduling
Real-Time Systems - Flexible Scheduling on Real-Time Systems
Real-Time Operating Systems: Problems and Novel Solutions
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Journal of Systems and Software
Proceedings of the 2009 ACM symposium on Applied Computing
Improving responsiveness of soft aperiodic tasks using proportional slack time
Computers and Electrical Engineering
| Hi-index | 0.01 |
In certain real-time applications, ranging from multimedia to telecommunication systems, timing constraints can be more flexible than scheduling theory usually permits. In this paper, 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 achieve good responsiveness. We propose and analyze an algorithm, based on a variant of Earliest Deadline First scheduling, which exploits skips to minimize the response time of aperiodic requests. One of the most interesting features of our algorithm is that it can easily be tuned to balance performance vs. complexity, for adapting it to different application requirements. Extensive simulation experiments show the effectiveness of the proposed approach with respect to existing methods. Schedulability bounds are also derived to perform off-line analysis.