Deadline-aware Power Management in Data Centers

We study the dynamic power optimization problem in data centers. We formulate and solve the following offline problem: in which slot which server has to be assigned to which job; and in which slot which server has to be switched ON or OFF so that the total power is optimal for some time horizon. We...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2015-07
Main Authors: Cengis Hasan, Haas, Zygmunt J
Format: Article
Language:English
Subjects:
Algorithms
Computer centers
Data centers
Operations research
Optimization
Power management
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the dynamic power optimization problem in data centers. We formulate and solve the following offline problem: in which slot which server has to be assigned to which job; and in which slot which server has to be switched ON or OFF so that the total power is optimal for some time horizon. We show that the offline problem is a new version of generalized assignment problem including new constraints issuing from deadline characteristics of jobs and difference of activation energy of servers. We propose an online algorithm that solves the problem heuristically and compare it to randomized routing.
ISSN:2331-8422