%0 Journal Article %1 euiyoung02dynamic %A Chung, Eui-Young %A Benini, L. %A Bogliolo, A. %A Lu, Yung-Hsiang %A Micheli, G. De %D 2002 %J Computers, IEEE Transactions on %K phd_uncassified2 %N 11 %P 1345-1361 %R 10.1109/TC.2002.1047758 %T Dynamic power management for nonstationary service requests %V 51 %X Dynamic power management (DPM) is a design methodology aimed at reducing power consumption of electronic systems by performing selective shutdown of idle system resources. The effectiveness of a power management scheme depends critically on accurate modeling of service requests and on computation of the control policy. In this work, we present an online adaptive DPM scheme for systems that can be modeled as finite-state Markov chains. Online adaptation is required to deal with initially unknown or nonstationary workloads, which are very common in real-life systems. Our approach moves from exact policy optimization techniques in a known and stationary stochastic environment and extends optimum stationary control policies to handle the unknown and nonstationary stochastic environment for practical applications. We introduce two workload learning techniques based on sliding windows and study their properties. Furthermore, a two-dimensional interpolation technique is introduced to obtain adaptive policies from a precomputed look-up table of optimum stationary policies. The effectiveness of our approach is demonstrated by a complete DPM implementation on a laptop computer with a power-manageable hard disk that compares very favorably with existing DPM schemes.

@article{euiyoung02dynamic, abstract = { Dynamic power management (DPM) is a design methodology aimed at reducing power consumption of electronic systems by performing selective shutdown of idle system resources. The effectiveness of a power management scheme depends critically on accurate modeling of service requests and on computation of the control policy. In this work, we present an online adaptive DPM scheme for systems that can be modeled as finite-state Markov chains. Online adaptation is required to deal with initially unknown or nonstationary workloads, which are very common in real-life systems. Our approach moves from exact policy optimization techniques in a known and stationary stochastic environment and extends optimum stationary control policies to handle the unknown and nonstationary stochastic environment for practical applications. We introduce two workload learning techniques based on sliding windows and study their properties. Furthermore, a two-dimensional interpolation technique is introduced to obtain adaptive policies from a precomputed look-up table of optimum stationary policies. The effectiveness of our approach is demonstrated by a complete DPM implementation on a laptop computer with a power-manageable hard disk that compares very favorably with existing DPM schemes.}, added-at = {2009-08-21T20:26:36.000+0200}, author = {Chung, Eui-Young and Benini, L. and Bogliolo, A. and Lu, Yung-Hsiang and Micheli, G. De}, biburl = {https://www.bibsonomy.org/bibtex/289c941050547d9fdb166ac1b04b0eba9/derkling}, doi = {10.1109/TC.2002.1047758}, interhash = {c103ce88f3834a754e4b6f27c88219d7}, intrahash = {89c941050547d9fdb166ac1b04b0eba9}, issn = {0018-9340}, journal = {Computers, IEEE Transactions on}, keywords = {phd_uncassified2}, month = Nov, number = 11, pages = { 1345-1361}, timestamp = {2009-08-21T20:28:01.000+0200}, title = {Dynamic power management for nonstationary service requests}, volume = 51, year = 2002 }