Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
In this paper we present a new scheduling approach for servicing soft aperiodic requests in a hard real-time environment, where a set of hard periodic tasks is scheduled using the Earliest Deadline First algorithm. The main characteristic of the proposed algorithm is that it achieves full processor utilization and optimal aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Another interesting feature of the algorithm is that it can easily be tuned to change its performance and complexity according to the application requirements. Schedulability issues, performance results, and implementation complexity of the algorithm are discussed and compared with other classical methods, such as Background, the Total Bandwidth Sewer (TBS), and the optimal EDL server. Extensive simulations show that a substantial improvement can be achieved with a little increase of complexity, ranging from the TBS performance up to the optimal behavior.Keywords
This publication has 14 references indexed in Scilit:
- On-line scheduling of hard deadline aperiodic tasks in fixed-priority systemsPublished 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
- Robust aperiodic scheduling under dynamic priority systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling aperiodic tasks in dynamic priority systemsReal-Time Systems, 1996
- Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systemsReal-Time Systems, 1996
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- The deferrable server algorithm for enhanced aperiodic responsiveness in hard real-time environmentsIEEE Transactions on Computers, 1995
- Efficient aperiodic service under earliest deadline schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Dynamic scheduling of real-time tasks under precedence constraintsReal-Time Systems, 1990
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989