Algorithms with predictions
M Mitzenmacher, S Vassilvitskii - Communications of the ACM, 2022 - dl.acm.org
Algorithms with predictions Page 1 JULY 2022 | VOL. 65 | NO. 7 | COMMUNICATIONS OF
THE ACM 33 viewpoints IMA GE B Y ANDRIJ BOR YS A SSOCIA TE S, USING SHUTTERS T …
THE ACM 33 viewpoints IMA GE B Y ANDRIJ BOR YS A SSOCIA TE S, USING SHUTTERS T …
Scheduling with predictions and the price of misprediction
M Mitzenmacher - arXiv preprint arXiv:1902.00732, 2019 - arxiv.org
In many traditional job scheduling settings, it is assumed that one knows the time it will take
for a job to complete service. In such cases, strategies such as shortest job first can be used …
for a job to complete service. In such cases, strategies such as shortest job first can be used …
Uniform bounds for scheduling with job size estimates
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 …
where only estimated job sizes (processing times) are known to the scheduler, where a job …
A new toolbox for scheduling theory
Z Scully - ACM SIGMETRICS Performance Evaluation Review, 2023 - dl.acm.org
Queueing delays are ubiquitous in many domains, including computer systems, service
systems, communication networks, supply chains, and transportation. Queueing and …
systems, communication networks, supply chains, and transportation. Queueing and …
Queues with small advice
M Mitzenmacher - SIAM Conference on Applied and Computational …, 2021 - SIAM
Motivated by recent work on scheduling with predicted job sizes, we consider the
performance of scheduling algorithms with minimal advice, namely a single bit. The analysis …
performance of scheduling algorithms with minimal advice, namely a single bit. The analysis …
HFSP: bringing size-based scheduling to hadoop
Size-based scheduling with aging has been recognized as an effective approach to
guarantee fairness and near-optimal system response times. We present HFSP, a scheduler …
guarantee fairness and near-optimal system response times. We present HFSP, a scheduler …
2dfq: Two-dimensional fair queuing for multi-tenant cloud services
In many important cloud services, different tenants execute their requests in the thread pool
of the same process, requiring fair sharing of resources. However, using fair queue …
of the same process, requiring fair sharing of resources. However, using fair queue …
The supermarket model with known and predicted service times
M Mitzenmacher, M Dell'Amico - IEEE Transactions on Parallel …, 2022 - ieeexplore.ieee.org
The supermarket model refers to a system with a large number of queues, where new
customers choose queues at random and join the one with the fewest customers. This model …
customers choose queues at random and join the one with the fewest customers. This model …
Scheduling placement-sensitive BSP jobs with inaccurate execution time estimation
The Bulk Synchronous Parallel (BSP) paradigm is gaining tremendous importance recently
because of the pop-ularity of computations such as distributed machine learning and graph …
because of the pop-ularity of computations such as distributed machine learning and graph …
Seh: Size estimate hedging scheduling of queues
M Akbari-Moghaddam, DG Down - ACM Transactions on Modeling and …, 2023 - dl.acm.org
For a single server system, Shortest Remaining Processing Time (SRPT) is an optimal size-
based policy. In this article, we discuss scheduling a single-server system when exact …
based policy. In this article, we discuss scheduling a single-server system when exact …