TY - GEN
T1 - Scheduling jobs with unknown duration in clouds
AU - Maguluri, Siva Theja
AU - Srikant, Rayadurgam
PY - 2013/9/2
Y1 - 2013/9/2
N2 - We consider a stochastic model of jobs arriving at a cloud data center. Each job requests a certain amount of CPU, memory, disk space, etc. Job sizes (durations) are also modeled as random variables, with possibly unbounded support. These jobs need to be scheduled non preemptively on servers. The jobs are first routed to one of the servers when they arrive and are queued at the servers. Each server then chooses a set of jobs from its queues so that it has enough resources to serve all of them simultaneously. This problem has been studied previously under the assumption that job sizes are known and upper bounded, and an algorithm was proposed which stabilizes traffic load in a diminished capacity region. Here, we present a load balancing and scheduling algorithm that is throughput optimal, without assuming that job sizes are known or are upper bounded.
AB - We consider a stochastic model of jobs arriving at a cloud data center. Each job requests a certain amount of CPU, memory, disk space, etc. Job sizes (durations) are also modeled as random variables, with possibly unbounded support. These jobs need to be scheduled non preemptively on servers. The jobs are first routed to one of the servers when they arrive and are queued at the servers. Each server then chooses a set of jobs from its queues so that it has enough resources to serve all of them simultaneously. This problem has been studied previously under the assumption that job sizes are known and upper bounded, and an algorithm was proposed which stabilizes traffic load in a diminished capacity region. Here, we present a load balancing and scheduling algorithm that is throughput optimal, without assuming that job sizes are known or are upper bounded.
UR - http://www.scopus.com/inward/record.url?scp=84883079751&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84883079751&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2013.6566988
DO - 10.1109/INFCOM.2013.6566988
M3 - Conference contribution
AN - SCOPUS:84883079751
SN - 9781467359467
T3 - Proceedings - IEEE INFOCOM
SP - 1887
EP - 1895
BT - 2013 Proceedings IEEE INFOCOM 2013
T2 - 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013
Y2 - 14 April 2013 through 19 April 2013
ER -