activity
20182025
most citedOptimal Scheduling in the Multiserver-job Model under Heavy Traffic

32 citations · 67 across the 13 of their papers we have counts for

collaborators

13 papers

cs.PF2025

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,…

cs.PF2024

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…

cs.PF2024★ 10 cited

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…

cs.PF2023★ 2 cited

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-…

cs.PF2022★ 32 cited

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…

cs.GT2022★ 1 cited

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…