Abstract
AbstractExtending the results of Kruk (Queueing theory and network applications. QTNA 2019. Lecture notes in computer science, vol 11688. Springer, Cham, pp 263–275, 2019), we derive heavy traffic limit theorems for a single server, single customer class queue in which the server uses the Shortest Remaining Processing Time (SRPT) policy from heavy traffic limits for the corresponding Earliest Deadline First queueing systems. Our analysis allows for correlated customer inter-arrival and service times and heavy-tailed inter-arrival and service time distributions, as long as the corresponding stochastic primitive processes converge weakly to continuous limits under heavy traffic scaling. Our approach yields simple, concise justifications and new insights for SRPT heavy traffic limit theorems of Gromoll et al. (Stoch Syst 1(1):1–16, 2011). Corresponding results for the longest remaining processing time policy are also provided.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference28 articles.
1. Banerjee, S., Budhiraja, A., & Puha, A. L. (2020). Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions. arXiv: 2003.03655v1.
2. Bansal, N., & Harchol-Balter, M. (2001). Analysis of SRPT scheduling: Investigating unfairness. ACM Sigmetrics Performance Evaluation Review, 29, 279–290.
3. Bender, M., Chakrabarti, S., & Muthukrishnan, S. (1998). Flow and stretch metrics for scheduling continuous job streams. In proceedings of the 9th annual ACM-SIAM symposium on discrete algorithms.
4. Billingsley, P. (1999). Convergence of probability measures (2nd ed.). New York: Wiley.
5. Billingsley, P. (1986). Probability and measure (2nd ed.). New York: Wiley.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献