The reviewed record of science sign in
Pith

arxiv: 2101.00007 · v5 · pith:YSBNZKIQ · submitted 2020-12-30 · cs.OH · math.OC

SEH: Size Estimate Hedging for Single-Server Queues

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YSBNZKIQrecord.jsonopen to challenge →

classification cs.OH math.OC
keywords processingsrpttimesestimateestimatedhedgingjobsperformance
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.