Nudge: Stochastically Improving upon FCFS

by   Isaac Grosof, et al.
Carnegie Mellon University

The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about the asymptotic tail? What if we also care about the 99th percentile of response time, or the fraction of jobs that complete in under one second? Is FCFS still best? Outside of the asymptotic regime, only loose bounds on the tail of FCFS are known, and optimality is completely open. In this paper, we introduce a new policy, Nudge, which is the first policy to provably stochastically improve upon FCFS. We prove that Nudge simultaneously improves upon FCFS at every point along the tail, for light-tailed job size distributions. As a result, Nudge outperforms FCFS for every moment and every percentile of response time. Moreover, Nudge provides a multiplicative improvement over FCFS in the asymptotic tail. This resolves a long-standing open problem by showing that, counter to previous conjecture, FCFS is not strongly asymptotically optimal.


page 1

page 2

page 3

page 4


When Does the Gittins Policy Have Asymptotically Optimal Response Time Tail?

We consider scheduling in the M/G/1 queue with unknown job sizes. It is ...

On the stochastic and asymptotic improvement of First-Come First-Served and Nudge scheduling

Recently it was shown that, contrary to expectations, the First-Come-Fir...

Fork-join and redundancy systems with heavy-tailed job sizes

We investigate the tail asymptotics of the response time distribution fo...

Distributionally robust tail bounds based on Wasserstein distance and f-divergence

In this work, we provide robust bounds on the tail probabilities and the...

Uniform Bounds for Scheduling with Job Size Estimates

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

A Restless Bandit Model for Energy-Efficient Job Assignments in Server Farms

We aim to maximize the energy efficiency, gauged as average energy cost ...

Two-Tailed Averaging: Anytime Adaptive Once-in-a-while Optimal Iterate Averaging for Stochastic Optimization

Tail averaging improves on Polyak averaging's non-asymptotic behaviour b...

Please sign up or login with your details

Forgot password? Click here to reset