QoS guarantee using probabilistic deadlines
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10683070,p. 242-249
- https://doi.org/10.1109/emrts.1999.777471
Abstract
This paper presents a probabilistic approach to guarantee the performance of a real-time system. While traditional real-time system analysis tends to guarantee that each task instance will complete its execution before its absolute deadline (hard guarantee), our approach permits to estimate the probability that it will happen. Such a statistical guarantee is performed based on inter-arrival and execution times probability distributions, rather than their worst case values. The advantage of a probabilistic approach is a more efficient usage of system resources, allowing to give a certain level of deadline guarantee to task sets that the classical schedulability analysis would reject.Keywords
This publication has 18 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
- Real-time queueing theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Probabilistic performance guarantee for real-time tasks with varying computation timesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimizing aperiodic response times in a firm real-time environmentIEEE Transactions on Software Engineering, 1999
- Scheduling aperiodic tasks in dynamic priority systemsReal-Time Systems, 1996
- A dynamic priority assignment technique for streams with (m, k)-firm deadlinesIEEE Transactions on Computers, 1995
- Efficient aperiodic service under earliest deadline schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973