Analyzing Stochastic Fixed-Priority Real-Time Systems
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Probabilistic performance guarantee for real-time tasks with varying computation times
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Performance-Based Design Of Distributed Real-Time Systems
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Stochastic Analysis of Periodic Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Quality-Assuring Scheduling-Using Stochastic Behavior to Improve Resource Utilization
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Pessimism in the Stochastic Analysis of Real-Time Systems: Concept and Applications
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
An Exact Stochastic Analysis of Priority-Driven Periodic Real-Time Systems and Its Approximations
IEEE Transactions on Computers
ACM SIGBED Review - Special issue: The work-in-progress (WIP) session of the RTSS 2005
A Stochastic Framework for Multiprocessor Soft Real-Time Scheduling
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Efficient Stochastic Analysis of Real-Time Systems via Random Sampling
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Real-time control system analysis: an integrated approach
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
| Hi-index | 0.00 |
This paper presents a new method for providing probabilistic real-time guarantees to tasks scheduled through resource reservations. Previous work on probabilistic analysis of reservation-based schedulers is extended by improving the efficiency and robustness of the probability computation. Robustness is improved by accounting for a possibly incomplete knowledge of the distribution of the computation times (which is typical in realistic applications). The proposed approach computes a conservative bound for the probability of missing deadlines, based on the knowledge of the probability distributions of the execution times and of the inter-arrival times of the tasks. In this paper, such a bound is computed in realistic situations, comparing it with simulative results and with the exact computation of deadline miss probabilities (without pessimistic bounds). Finally, the impact of the incomplete knowledge of the execution times distribution is evaluated.