Correction to: Multi-server queueing systems with multiple priority classes (Queueing Systems, (2005), 51, 3-4, (331-360), 10.1007/s11134-005-2898-7);Multi-server queueing systems with multiple priority classes

Queueing Systems

Volumn 51, Issue 3-4 SPEC. ISS., 2005, Pages 331-360

  Harchol Balter, Mor ^a   Osogami, Takayuki ^a   Scheller Wolf, Alan ^b   Wierman, Adam ^a  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Busy periods; M GI k; M PH k; Matrix analytic methods; Multi class queue; Multi server queue; Preemptive priority; Priority queue; Server farm

Indexed keywords

DIMENSIONALITY REDUCTION; MARKOV CHAINS; QUEUEING NETWORKS; QUEUEING THEORY; STOCHASTIC SYSTEMS;

BUSY PERIOD; M/GI/K; M/PH/K; MATRIX ANALYTIC METHODS; MULTI-CLASS QUEUE; MULTI-SERVER QUEUE; PREEMPTIVE PRIORITY; PRIORITY QUEUES; SERVER FARMS;

NETWORK ARCHITECTURE;

EID: 29144441410     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-021-09710-1     Document Type: Erratum

References (30)

1. D. Bertsimas and D. Nakazato, The distributional Little's Law and its applications, Operations Research 43(2) (1995) 298-310.
2. A. Bondi and J. Buzen, The response times of priority classes under preemptive resume in M/G/m queues, in: ACM Sigmetrics, (August 1984) pp. 195-201.
3. L. Bright and P. Taylor, Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes, Stochastic Models 11 (1995) 497-514.
4. J. Buzen and A. Bondi, The response times of priority classes under preemptive resume in M/M/m queues, Operations Research 31 (1983) 456-465.
5. A. Cobham, Priority assignment in waiting line problems. Operations Research 2 (1954) 70-76.
6. R. Davis, Waiting-time distribution of a multi-server, priority queueing system, Operations Research 14 (1966) 133-136.
7. W. Feng, M. Kowada and K. Adachi, Analysis of a multiserver queue with two priority classes and (M,N)-threshold service schedule ii: preemptive priority, Asia-Pacific Journal of Operations Research 18 (2001) 101-124.
8. H. Gail, S. Hantler, and B. Taylor, Analysis of a non-preemptive priority multiserver queue. Advances in Applied Probability 20 (1988) 852-879.
9. H. Gail, S. Hantler and B. Taylor, On a preemptive Markovian queue with multiple servers and two priority classes, Mathematics of Operations Research 17 (1992) 365-391.
10. R. Jain, The Art of Computer Systems Performance Analysis (John Wiley and Sons, 1991).
11. E. Kao and K. Narayanan, Modeling a multiprocessor system with preemptive priorities, Management Science 2 (1991) 185-197.
12. E. Kao and S. Wilson, Analysis of nonpreemptive priority queues with multiple servers and two priority classes, European Journal of Operational Research 118 (1999) 181-193.
13. E.P.C. Kao and K.S. Narayanan, Computing steady-state probabilities of a nonpreemptive priority multiserver queue, Journal on Computing 2(3) (1990) 211-218.
14. A. Kapadia, M. Kazumi and A. Mitchell, Analysis of a finite capacity nonpreemptive priority queue, Computers and Operations Research 11 (1984) 337-343.
15. O. Kella and U. Yechiali, Waiting times in the non-preemptive priority M/M/c queue, Stochastic Models 1 (1985) 257-262.
16. G. Latouche and V. Ramaswami, Introduction to Matrix Analytic Methods in Stochastic Modeling (ASA-SIAM, 1999).
17. H. Leemans, The Two-Class Two-Server Queue with Nonpreemptive Heterogeneous Priority Structures. PhD thesis, K.U.Leuven, 1998.
18. D. McWherter, B. Schroeder, N. Ailamaki and M. Harchol-Balter, Priority mechanisms for OLTP and transactional web applications, in: Proceedings of the 20th International Conference on Data Engineering (ICDE 2004) (2004) pp. 535-546.
19. D. Miller, Steady-state algorithmic analysis of M/M/c two-priority queues with heterogeneous servers, in: Applied probability - Computer science, The Interface, eds., R.L. Disney and T.J. Ott, volume II, (Birkhauser, 1992), pp. 207-222.
20. I. Mitrani and P. King, Multiprocessor systems with preemptive priorities, Performance Evaluation 1 (1981) 118-125.
21. M. Neuts, Moment formulas for the Markov renewal branching process, Advances in Applied Probabilities 8 (1978) 690-711.
22. B. Ngo and H. Lee, Analysis of a pre-emptive priority M/M/c model with two types of customers and restriction, Electronics Letters 26 (1990) 1190-1192.
23. T. Nishida, Approximate analysis for heterogeneous multiprocessor systems with priority jobs, Performance Evaluation 15 (1992) 77-88.
24. T. Osogami, Analysis of multiserver systems via dimensionality reduction of Markov chains, Ph.D. thesis. School of Computer Science, Carnegie Mellon University (2005).
25. T. Osogami and M. Harchol-Balter, A closed-form solution for mapping general distributions to minimal PH distributions, in: Performance TOOLS (2003) pp. 200-217.
26. T. Osogami, M. Harchol-Balter and A. Scheller-Wolf, Analysis of cycle stealing with switching costs and thresholds, Performance Evaluation 61(4) (2005) 347-369.
27. A. Sleptchenko, Multi-class, multi-server queues with non-preemptive priorities. Technical Report 2003-016, EURANDOM, Eindhoven University of Technology, 2003.
28. A. Sleptchenko, A. van Harten and M. van der Heijden, An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities, Queueing Systems 50 (2005) 81-107.
29. W. Whitt, A review of L = λW and extensions, Queueing Systems 9 (1991) 235-268.
30. A. Wierman, T. Osogami, M. Harchol-B alter and A. Scheller-Wolf, How many servers are best in a dual-priority M/PH/k system, Unpublished Manuscript. In submission, 2005.