Skip to main content
Article thumbnail
Location of Repository

Energy-Aware Service Allocation

By Damien Borgetto A, Henri Casanova B, Georges Da Costa A and Jean-marc Pierson A

Abstract

In this paper we study the problem of energy-aware resource allocation for hosting long-term services or on-demand compute jobs in clusters, e.g., deployed as part of computing infrastructures. We formalize the problem as three constrained optimization problems: maximize job performance under power consumption constraints, minimize power consumption under job performance constraints, and optimize a linear combination of power consumption and job performance. These problems are NP-hard but, given an instance, a bound on the optimal solution can be computed via a rational linear program. We propose polynomial heuristics for all three problems. Simulation experiments show that in all three cases some heuristics can achieve results close to optimal, i.e., lead to good job performance while conserving energy. 1

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.309.8953
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://navet.ics.hawaii.edu/~c... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.