250 citations · 1.1k across the 76 of their papers we have counts for
Showing cs.PFShow all
3 papers · 1 filter
cs.PF2021★ 3 cited
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…
cs.PF2020
Queues with Small Advice
Michael Mitzenmacher
Motivated by recent work on scheduling with predicted job sizes, we consider the performance of scheduling algorithms with minimal advice, namely a single bit. Besides demonstratin…
cs.PF2019★ 9 cited
The Supermarket Model with Known and Predicted Service Times
Michael Mitzenmacher, Matteo Dell'Amico
The supermarket model refers to a system with a large number of queues, where new customers choose d queues at random and join the one with the fewest customers. This model demonst…