Uniform Bounds for Scheduling with Job Size Estimates

10/01/2021
by   Ziv Scully, et al.
0

We consider the problem of scheduling to minimize mean response time in M/G/1 queues where only estimated job sizes (processing times) are known to the scheduler, where a job of true size s has estimated size in the interval [β s, α s] for some α≥β > 0. We evaluate each scheduling policy by its approximation ratio, which we define to be the ratio between its mean response time and that of Shortest Remaining Processing Time (SRPT), the optimal policy when true sizes are known. Our question: is there a scheduling policy that (a) has approximation ratio near 1 when α and β are near 1, (b) has approximation ratio bounded by some function of α and β even when they are far from 1, and (c) can be implemented without knowledge of α and β? We first show that naively running SRPT using estimated sizes in place of true sizes is not such a policy: its approximation ratio can be arbitrarily large for any fixed β < 1. We then provide a simple variant of SRPT for estimated sizes that satisfies criteria (a), (b), and (c). In particular, we prove its approximation ratio approaches 1 uniformly as α and β approach 1. This is the first result showing this type of convergence for M/G/1 scheduling. We also study the Preemptive Shortest Job First (PSJF) policy, a cousin of SRPT. We show that, unlike SRPT, naively running PSJF using estimated sizes in place of true sizes satisfies criteria (b) and (c), as well as a weaker version of (a).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

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

We consider the problem of preemptively scheduling jobs to minimize mean...
research
07/10/2019

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...
research
03/30/2020

Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic

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

Non-Asymptotic Performance Analysis of Size-Based Routing Policies

We investigate the performance of two size-based routing policies: the S...
research
12/30/2020

SEH: Size Estimate Hedging for Single-Server Queues

For a single server system, Shortest Remaining Processing Time (SRPT) is...
research
06/02/2021

Nudge: Stochastically Improving upon FCFS

The First-Come First-Served (FCFS) scheduling policy is the most popular...
research
10/31/2018

Randomized Work Stealing versus Sharing in Large-scale Systems with Non-exponential Job Sizes

Work sharing and work stealing are two scheduling paradigms to redistrib...

Please sign up or login with your details

Forgot password? Click here to reset