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 the 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 language | English (US) |
|---|---|
| Pages (from-to) | 20-39 |
| Number of pages | 20 |
| Journal | Performance Evaluation |
| Volume | 81 |
| DOIs | |
| State | Published - Nov 2014 |
Keywords
- Cloud computing
- Load balancing
- Resource allocation
- Scheduling
ASJC Scopus subject areas
- Software
- Modeling and Simulation
- Hardware and Architecture
- 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
Maguluri, S. T., Srikant, R., & Ying, L. (2014). Heavy traffic optimal resource allocation algorithms for cloud computing clusters. Performance Evaluation, 81, 20-39. https://doi.org/10.1016/j.peva.2014.08.002