On the Feasibility of Linear Discrete-Time Systems of the Green Scheduling ProblemReal-Time and Embedded Systems Lab (mLAB)
Document TypeConference Paper
Date of this Version11-1-2011
AbstractPeak power consumption of buildings in large facilities like hospitals and universities becomes a big issue because peak prices are much higher than normal rates. During a power demand surge an automated power controller of a building may need to schedule ON and OFF different environment actuators such as heaters and air quality control while maintaining the state variables such as temperature or air quality of any room within comfortable ranges. The green scheduling problem asks whether a scheduling policy is possible for a system and what is the necessary and sufficient condition for systems to be feasible. In this paper we study the feasibility of the green scheduling problem for HVAC(Heating, Ventilating, and Air Conditioning) systems which are approximated by a discrete-time model with constant increasing and decreasing rates of the state variables. We first investigate the systems consisting of two tasks and find the analytical form of the necessary and sufficient conditions for such systems to be feasible under certain assumptions. Then we present our algorithmic solution for general systems of more than 2 tasks. Given the increasing and decreasing rates of the tasks, our algorithm returns a subset of the state space such that the system is feasible if and only if the initial state is in this subset. With the knowledge of that subset, a scheduling policy can be computed on the fly as the system runs, with the flexibility to add power-saving, priority-based or fair sub-policies.
- green scheduling; feasibility;
Citation InformationZheng Li, Pei-Chi Huang, Aloysius K. Mok, Truong Nghiem, et al.. "On the Feasibility of Linear Discrete-Time Systems of the Green Scheduling Problem" (2011)
Available at: http://works.bepress.com/george_pappas/187/