Heavy traffic optimal resource allocation algorithms for cloud computing clusters

Siva Theja Maguluri, R. Srikant, Lei Ying

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. We consider a model where the resource allocation problem can be separated into a routing or load balancing problem and a scheduling problem. We study the join-the-shortest-queue routing and power-of-two-choices routing algorithms with MaxWeight scheduling algorithm. It was known that these algorithms are throughput optimal. In this paper, we show that these algorithms are queue length optimal in the heavy traffic limit.

Original languageEnglish (US)
Title of host publicationFinal Program - 2012 24th International Teletraffic Congress, ITC 24
Pages65-72
Number of pages8
StatePublished - 2012
Event2012 24th International Teletraffic Congress, ITC 2012 - Krakow, Poland
Duration: Sep 4 2012Sep 7 2012

Publication series

NameFinal Program - 2012 24th International Teletraffic Congress, ITC 24

Other

Other2012 24th International Teletraffic Congress, ITC 2012
Country/TerritoryPoland
CityKrakow
Period9/4/129/7/12

Keywords

  • Scheduling
  • cloud computing
  • load balancing
  • resource allocation

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Heavy traffic optimal resource allocation algorithms for cloud computing clusters'. Together they form a unique fingerprint.

Cite this