32 citations · 67 across the 13 of their papers we have counts for
12 papers · 1 filter
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…
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…