Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)

Volumn 22, Issue 2, 1975, Pages 248-260

  Baskett, Forest ^a   Chandy, K Mani ^b   Muntz, Richard R ^c   Palacios, Fernando G ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Markov processes; multiprogramming; networks of queues; processor sharing; queuemg theory; theory of queues; time sharing

Indexed keywords

PROBABILITY - QUEUEING THEORY;

LAPLACE TRANSFORMS; MARKOV PROCESSES;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0016495143     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321879.321887     Document Type: Article

References (18)

1. Baskett, F The dependence of computer system queues upon processing time distribution and central processor scheduling. Proc ACM-SIGOPS Third Symposium on Operating System Principles, Stanford U., Stanford, Calif., Oct. 1971, pp. 109-113.
2. BASKETT, F., and Palacios, F. G. Processor sharing in a central server queueing model of multiprogramming with applications. Proc. Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton U, Princeton, N J. March 1972, pp. 598-603.
3. BUZEN, J. Queueing network models of multiprogramming. Ph.D. Th., Div. of Eng. and Appl. Sci., Harvard. U., Cambridge, Mass, 1971.
4. BUZEN, J. Analysis of system bottlenecks usinga queueing network model. Proc. ACM-SIGOPS Workshop on System Performance Evaluation, April 1971, pp. 82-103.
5. Chandy, K. M. The analysis and solutions for general queueing networks Proc. Sixth Annual Princeton Conference on Information Sciences and Systems, Princeton U., Princeton, N.J., March 1972, pp. 224-228.
6. Chandy, K M., Keller, T. W., and Browne, J. C. Design automation and queueing networks: An interactive system for the evaluation of computer queueing models Proc. Ninth Annual Design Automation Workshop, Dallas, Tex., June 1972, pp 151-153.
7. Cox, D. R. A use of complex probabilities the theory of stochastic processes. Proc. Cambridge Phil. Soc. 51 (1955), 313-319.
8. Feller, W. An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed Wiley, New York, 1968.
9. Ferdinand, A. E. An analysis of the machine interference model IBM Syst. J. 10, 2 (1971), 129-142.
10. Gordon, W. J., and Newell, G. F. Closed queueing systems with exponential servers Oper Res 15 (1967), 254-265.
11. Jackson, J. R. Jobshop-like queueing systems Manage. Sci 10, 1 (Oct 1963), 131-142.
12. LAVENBERG, S. S. Queueing analysis of a multlprogramIned computer system aving a multilevel storage hierarchy. SIAM J Comput 2, 4 (1973), 232-252.
13. Moore, C. G., III Network models for large-scale time-sharing systems Tech. Rep. No. 71-1, Dep. of Ind Eng, U of Michigan, Ann Arbor, Mich., April 1971.
14. Palacios, F. G. An analytic model of a multiprogramming system including a job mix Rep TR-4, Dep. of Computer Sciences, U. of Texas at Austin, Austin, Tex., June 1972.
15. Posner, M., and Bernholtz, B. Closed finite queueing networks with time lags and with several classes of units Oper Res. 16 (1968), 977-985.
16. Sakata, M., Noguchi, S., and Oizdmi, J. Analysis of a processor-shared queueing model for time-sharing systems Proc Second Hawaii International Conference on System Sciences, U. of Hawaii, Honolulu, Hawaii, Jan 1969, pp 625-628.
17. Whittle, P. Nonlinear migration processes. Internat. Statist Inst Bull 42, Bk. 1 (1969), 642-647.
18. Whittle, P. Equilibrium distributions for an open migration process. J Appl. Probabil. 6 (1968), 567-571.