CaltechTHESIS
  A Caltech Library Service

Algorithmic challenges in green data centers

Citation

Lin, Minghong (2013) Algorithmic challenges in green data centers. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:05312013-223354639

Abstract

With data centers being the supporting infrastructure for a wide range of IT services, their efficiency has become a big concern to operators, as well as to society, for both economic and environmental reasons. The goal of this thesis is to design energy-efficient algorithms that reduce energy cost while minimizing compromise to service. We focus on the algorithmic challenges at different levels of energy optimization across the data center stack. The algorithmic challenge at the device level is to improve the energy efficiency of a single computational device via techniques such as job scheduling and speed scaling. We analyze the common speed scaling algorithms in both the worst-case model and stochastic model to answer some fundamental issues in the design of speed scaling algorithms. The algorithmic challenge at the local data center level is to dynamically allocate resources (e.g., servers) and to dispatch the workload in a data center. We develop an online algorithm to make a data center more power-proportional by dynamically adapting the number of active servers. The algorithmic challenge at the global data center level is to dispatch the workload across multiple data centers, considering the geographical diversity of electricity price, availability of renewable energy, and network propagation delay. We propose algorithms to jointly optimize routing and provisioning in an online manner. Motivated by the above online decision problems, we move on to study a general class of online problem named "smoothed online convex optimization", which seeks to minimize the sum of a sequence of convex functions when "smooth" solutions are preferred. This model allows us to bridge different research communities and help us get a more fundamental understanding of general online decision problems.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:green data centers; convex optimizations; online algorithms;
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Wierman, Adam C.
Thesis Committee:
  • Wierman, Adam C. (chair)
  • Low, Steven H.
  • Chandy, K. Mani
  • Lui, John C. S.
Defense Date:6 June 2013
Record Number:CaltechTHESIS:05312013-223354639
Persistent URL:http://resolver.caltech.edu/CaltechTHESIS:05312013-223354639
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7815
Collection:CaltechTHESIS
Deposited By: Minghong Lin
Deposited On:18 Jun 2013 21:08
Last Modified:18 Jun 2013 21:08

Thesis Files

[img]
Preview
PDF - Final Version
See Usage Policy.

1263Kb

Repository Staff Only: item control page