32 citations · 67 across the 13 of their papers we have counts for
13 papers
Novel Lower Bounds on M/G/k Scheduling
Ziyuan Wang, Izzy Grosof
In queueing systems, effective scheduling algorithms are essential for optimizing performance. Optimal scheduling for the M/G/k queue has been explored in the heavy traffic limit,…
Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload
Isaac Grosof, Yige Hong, Mor Harchol-Balter
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according…
Heavy-Traffic Optimal Size- and State-Aware Dispatching
Runhan Xie, Isaac Grosof, Ziv Scully
Dispatching systems, where arriving jobs are immediately assigned to one of multiple queues, are ubiquitous in computer systems and service systems. A natural and practically relev…
The RESET and MARC Techniques, with Application to Multiserver-Job Analysis
Isaac Grosof, Yige Hong, Mor Harchol-Balter +1
Multiserver-job (MSJ) systems, where jobs need to run concurrently across many servers, are increasingly common in practice. The default service ordering in many settings is First-…
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic
Isaac Grosof, Ziv Scully, Mor Harchol-Balter +1
Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Essentially all of the theoretical work on multiserver-job systems focuses…
Incentive Compatible Queues Without Money
Isaac Grosof, Michael Mitzenmacher
For job scheduling systems, where jobs require some amount of processing and then leave the system, it is natural for each user to provide an estimate of their job's time requireme…
Uniform Bounds for Scheduling with Job Size Estimates
Ziv Scully, Isaac Grosof, Michael Mitzenmacher
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 tr…
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…
Stability for Two-class Multiserver-job Systems
Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf
Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Much is known in the dropping setting, where jobs are immediately discarde…
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic
Ziv Scully, Isaac Grosof, Mor Harchol-Balter
We consider scheduling to minimize mean response time of the M/G/k queue with unknown job sizes. In the single-server case, the optimal policy is the Gittins policy, but it is not…
Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times
Isaac Grosof, Ziv Scully, Mor Harchol-Balter
Load balancing systems, comprising a central dispatcher and a scheduling policy at each server, are widely used in practice, and their response time has been extensively studied in…
SRPT for Multiserver Systems
Isaac Grosof, Ziv Scully, Mor Harchol-Balter
The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results a…