Simple Near-Optimal Scheduling for the M/G/1

by   Ziv Scully, et al.

We consider the problem of preemptively scheduling jobs to minimize mean response time of an M/G/1 queue. When the scheduler knows each job's size, the shortest remaining processing time (SRPT) policy is optimal. Unfortunately, in many settings we do not have access to each job's size. Instead, we know only the job size distribution. In this setting, the Gittins policy is known to minimize mean response time, but its complex priority structure can be computationally intractable. A much simpler alternative to Gittins is the shortest expected remaining processing time (SERPT) policy. While SERPT is a natural extension of SRPT to unknown job sizes, it is unknown how close SERPT is to optimal. We present a new variant of SERPT called monotonic SERPT (M-SERPT) which is as simple as SERPT but has provably near-optimal mean response time at all loads for any job size distribution. Specifically, we prove the mean response time ratio between M-SERPT and Gittins is at most 3 for load ρ≤ 8/9 and at most 5 for any load. This makes M-SERPT the only scheduling policy known to be constant-competitive with Gittins.


page 1

page 2

page 3

page 4


Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs

Scheduling to minimize mean response time in an M/G/1 queue is a classic...

Uniform Bounds for Scheduling with Job Size Estimates

We consider the problem of scheduling to minimize mean response time in ...

Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic

We consider scheduling to minimize mean response time of the M/G/k queue...

Scheduling With Inexact Job Sizes: The Merits of Shortest Processing Time First

It is well known that size-based scheduling policies, which take into ac...

Performance Analysis of Modified SRPT in Multiple-Processor Multitask Scheduling

In this paper we study the multiple-processor multitask scheduling probl...

How to Schedule Near-Optimally under Real-World Constraints

Scheduling is a critical part of practical computer systems, and schedul...

SEH: Size Estimate Hedging for Single-Server Queues

For a single server system, Shortest Remaining Processing Time (SRPT) is...

Please sign up or login with your details

Forgot password? Click here to reset