Check Swinburne's subscriptions for full text availabilitySearch Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/235741
- Title
- Speed scaling: an algorithmic perspective
- Author(s)
- Wierman, Adam; Andrew, Lachlan L. H.; Lin, Minghong
- Abstract
- Speed scaling has long been used as a power-saving mechanism at a chip level. However, in recent years, speed scaling has begun to be used as an approach for trading off energy usage and performance throughout all levels of computer systems. This wide-spread use of speed scaling has motivated significant research on the topic, but many fundamental questions about speed scaling are only beginning to be understood. In this chapter, we focus on a simple, but general, model of speed scaling and provide an algorithmic perspective on four fundamental questions: (i) What is the structure of the optimal speed scaling algorithm? (ii) How does speed scaling interact with scheduling? (iii) What is the impact of the sophistication of speed scaling algorithms? and (iv) Does speed scaling have any unintended consequences? For each question we provide a summary of insights from recent work on the topic in both worst-case and stochastic analysis as well as a discussion of interesting open questions that remain.
- Publication type
- Book chapter
- Source
- Handbook of energy-aware and green computing / Ishfaq Ahmad and Sanjay Rank (eds.), pp. 385-406
- Publication year
- 2012
- Keyword(s)
- Algorithms; Computer systems; Energy usage; Power consumption; Power saving; Speed scaling
- Publisher
- CRC Press
- ISBN
- 9781466501164, 1466501162
- Publisher URL
- http://www.crcpress.com/product/isbn/9781466501164
- Copyright
- Copyright © 2012.
- Peer reviewed
