Search Swinburne Research Bank
This object has not yet been indexed by the background indexing service.
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/235736
|Download PDF (Accepted manuscript) (Adobe Acrobat PDF, -1 bytes)|
- Simple and effective dynamic provisioning for power-proportional data centers
- Lu, Tan; Chen, Minghua; Andrew, Lachlan L. H.
- Energy consumption represents a significant cost in data center operation. A large fraction of the energy, however, is used to power idle servers when the workload is low. Dynamic provisioning techniques aim at saving this portion of the energy, by turning off unnecessary servers. In this paper, we explore how much gain knowing future workload information can bring to dynamic provisioning. In particular, we develop online dynamic provisioning solutions with and without future workload information available. We first reveal an elegant structure of the off-linedynamic provisioning problem, which allows us to characterize the optimal solution in a “divide-and-conquer” manner. We then exploit this insight to design two online algorithms with competitive ratios 2 − α and e/ (e − 1 + α), respectively, where 0 ≤ α ≤ 1 is the normalized size of a look-ahead window in which future workload information is available. A fundamental observation is that future workload information beyond the fullsize look-ahead window (corresponding to α = 1) will not improve dynamic provisioning performance. Our algorithms are decentralized and easy to implement. We demonstrate their effectiveness in simulations using real-world traces
- Publication type
- Journal article
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies. Centre for Advanced Internet Architectures
- IEEE Transactions on Parallel and Distributed Systems, Vol. 24, no. 6 (Jun 2013), pp. 1161-1171
- Publication year
- Publisher URL
- Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.