Publications
Published and Submitted Papers
Optimal Scheduling in the Multiserver-job Model under Heavy Traffic
Isaac Grosof, Ziv Scully, Mor Harchol-Balter, Alan Scheller-Wolf. To appear in ACM SIGMETRICS, June 2023.
WCFS: A new framework for analyzing multiserver systems
Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf. Queueing Systems, July 2022.
[paper] [arxiv] [video] [old version]
Towards the shortest DRAT proof of the Pigeonhole Principle
Isaac Grosof, Naifeng Zhang, Marijn Heule. Pragmatics of SAT, August 2022.
Uniform Bounds for Scheduling with Job Size Estimates
Ziv Scully, Isaac Grosof, Michael Mitzenmacher. Innovations in Theoretical Computer Science, Jan. 2022.
[paper] [arxiv] [video] [talks]
Nudge: Stochastically Improving upon FCFS
Isaac Grosof, Kunhe Yang, Ziv Scully, Mor Harchol-Balter. ACM SIGMETRICS, June 2021.
[paper] [arxiv] [short paper] [slides] [slides pdf] [talks]
Winner of the SIGMETRICS 2021 Best Paper Award
The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions
Ziv Scully, Isaac Grosof, Mor Harchol-Balter. ACM SIGMETRICS, June 2021.
Winner of the INFORMS 2022 George Nicholson Award
Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic
Ziv Scully, Isaac Grosof, Mor Harchol-Balter. IFIP Performance, Nov. 2020.
The CacheLib Caching Engine: Design and Experiences at Scale
Ben Berg, Daniel Berger, Sara McAllister, Isaac Grosof, Sathya Gunasekar, Jimmy Lu, Michael Uhlar, Jim Carrig, Nathan Beckmann, Mor Harchol-Balter, Greg Ganger. OSDI, Nov. 2020.
Load Balancing Guardrails
Keeping Your Heavy Traffic on the Road to Low Response Times
Isaac Grosof, Ziv Scully, Mor Harchol-Balter. ACM SIGMETRICS, Jun. 2019.
Winner of the SIGMETRICS 2019 Best Student Paper Award
Invited paper at STOC 2021 Theory Fest
[paper] [arxiv] [short paper] [poster] [talks]
SRPT for Multiserver Systems
Isaac Grosof, Ziv Scully, Mor Harchol-Balter. IFIP Performance, Dec. 2018. Also in the journal: Performance Evaluation, Nov. 2018.
Winner of the Performance 2018 Best Student Paper Award
[paper] [arxiv] [short paper] [talks]
Computational Complexity of Motion Planning of a Robot through Simple Gadgets
Erik D. Demaine, Isaac Grosof, Jayson Lynch, and Mikhail Rudoy. Ninth International Conference on Fun with Algorithms, June 2018.
Push-Pull Block Puzzles are Hard
Erik D. Demaine, Isaac Grosof, Jayson Lynch. International Conference on Algorithms and Complexity, May 2017.
Papers not currently under submission
Incentive Compatible Queues Without Money
Isaac Grosof, Michael Mitzenmacher. Not yet published.
Stability for Two-Class Multiserver-job Systems
Isaac Grosof, Mor Harchol-Balter, Alan Scheller-Wolf. Not yet published.