A Multiprocessor Server-Based Scheduler for Soft Real-Time Tasks with Stochastic Execution Demand

We utilize a multiprocessor server-based approach to schedulea general class of soft real-time systems with stochastic execution demands, when bounded average-case tardiness is sufficient for schedulability. A key feature of the task model considered here is that the stochastic execution-time demands can have arbitrary amounts of dependence within pre-specified time intervals of bounded length. This is an important practical step forward from requiring complete independence of execution times between successive jobs of the same task. Our main result does not require the scheduler to know the execution time of each job in advance, and requires only average-case utilization to be bounded by the number of processors. This constraint is mild compared to constraints on worst-case utilization because in multiprocessor systems, worst-case execution times may be orders of magnitude higher than average-case execution times.

[1]  Giorgio C. Buttazzo,et al.  QoS guarantee using probabilistic deadlines , 1999, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99.

[2]  Sanjoy K. Baruah,et al.  Improved Tardiness Bounds for Global EDF , 2010, 2010 22nd Euromicro Conference on Real-Time Systems.

[3]  Giuseppe Lipari,et al.  Implementing constant-bandwidth servers upon multiprocessor platforms , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[4]  Hennadiy Leontyev,et al.  Generalized tardiness bounds for global multiprocessor scheduling , 2007, Real Time Syst..

[5]  James H. Anderson,et al.  Tardiness bounds under global EDF scheduling on a multiprocessor , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[6]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[7]  Scott A. Brandt,et al.  Dynamic integrated scheduling of hard real-time, soft real-time, and non-real-time processes , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[8]  Hennadiy Leontyev,et al.  A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees , 2008, 2008 Euromicro Conference on Real-Time Systems.

[9]  James H. Anderson,et al.  Soft Real-Time on Multiprocessors: Are Analysis-Based Schedulers Really Worth It? , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[10]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[11]  Marco Caccamo,et al.  M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms , 2008, Real-Time Systems.

[12]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[13]  James H. Anderson,et al.  Task Scheduling with Self-Suspensions in Soft Real-Time Multiprocessor Systems , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[14]  James H. Anderson,et al.  A Stochastic Framework for Multiprocessor Soft Real-Time Scheduling , 2010, 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium.

[15]  Aloysius K. Mok,et al.  A multiframe model for real-time tasks , 1996, 17th IEEE Real-Time Systems Symposium.