Optimal Scheduling in the Multiserver-job Model under Heavy Traffic

by   Isaac Grosof, et al.
Carnegie Mellon University

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 on maximizing utilization, with almost nothing known about mean response time. In simpler settings, such as various known-size single-server-job settings, minimizing mean response time is merely a matter of prioritizing small jobs. However, for the multiserver-job system, prioritizing small jobs is not enough, because we must also ensure servers are not unnecessarily left idle. Thus, minimizing mean response time requires prioritizing small jobs while simultaneously maximizing throughput. Our question is how to achieve these joint objectives. We devise the ServerFilling-SRPT scheduling policy, which is the first policy to minimize mean response time in the multiserver-job model in the heavy traffic limit. In addition to proving this heavy-traffic result, we present empirical evidence that ServerFilling-SRPT outperforms all existing scheduling policies for all loads, with improvements by orders of magnitude at higher loads. Because ServerFilling-SRPT requires knowing job sizes, we also define the ServerFilling-Gittins policy, which is optimal when sizes are unknown or partially known.


page 1

page 2

page 3

page 4


Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic

We consider scheduling to minimize mean response time of the M/G/k queue...

Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times

Load balancing systems, comprising a central dispatcher and a scheduling...

Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs

Scheduling to minimize mean response time in an M/G/1 queue is a classic...

Towards Optimality in Parallel Scheduling

To keep pace with Moore's law, chip designers have focused on increasing...

Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times

How should we schedule jobs to minimize mean queue length? In the preemp...

Fork-join and redundancy systems with heavy-tailed job sizes

We investigate the tail asymptotics of the response time distribution fo...

Queues with Small Advice

Motivated by recent work on scheduling with predicted job sizes, we cons...

Please sign up or login with your details

Forgot password? Click here to reset