36 citations · 122 across the 30 of their papers we have counts for
5 papers · 1 filter
The Gittins Policy in the M/G/1 Queue
Ziv Scully, Mor Harchol-Balter
The Gittins policy is a highly general scheduling policy that minimizes a wide variety of mean holding cost metrics in the M/G/1 queue. Perhaps most famously, Gittins minimizes mea…
How to Schedule Near-Optimally under Real-World Constraints
Ziv Scully, Mor Harchol-Balter
Scheduling is a critical part of practical computer systems, and scheduling has also been extensively studied from a theoretical perspective. Unfortunately, there is a gap between…
Computing the Death Rate of COVID-19
Naveen Pai, Sean Zhang, Mor Harchol-Balter
The Infection Fatality Rate (IFR) of COVID-19 is difficult to estimate because the number of infections is unknown and there is a lag between each infection and the potentially sub…
WCFS: A new framework for analyzing multiserver systems
Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf
Multiserver queueing systems are found at the core of a wide variety of practical systems. Many important multiserver models have a previously-unexplained similarity: identical mea…
Nudge: Stochastically Improving upon FCFS
Isaac Grosof, Kunhe Yang, Ziv Scully +1
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…