Safe and Optimal Scheduling for Hard and Soft Tasks

We consider a stochastic scheduling problem with both hard and soft tasks on a single machine. Each task is described by a discrete probability distribution over possible execution times, and possible inter-arrival times of the job, and a fixed deadline. Soft tasks also carry a penalty cost to be paid when they miss a deadline. We ask to compute an online and non-clairvoyant scheduler (i.e. one that must take decisions without knowing the future evolution of the system) that is safe and efficient. Safety imposes that deadline of hard tasks are never violated while efficient means that we want to minimise the mean cost of missing deadlines by soft tasks. First, we show that the dynamics of such a system can be modelled as a finite Markov Decision Process (MDP). Second, we show that our scheduling problem is PP-hard and in EXPTime. Third, we report on a prototype tool that solves our scheduling problem by relying on the Storm tool to analyse the corresponding MDP. We show how antichain techniques can be used as a potential heuristic. 2012 ACM Subject Classification Theory of computation → Probabilistic computation, Computer systems organization→ Real-time system specification, Computer systems organization→ Embedded systems

[1]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

[2]  Sanjoy K. Baruah,et al.  Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[3]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[4]  Sebastian Junges,et al.  A Storm is Coming: A Modern Probabilistic Model Checker , 2017, CAV.

[5]  Ufuk Topcu,et al.  Probably Approximately Correct Learning in Stochastic Games with Temporal Logic Specifications , 2016, IJCAI.

[6]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[7]  Luca Abeni,et al.  Stochastic Analysis of a Reseveration Based System , 2001 .

[8]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[9]  Christoph Haase,et al.  The complexity of the Kth largest subset problem and related problems , 2015, Inf. Process. Lett..

[10]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[11]  Véronique Bruyère,et al.  Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games , 2013, STACS.

[12]  Orna Kupferman,et al.  Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis , 2016, CONCUR.

[13]  Azer Bestavros,et al.  Statistical rate monotonic scheduling , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[14]  Joël Goossens,et al.  Synthesising succinct strategies in safety games with an application to real-time scheduling , 2018, Theor. Comput. Sci..

[15]  Marco Spuri,et al.  Scheduling aperiodic tasks in dynamic priority systems , 1996, Real-Time Systems.

[16]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[17]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[18]  Jane W.-S. Liu,et al.  Analyzing Stochastic Fixed-Priority Real-Time Systems , 1999, TACAS.

[19]  Yue Lu,et al.  A Statistical Approach to Response-Time Analysis of Complex Embedded Real-Time Systems , 2010, 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications.

[20]  Joseph Y.-T. Leung,et al.  On-Line Scheduling of Real-Time Tasks , 1992, IEEE Trans. Computers.

[21]  Rami G. Melhem,et al.  Optimal reward-based scheduling of periodic real-time tasks , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[22]  Lorenzo Clemente,et al.  Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[23]  Jean-François Raskin,et al.  Antichains for the Automata-Based Approach to Model-Checking , 2009, Log. Methods Comput. Sci..

[24]  Wei-Kuan Shih,et al.  Algorithms for scheduling imprecise computations , 1991, Computer.

[25]  Mark K. Gardner,et al.  Probabilistic analysis and scheduling of critical soft real-time systems , 1999 .

[26]  Liliana Cucu-Grosjean,et al.  Probabilistic analysis for mixed criticality systems using fixed priority preemptive scheduling , 2017, RTNS.

[27]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.

[28]  Giorgio C. Buttazzo,et al.  Integrating multimedia applications in hard real-time systems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[29]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[30]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[31]  Jane W.-S. Liu,et al.  Imprecise Results: Utilizing Partial Comptuations in Real-Time Systems , 1987, RTSS.

[32]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

[33]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[34]  Liliana Cucu-Grosjean,et al.  A Statistical Response-Time Analysis of Real-Time Embedded Systems , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[35]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.