Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

SRPT for Multiserver Systems

Published: 25 January 2019 Publication History

Abstract

The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results are known for single-server SRPT, much less is known for multiserver SRPT. In particular, stochastic analysis of the M/G/k under SRPT is entirely open. Intuition suggests that multiserver SRPT should be optimal or near-optimal for minimizing mean response time. However, the only known analysis of multiserver SRPT is in the worst-case adversarial setting, where SRPT can be far from optimal. In this paper, we give the first stochastic analysis bounding mean response time of the M/G/k under SRPT. Using our response time bound, we show that multiserver SRPT has asymptotically optimal mean response time in the heavy-traffic limit. The key to our bounds is a strategic combination of stochastic and worst-case techniques. Beyond SRPT, we prove similar response time bounds and optimality results for several other multiserver scheduling policies. This article is an introduction to our longer paper, [1].

References

[1]
Grosof, I., Scully, Z., and Harchol-Balter, M. SRPT for multiserver systems. In IFIP Performance Conference 2018 (Tolouse, France, December 2018).
[2]
Leonardi, S., and Raz, D. Approximating total ow time on parallel machines. In Proceedings of the twenty- ninth annual ACM symposium on Theory of computing (1997), ACM, pp. 110{119.
[3]
Lin, M., Wierman, A., and Zwart, B. Heavy-traffic analysis of mean response time under shortest remain- ing processing time. Performance Evaluation (2011).
[4]
Nuyens, M., and Wierman, A. The foreground{ background queue: a survey. Performance evaluation 65, 3--4 (2008), 286{307.
[5]
Righter, R., and Shanthikumar, J. G. Scheduling multiclass single server queueing systems to stochas- tically maximize the number of successful departures. Probability in the Engineering and Informational Sci- ences 3, 3 (1989), 323{333.
[6]
Schrage, L. Letter to the editor-a proof of the opti- mality of the shortest remaining processing time disci- pline. Operations Research 16, 3 (1968), 687{690.
[7]
Schrage, L. E., and Miller, L. W. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research 14, 4 (1966), 670{684.
[8]
Wierman, A., and Harchol-Balter, M. Classify- ing scheduling policies with respect to unfairness in an M/GI/1. In ACM SIGMETRICS Performance Evalua- tion Review (2003), ACM, pp. 238{249.
[9]
Wierman, A., Harchol-Balter, M., and Osogami, T. Nearly insensitive bounds on smart scheduling. In ACM SIGMETRICS Performance Evaluation Review (2005), ACM, pp. 205{216.

Cited By

View all
  • (2023)Response Time Prediction of M/M/1SRPT Queuing System Using Simulation Modeling and Artificial Intelligence2023 Eighth International Conference on Informatics and Computing (ICIC)10.1109/ICIC60109.2023.10381919(1-5)Online publication date: 8-Dec-2023
  • (2021)SRPT-based Congestion Control for Flows with Unknown Sizes2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472780(1-9)Online publication date: 21-Jun-2021
  • (2019)SRPT for Multiserver SystemsACM SIGMETRICS Performance Evaluation Review10.1145/3308897.330890246:3(8-9)Online publication date: 25-Jan-2019

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 46, Issue 3
December 2018
174 pages
ISSN:0163-5999
DOI:10.1145/3308897
Issue’s Table of Contents
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 January 2019
Published in SIGMETRICS Volume 46, Issue 3

Check for updates

Author Tags

  1. foreground background (fb)
  2. heavy traffic
  3. m/g/k
  4. preemptive shortest job first (psjf)
  5. response time bound
  6. shortest remaining processing time (srpt)

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Response Time Prediction of M/M/1SRPT Queuing System Using Simulation Modeling and Artificial Intelligence2023 Eighth International Conference on Informatics and Computing (ICIC)10.1109/ICIC60109.2023.10381919(1-5)Online publication date: 8-Dec-2023
  • (2021)SRPT-based Congestion Control for Flows with Unknown Sizes2021 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking52078.2021.9472780(1-9)Online publication date: 21-Jun-2021
  • (2019)SRPT for Multiserver SystemsACM SIGMETRICS Performance Evaluation Review10.1145/3308897.330890246:3(8-9)Online publication date: 25-Jan-2019

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media