Scheduling jobs with unknown duration in clouds

  • Maguluri S
  • Srikant R
  • 60


    Mendeley users who have this article in their library.
  • 25


    Citations of this article.


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 nonpreemptively on servers. Thejobsare first routed to one of the serverswhen 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 that stabilizes traffic load in a diminished capacity region. Here, we present a load balancing and scheduling algo- rithm that is throughput-optimal, without assuming that job sizes are known or are upper-bounded.

Author-supplied keywords

  • Cloud computing
  • performance evaluation
  • queueing theory
  • resource allocation
  • scheduling

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Siva Theja Maguluri

  • R. Srikant

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free