Robust aperiodic scheduling under dynamic priority systems
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10528725,p. 210-219
- https://doi.org/10.1109/real.1995.495211
Abstract
When hard periodic and firm aperiodic tasks are jointly scheduled in the same system, the processor workload can vary according to the arrival times of aperiodic requests. In order to guarantee the schedulability of the periodic task set, in overload conditions some aperiodic tasks must be rejected. In this paper we propose a technique that, in overload conditions, adds robustness to the joint scheduling of periodic and aperiodic tasks in systems with dynamic priorities. Our technique is based on an aperiodic server, called total bandwidth server, already proven effective in a previous work. Here the algorithm is first extended to efficiently handle firm aperiodic tasks and then integrated with a robust guarantee mechanism that allows to achieve graceful degradation in case of transient overloads. Extensive simulations show that the proposed new algorithm is effective in all workload conditions.Keywords
This publication has 9 references indexed in Scilit:
- An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- HARTIK: A real-time kernel for robotics applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling slack time in fixed priority pre-emptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- Efficient aperiodic service under earliest deadline schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- The Spring kernel: a new paradigm for real-time systemsIEEE Software, 1991
- Dynamic scheduling of real-time tasks under precedence constraintsReal-Time Systems, 1990
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973