Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1
We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with
light-tailed job sizes, to asymptotically optimize the response time tail. This means …
light-tailed job sizes, to asymptotically optimize the response time tail. This means …
Bounds on M/G/k Scheduling Under Moderate Load Improving on SRPT-k and Tightening Lower Bounds
I Grosof, Z Wang - ACM SIGMETRICS Performance Evaluation Review, 2024 - dl.acm.org
A well-designed scheduling policy can significantly improve the performance of a queueing
system, without requiring any additional resources. While scheduling is well-understood in …
system, without requiring any additional resources. While scheduling is well-understood in …