Competitive analysis of dynamic power management strategies for systems with multiple power saving states

被引:49
作者
Irani, S [1 ]
Shukla, S [1 ]
Gupta, R [1 ]
机构
[1] Univ Calif Irvine, Irvine, CA 92697 USA
来源
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, 2002 PROCEEDINGS | 2002年
关键词
D O I
10.1109/DATE.2002.998258
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present strategies for "online" dynamic power management(DPM) based on the notion of the competitive ratio that allows us to compare the effectiveness of algorithms against an optimal strategy. This paper makes two contributions: it provides a theoretical basis for the analysis of DPM strategies for systems with multiple power down states; and provides a competitive algorithm based on probabilistically generated inputs that improves the competitive ratio over deterministic strategies. Experimental results show that our probability-based DPM strategy improves the efficiency of power management over the deterministic DPM strategy by 25%, bringing the strategy to within 23% of the optimal offline DPM.
引用
收藏
页码:117 / 123
页数:7
相关论文
共 12 条
[1]  
Atallah M.J., 1999, ALGORITHMS THEORY CO, pCH10
[2]   Policy optimization for dynamic power management [J].
Benini, L ;
Bogliolo, A ;
Paleologo, GA ;
De Micheli, G .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (06) :813-833
[3]   Dynamic Power Management for non-stationary service requests [J].
Chung, EY ;
Benini, L ;
Bogliolo, A ;
De Micheli, G .
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION 1999, PROCEEDINGS, 1999, :77-81
[4]  
CHUNG EY, 1999, P ICCAD
[5]  
HWANG CH, 1996, P IEEE ACM INT C COM, P28
[6]  
KARLIN A, 1990, 1 ANN ACM SIAM S DIS, P301
[7]   AN EMPIRICAL-EVALUATION OF VIRTUAL CIRCUIT HOLDING TIME POLICIES IN IP-OVER-ATM NETWORKS [J].
KESHAV, S ;
LUND, C ;
PHILLIPS, S ;
REINGOLD, N ;
SARAN, H .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (08) :1371-1382
[8]  
LU Y, 1999, P GREAT LAK S VLSI
[9]  
LU Y, 2000, DATE P DES AUT TEST
[10]  
QIU Q, 1999, P DES AUT C JUN, P555