Optimal power-down strategies

SIAM Journal on Computing

Volumn 37, Issue 5, 2007, Pages 1499-1516

  Augustine, John ^a,b   Irani, Sandy ^a   Swamy, Chaitanya ^c,d  

^a Ringgold Standard Institution Informatics   (United States)

^b TATA RESEARCH DEVELOPMENT AND DESIGN CENTRE   (India)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Dynamic power management; Online algorithms; Power aware computation

Indexed keywords

COMPETITIVE RATIOS; CONSUMPTION RATES; DYNAMIC POWER MANAGEMENT; IDLE PERIODS; LOW POWERS; ONLINE ALGORITHMS; ONLINE STRATEGIES; OPTIMAL POWERS; POWER-AWARE COMPUTATION; SIMPLE ALGORITHMS; SLEEP STATES; TRANSITION COSTS;

ELECTRIC POWER MEASUREMENT; ENERGY MANAGEMENT; PROBABILITY DISTRIBUTIONS;

SLEEP RESEARCH;

EID: 55249112967     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/05063787X     Document Type: Article

References (11)

1. C. ANDERSON AND A. KARLIN, Two adaptive hybrid cache coherency protocols, in Proceedings of the Second International Symposium on High-Performance Computer Architecture, San Jose, CA, 1996, pp. 303-313.
2. Y. AZAR, Y. BARTAL, E. FEUERSTEIN, A. FIAT, S. LEONARDI, AND A. ROSEN, On capital investment, Algorithmica, 25 (1999), pp. 22-36.
3. L. BENINI, A. BOGLIOLO, AND G. DE MICHELI, A survey of design techniques for system-level dynamic power management, IEEE Trans. Very Large Scale Integration (TVLSI) Systems, 8 (2000), pp. 299-316.
4. P. DAMASCHKE, Nearly optimal strategies for special cases of on-line capital investment, Theoret. Comput. Sci., 302 (2003), pp. 35-44.
5. S. J. EGGERS AND R. H. KATZ, Evaluating the performance of four snooping cache coherency protocols, in Proceedings of the 16th Annual International Symposium on Computer Architecture, ACM, New York, 1989, pp. 2-15.
6. S. IRANI, R. GUPTA, AND S. SHUKLA, Competitive analysis of dynamic power management strategies for systems with multiple power savings states, in Proceedings of the IEEE Conference on Design, Automation and Test in Europe, IEEE Computer Society, Washington, DC, 2002, p. 117.
7. S. IRANI, S. SHUKLA, AND R. GUPTA, Online strategies for dynamic power management in systems with multiple power saving states, Trans. on Embedded Computing Sys., Special Issue on Power Aware Embedded Computing, 8 (2003), pp. 325-346.
8. A. KARLIN, M. MANASSE, L. MCGEOCH, AND S. OWICKI, Randomized competitive algorithms for non-uniform problems, in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1990, pp. 301-309.
9. A. R. KARLIN, C. KENYON, AND D. RANDALL, Dynamic tap acknowledgement and other stories about e/(e - 1), in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 502-509.
10. A. R. KARLIN, K. LI, M. S. MANASSE, AND S. OWICKI, Empirical studies of competitve spinning for a shared-memory multiprocessor, in Proceedings of the 13th ACM Symposium on Operating Systems Principles, ACM, New York, 1991, pp. 41-55.
11. S. KESHAV, C. LUND, S. PHILLIPS, N. REINGOLD, AND H. SARAN, An empirical evaluation of virtual circuit holding time policies in ip-over-atm networks, IEEE J. Selected Areas in Communications, 13 (1995), pp. 1371-1382.