Optimal scheduling for constant-rate multi-mode systems

Constant-rate multi-mode systems are hybrid systems that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. The schedulability problem for such systems is to design a mode-switching policy that maintains the state within a specified safety set. The main result of the paper is that schedulability can be decided in polynomial time. We also generalize our result to optimal schedulability problems with average cost and reachability cost objectives. Polynomial-time scheduling algorithms make this class an appealing formal model for design of energy-optimal policies. The key to tractability is that the only constraints on when a scheduler can switch the mode are specified by global objectives. Adding local constraints by associating either invariants with modes, or guards with mode switches, lead to undecidability, and requiring the scheduler to make decisions only at multiples of a given sampling rate, leads to a PSPACE-complete schedulability problem.

[1]  Thomas A. Henzinger,et al.  Discrete-Time Control for Rectangular Hybrid Automata , 1997, Theor. Comput. Sci..

[2]  Eugene Asarin,et al.  Scheduling with timed automata , 2006, Theor. Comput. Sci..

[3]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[4]  Giorgio C. Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications (Real-Time Systems Series) , 2010 .

[5]  Kim G. Larsen,et al.  Staying Alive as Cheaply as Possible , 2004, HSCC.

[6]  George J. Pappas,et al.  Green scheduling of control systems for peak demand reduction , 2011, IEEE Conference on Decision and Control and European Control Conference.

[7]  John Lygeros,et al.  Lecture Notes on Hybrid Systems , 2004 .

[8]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[9]  George J. Pappas,et al.  Green scheduling: Scheduling of control systems for peak power reduction , 2011, 2011 International Green Computing Conference and Workshops.

[10]  Ashish Tiwari,et al.  Synthesizing Switching Logic to Minimize Long-Run Cost , 2011, ArXiv.

[11]  Enric Valor,et al.  Daily Air Temperature and Electricity Load in Spain , 2001 .

[12]  Feng Lin,et al.  Analysis of Zeno behaviors in a class of hybrid systems , 2005, IEEE Transactions on Automatic Control.

[13]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[14]  R. Sands,et al.  Climate Change Impacts on U.S. Commercial Building Energy Consumption: An Analysis Using Sample Survey Data , 1996 .

[15]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[16]  Panos J. Antsaklis,et al.  Practical Stabilization of Integrator Switched Systems 1 , 2003 .

[17]  Osvaldo E. Sala,et al.  Climate Change Impacts on , 2008 .

[18]  Oded Maler,et al.  Preemptive Job-Shop Scheduling Using Stopwatch Automata , 2002, TACAS.

[19]  Giorgio C. Buttazzo,et al.  HARD REAL-TIME COMPUTING SYSTEMS Predictable Scheduling Algorithms and Applications , 2007 .

[20]  Sumit Gulwani,et al.  Synthesizing switching logic for safety and dwell-time requirements , 2010, ICCPS '10.