How many servers are best in a dual-priority M / PH / k system?

Performance Evaluation

Volumn 63, Issue 12, 2006, Pages 1253-1272

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

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Busy period; Dimensionality reduction; M PH k; Multiserver; Preemptive; Priority; Queueing; Scheduling

Indexed keywords

FUNCTION EVALUATION; JOB ANALYSIS; QUALITY OF SERVICE;

DIMENSIONALITY REDUCTION; M / PH / K; MULTISERVERS; PREEMPTIVE;

SERVERS;

EID: 33748708195     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.12.004     Document Type: Article

References (30)

1. A. Bondi, J. Buzen, The response times of priority classes under preemptive resume in M/G/m queues, in: Proceedings of ACM Sigmetrics, August 1984, pp. 195-201
2. Bright L., and Taylor P. Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes. Stochastic Models 11 (1995) 497-514
3. Buzen J., and Bondi A. The response times of priority classes under preemptive resume in M/M/m queues. Operations Research 31 (1983) 456-465
4. Calabrese J. Optimal workload allocation in open queueing networks in multiserver queues. Management Science 38 (1992) 1792-1802
5. Chao X., and Scott C. Several results on the design of queueing systems. Operations Research 48 (2000) 965-970
6. Davis R. Waiting-time distribution of a multi-server, priority queueing system. Operations Research 14 (1966) 133-136
7. Feng W., Kowada M., and Adachi K. 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. Gail H., Hantler S., and Taylor B. Analysis of a non-preemptive priority multiserver queue. Advances in Applied Probability 20 (1988) 852-879
9. Gail H., Hantler S., and Taylor B. On a preemptive Markovian queues with multiple servers and two priority classes. Mathematics of Operations Research 17 (1992) 365-391
10. Harchol-Balter M., Osogami T., Scheller-Wolf A., and Wierman A. Multi-server queueing systems with multiple priority classes. Queueing Systems 51 3-4 (2005) 331-360
11. Kao E., and Narayanan K. Computing steady-state probabilities of a nonpreemptive priority multiserver queue. Journal on Computing 2 (1990) 211-218
12. Kao E., and Narayanan K. Modeling a multiprocessor system with preemptive priorities. Management Science 2 (1991) 185-197
13. Kao E., and Wilson S. Analysis of nonpreemptive priority queues with multiple servers and two priority classes. European Journal of Operational Research 118 (1999) 181-193
14. Kapadia A., Kazumi M., and Mitchell A. Analysis of a finite capacity nonpreemptive priority queue. Computers and Operations Research 11 (1984) 337-343
15. Latouche G., and Ramaswami V. Introduction to Matrix Analytic Methods in Stochastic Modeling (1999), ASA-SIAM, Philadelphia
16. H. Leemans, The two-class two-server queue with nonpreemptive heterogeneous priority structures, Ph.D. Thesis, K.U. Leuven, 1998
17. Mandelbaum A., and Reiman M. On pooling in queueing networks. Management Science 44 (1998) 971-981
18. Miller D. Steady-state algorithmic analysis of M/M/c two-priority queues with heterogeneous servers. In: Disney R.L., and Ott T.J. (Eds). Applied Probability - Computer Science. The Interface vol. II (1992), Birkhauser 207-222
19. Mitrani I., and King P. Multiprocessor systems with preemptive priorities. Performance Evaluation 1 (1981) 118-125
20. Morse P. Queues, Inventories, and Maintenance (1958), John Wiley and Sons
21. Neuts M. Moment formulas for the Markov renewal branching process. Advances in Applied Probabilities 8 (1978) 690-711
22. Ngo B., and Lee H. Analysis of a pre-emptive priority M/M/c model with two types of customers and restriction. Electronics Letters 26 (1990) 1190-1192
23. Nishida T. Approximate analysis for heterogeneous multiprocessor systems with priority jobs. Performance Evaluation 15 (1992) 77-88
24. T. Osogami, Analysis of multi-server systems via dimensionality reduction of Markov chains, Ph.D. Thesis, Computer Science Department, Carnegie Mellon University, 2005
25. Osogami T., Harchol-Balter M., and Scheller-Wolf A. Analysis of cycle stealing with switching costs and thresholds. Performance Evaluation 61 4 (2005) 347-369
26. Psounis K., Molinero-Fernandez P., Prabhakar B., and Papadopoulos F. Systems with multiple servers under heavy-tailed workloads. Performance Evaluation 62 (2005) 456-474
27. Scheller-Wolf A. Necessary and sufficient conditions for delay moments in FIFO multiserver queues with an application comparing s slow servers with one fast one. Operations Research 51 (2003) 748-758
28. Shahkar G., and Tareghian H. Designing a production line through optimization of M/G/c using simulation. Mathematical Engineering in Industry 8 (2001) 123-126
29. Sleptchenko A., van Harten A., and van der Heijden M. An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities. Queueing Systems, Theory and Applications 50 1 (2005) 81-107
30. Stidham S. On the optimality of single-server queueing systems. Operations Research 18 (1970) 708-732