Automated analysis of real-time scheduling using graph games

In this paper, we introduce the powerful framework of graph games for the analysis of real-time scheduling with firm deadlines. We introduce a novel instance of a partial-observation game that is suitable for this purpose, and prove decidability of all the involved decision problems. We derive a graph game that allows the automated computation of the competitive ratio (along with an optimal witness algorithm for the competitive ratio) and establish an NP-completeness proof for the graph game problem. For a given on-line algorithm, we present polynomial time solution for computing (i) the worst-case utility; (ii) the worst-case utility ratio w.r.t. a clairvoyant off-line algorithm; and (iii) the competitive ratio. A major strength of the proposed approach lies in its flexibility w.r.t. incorporating additional constraints on the adversary and/or the algorithm, including limited maximum or average load, finiteness of periods of overload, etc., which are easily added by means of additional instances of standard objective functions for graph games.

[1]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[2]  Fei Li,et al.  Competitive analysis of online real-time scheduling algorithms under hard energy constraint , 2010, Real-Time Systems.

[3]  Michael A. Palis,et al.  Competitive algorithms for fine-grain real-time scheduling , 2004, 25th IEEE International Real-Time Systems Symposium.

[4]  Krishnendu Chatterjee,et al.  Generalized Mean-payoff and Energy Games , 2010, FSTTCS.

[5]  Sanjoy K. Baruah,et al.  Competitive On-Line Scheduling of Imprecise Computations , 1998, IEEE Trans. Computers.

[6]  Joseph Sifakis.  Scheduler Modeling Based on the Controller Synthesis Paradigm , 2002, FTRTFT.

[7]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[8]  Elias Koutsoupias,et al.  Scheduling Without Payments , 2011, Theory of Computing Systems.

[9]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[10]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[11]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[12]  Yaron Velner.  The Complexity of Mean-Payoff Automaton Expression , 2012, ICALP.

[13]  Rami G. Melhem,et al.  Power-aware scheduling for periodic real-time tasks , 2004, IEEE Transactions on Computers.

[14]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[15]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[16]  Daniel P. Siewiorek,et al.  A resource allocation model for QoS management , 1997, Proceedings Real-Time Systems Symposium.

[17]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[18]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[19]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[20]  Sanjoy K. Baruah,et al.  Scheduling for Overload in Real-Time Systems , 1997, IEEE Trans. Computers.

[21]  Eryk Kopczynski,et al.  Half-Positional Determinacy of Infinite Games , 2006, ICALP.