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 …
The Gittins scheduling policy minimizes the mean response in the single-server M/G/1 queue in a wide variety of settings. Most famously, Gittins is optimal when preemption is …
Multiserver queueing systems are found at the core of a wide variety of practical systems. Many important multiserver models have a previously-unexplained similarity: identical mean …
Z Bian, S Li, W Wang, Y You - … of the International Conference for High …, 2021 - dl.acm.org
Efficient GPU resource scheduling is essential to maximize resource utilization and save training costs for the increasing amount of deep learning workloads in shared GPU clusters …
Queueing delays are ubiquitous in many domains, including computer systems, service systems, communication networks, supply chains, and transportation. Queueing and …
F Ziaei, M Ranjbar - Machine Learning with Applications, 2023 - Elsevier
In this study, we investigate a real-time system where computationally intensive tasks are executed using cloud computing platforms in data centers. These data centers are designed …
We consider scheduling to minimize mean response time of the M/G/k queue with unknown job sizes. In the singleserver k= 1 case, the optimal policy is the Gittins policy, but it is not …
Y Hong, Z Scully - ACM SIGMETRICS Performance Evaluation Review, 2023 - dl.acm.org
We consider the classic problem of preemptively scheduling jobs of unknown size (aka service time) in a queue to minimize mean number-in-system, or equivalently mean …
J Dong, R Ibrahim - Management Science, 2021 - pubsonline.informs.org
The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet …