DeepAI AI Chat
Log In Sign Up

Scheduling for Multi-Phase Parallelizable Jobs

by   Rahul Vaze, et al.

With multiple identical unit speed servers, the online problem of scheduling jobs that migrate between two phases, limitedly parallelizable or completely sequential, and choosing their respective speeds to minimize the total flow time is considered. In the limited parallelizable regime, allocating k servers to a job, the speed extracted is k^1/α, α>1, a sub-linear, concave speedup function, while in the sequential phase, a job can be processed by at most one server with a maximum speed of unity. A LCFS based algorithm is proposed for scheduling jobs which always assigns equal speed to the jobs that are in the same phase (limitedly parallelizable/sequential), and is shown to have a constant (dependent only on α > 1) competitive ratio. For the special case when all jobs are available beforehand, improved competitive ratio is obtained.


page 1

page 2

page 3

page 4


Speed Scaling with Multiple Servers Under A Sum Power Constraint

The problem of scheduling jobs and choosing their respective speeds with...

On the Optimality of Scheduling Dependent MapReduce Tasks on Heterogeneous Machines

MapReduce is the most popular big-data computation framework, motivating...

Characterization of the Gittins index for sequential multistage jobs

The optimal scheduling problem in single-server queueing systems is a cl...

A Foreground-Background queueing model with speed or capacity modulation

The models studied in the steady state involve two queues which are serv...

Speed Scaling with Tandem Servers

Speed scaling for a tandem server setting is considered, where there is ...

Renting Servers in the Cloud: The Case of Equal Duration Jobs

Renting servers in the cloud is a generalization of the bin packing prob...

Online variable-weight scheduling with preempting on jobs with linear and exponential penalties

We analyze the problem of job scheduling with preempting on weighted job...