Optimal Algorithms for Right-Sizing Data Centers - Extended Version

07/13/2018
by   Susanne Albers, et al.
0

Electricity cost is a dominant and rapidly growing expense in data centers. Unfortunately, much of the consumed energy is wasted because servers are idle for extended periods of time. We study a capacity management problem that dynamically right-sizes a data center, matching the number of active servers with the varying demand for computing capacity. We resort to a data-center optimization problem introduced by Lin, Wierman, Andrew and Thereska that, over a time horizon, minimizes a combined objective function consisting of operating cost, modeled by a sequence of convex functions, and server switching cost. All prior work addresses a continuous setting in which the number of active servers, at any time, may take a fractional value. In this paper, we investigate for the first time the discrete data-center optimization problem where the number of active servers, at any time, must be integer valued. Thereby we seek truly feasible solutions. First, we show that the offline problem can be solved in polynomial time. Our algorithm relies on a new, yet intuitive graph theoretic model of the optimization problem and performs binary search in a layered graph. Second, we study the online problem and extend the algorithm Lazy Capacity Provisioning (LCP) by Lin et al. to the discrete setting. We prove that LCP is 3-competitive. Moreover, we show that no deterministic online algorithm can achieve a competitive ratio smaller than 3. We develop a randomized online algorithm that is 2-competitive against an oblivious adversary and prove that 2 is a lower bound for the competitive ratio of randomized online algorithms. Finally, we address the continuous setting and give a lower bound of 2 on the best competitiveness of online algorithms. All lower bounds mentioned above also holds in a problem variant with more restricted operating cost functions, introduced by Lin et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/30/2021

Algorithms for Right-Sizing Heterogeneous Data Centers

Power consumption is a dominant and still growing cost factor in data ce...
research
07/30/2021

Algorithms for Energy Conservation in Heterogeneous Data Centers

Power consumption is the major cost factor in data centers. It can be re...
research
03/20/2018

An Online Algorithm for Power-proportional Data Centers with Switching Cost

Recent works show that power-proportional data centers can save energy c...
research
11/02/2020

Tight Bounds for Online Graph Partitioning

We consider the following online optimization problem. We are given a gr...
research
11/05/2019

Unbounded lower bound for k-server against weak adversaries

We study the resource augmented version of the k-server problem, also kn...
research
06/30/2018

An optimal algorithm for 2-bounded delay buffer management with lookahead

The bounded delay buffer management problem, which was proposed by Kesse...
research
09/24/2022

Improving the Bounds of the Online Dynamic Power Management Problem

We investigate the power-down mechanism which decides when a machine tra...

Please sign up or login with your details

Forgot password? Click here to reset