Affiliation:
1. Georgia Institute of Technology, School of Industrial and System
Abstract
Scheduling theory is a key tool for reducing latency (i.e. response time) in queueing systems. Scheduling, i.e. choosing the order in which to serve jobs, can reduce response time by an order of magnitude with no additional resources. Scheduling theory is well-developed in single-server systems, where one job is processed at a time. However, little is known about scheduling in multiserver systems, where many jobs are processed at once. Results are especially limited in stochastic multiserver scheduling theory. Today's datacenters have thousands of servers, and scheduling theory is unable to analyze such systems.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference8 articles.
1. Randomized algorithms for scheduling VMs in the cloud
2. Bandit Processes and Dynamic Allocation Indices
3. Invited Paper: ServerFilling: A better approach to packing multiserver jobs
4. WCFS: a new framework for analyzing multiserver systems
5. I. Grosof , M. Harchol-Balter , and A. Scheller-Wolf . New stability results for multiserver-job models via product-form saturated systems. MAthematical performance Modeling and Analysis (MAMA) , 2023 . I. Grosof, M. Harchol-Balter, and A. Scheller-Wolf. New stability results for multiserver-job models via product-form saturated systems. MAthematical performance Modeling and Analysis (MAMA), 2023.