Liliana Cucu
Abstract
Real-time scheduling usually considers worst-case values for the parameters of task (or message stream) sets, in order to provide safe schedulability tests for hard real-time systems. However, worst-case conditions introduce a level of pessimism that is often inadequate for a certain class of (soft) real-time systems. In this paper we provide an approach for computing the stochastic response time of tasks where tasks have inter-arrival times described by discrete probabilistic distribution functions, instead of minimum inter-arrival (MIT) values.
- {1} L. Abeni and G. Buttazzo. QoS Guarantee Using Probabilistic Deadlines. In Proceedings of the 11th Euromicro Conference on Real-Time Systems (ECRTS99), pp. 242-249, June 1999.Google Scholar
Cross Ref
- {2} A. Burns, G. Bernat and I. Broster. A Probabilistic Framework for Schedulability Analysis. In the Proceedings of the 3rd International Embedded Software Conference (EMSOFT03), pp. 1-15, 2003.Google ScholarCross Ref
- {3} I. Broster and A. Burns. Applying Random Arrival Models to Fixed Priority Analysis. In the Proceedings of the Work-In-Progress of the 25th IEEE Real-Time Systems Symposium (RTSS04), 2004.Google Scholar
- {4} J.P. Lehoczky. Real-Time Queueing Theory. In the Proceedings of the 10th IEEE Real-Time Systems Symposium (RTSS96), pp. 186-195, 1996. Google ScholarDigital Library
- {5} H. Zhu, J.P. Hansen, J.P. Lehoczky and R. Rajkumar. Optimal partitioning for Quantized EDF Scheduling. In the Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS02), pp. 202-213, 2002. Google ScholarDigital Library
- {6} J.L. Díaz, D.F. García, K. Kim, C.G. Lee, L.L. Bello, J.M. López and O. Mirabella. Stochastic Analysis of Periodic Real-Time Systems. In the Proceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS02), pp. 289-300, 2002. Google ScholarDigital Library
- {7} M. Joseph and P. Pandya. Finding Response Times in a Real-Time System. In The Computer Journal, Vol. 29, No. 5, pp. 390-395, 1986.Google Scholar
- {8} M. Werman. Fast Convolution. In the Proceedings of the 11th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG03), 2003.Google Scholar
Index Terms
- A framework for the response time analysis of fixed-priority tasks with stochastic inter-arrival times
Recommendations
Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
The design of mixed-criticality systems is often subject to mandatory certification and has been drawing considerable attention over the past few years. This letter studies fixed-priority scheduling of mixed-criticality systems on a uniprocessor ...
A review of priority assignment in real-time systems
It is over 40 years since the first seminal work on priority assignment for real-time systems using fixed priority scheduling. Since then, huge progress has been made in the field of real-time scheduling with more complex models and schedulability ...
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
Fixed-priority scheduling with deferred preemption (FPDS) has been proposed in the literature as a viable alternative to fixed-priority pre-emptive scheduling (FPPS), that obviates the need for non-trivial resource access protocols and reduces the cost ...
Comments