Affiliation:
1. Carnegie Mellon University, Pittsburgh, PA, USA
2. Simons Institute, UC Berkeley, Carnegie Mellon University, & Cornell University, Berkeley, CA, USA
Abstract
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.
Funder
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Safety, Risk, Reliability and Quality,Computer Science (miscellaneous)
Reference43 articles.
1. Timothy G. Armstrong , Zhao Zhang , Daniel S. Katz , Michael Wilde , and Ian T. Foster . 2010. Scheduling many-task workloads on supercomputers: Dealing with trailing tasks . In 2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers. 1--10 . Timothy G. Armstrong, Zhao Zhang, Daniel S. Katz, Michael Wilde, and Ian T. Foster. 2010. Scheduling many-task workloads on supercomputers: Dealing with trailing tasks. In 2010 3rd Workshop on Many-Task Computing on Grids and Supercomputers. 1--10.
2. Edward Arthurs and Joseph S. Kaufman . 1979. Sizing a message store subject to blocking criteria . In Proceedings of the third international symposium on modelling and performance evaluation of computer systems: Performance of computer systems. 547--564 . Edward Arthurs and Joseph S. Kaufman. 1979. Sizing a message store subject to blocking criteria. In Proceedings of the third international symposium on modelling and performance evaluation of computer systems: Performance of computer systems. 547--564.
3. Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
4. One Can Only Gain by Replacing EASY Backfilling: A Simple Scheduling Policies Case Study
5. A model for moldable supercomputer jobs
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献