• DocumentCode
    3304148
  • Title

    Task and Server Assignment for Reduction of Energy Consumption in Datacenters

  • Author

    Liu, Ning ; Dong, Ziqian ; Rojas-Cessa, Roberto

  • Author_Institution
    Dept. of Math., New Jersey Inst. of Technol., Newark, NJ, USA
  • fYear
    2012
  • fDate
    23-25 Aug. 2012
  • Firstpage
    171
  • Lastpage
    174
  • Abstract
    Energy consumption of cloud data centers accounts for a major operational cost. This paper presents an optimization model for task scheduling to minimize task processing time and energy consumption in data centers for cloud computing. We formulate an integer programming optimization problem to minimize the expected energy consumption of homogenous tasks in a data center with a large number of servers and propose the most-efficient-server first greedy task scheduling algorithm to minimize energy expenditure. We show that the proposed task scheduling can minimize the energy expenditure while bounding the average task waiting time. We present a simulation of the proposed task scheduling scheme to show an optimum number of servers to achieve small task processing times and to minimize energy consumption.
  • Keywords
    cloud computing; computer centres; energy conservation; energy consumption; integer programming; power aware computing; scheduling; cloud computing; cloud data center; datacenter; energy consumption reduction; energy expenditure minimization; homogenous task; integer programming optimization problem; most-efficient-server first greedy task scheduling algorithm; optimization model; server assignment; task assignment; task processing time minimization; Cloud computing; Clouds; Energy consumption; Optimization; Processor scheduling; Resource management; Servers; Cloud computing; Energy; Green Cloud; Task Scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Computing and Applications (NCA), 2012 11th IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    978-1-4673-2214-0
  • Type

    conf

  • DOI
    10.1109/NCA.2012.42
  • Filename
    6299091