DeepAI AI Chat
Log In Sign Up

SEH: Size Estimate Hedging for Single-Server Queues

by   Maryam Akbari-Moghaddam, et al.
McMaster University

For a single server system, Shortest Remaining Processing Time (SRPT) is an optimal size-based policy. In this paper, we discuss scheduling a single-server system when exact information about the jobs' processing times is not available. When the SRPT policy uses estimated processing times, the underestimation of large jobs can significantly degrade performance. We propose a simple heuristic, Size Estimate Hedging (SEH), that only uses estimated processing times for scheduling decisions. A job's priority is increased dynamically according to an SRPT rule until it is determined that it is underestimated, at which time the priority is frozen. Numerical results suggest that SEH has desirable performance for estimation error variance that is consistent with what is seen in practice.


page 1

page 2

page 3

page 4


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

We consider the problem of preemptively scheduling jobs to minimize mean...

Scheduling to Optimize Sojourn Time of Successful Jobs

Deep neural networks training jobs and other iterative computations freq...

Full Version – Server Cloud Scheduling

Consider a set of jobs connected to a directed acyclic task graph with a...

Uniform Bounds for Scheduling with Job Size Estimates

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

Efficient Two-Level Scheduling for Concurrent Graph Processing

With the rapidly growing demand of graph processing in the real scene, t...

Longest Processing Time rule for identical parallel machines revisited

We consider the Pm || Cmax scheduling problem where the goal is to sched...