Approximate Solution of Queueing Networks with Simultaneous Resource Possession

Queueing networks are important as Performance models of computer and communication systems because the performance of these systems is usually principally affected by contention for resources. Exact numerical solution of a queueing network is usually only feasible if the network has a product form solution in the sense of Jackson. An important network characteristic which apparently precludes a product form solution is simultaneous resource possession, e.g., a job holds memory and processor simultaneously. This paper extends previous methods for approximate numerical solution of queueing networks with homogeneous jobs and simultaneous resource possession to networks with heterogeneous jobs and simultaneous resource possession.

[1]  R. M. Brown.  Analytic Model of a Large Scale Interactive System Including the Effects OfFinite Main Memory , 1974 .

[2]  Pierre-Jacques Courtois,et al.  Decomposability, instabilities, and saturation in multiprogramming systems , 1975, CACM.

[3]  C. H. Sauer,et al.  Sequential stopping rules for the regenerative method of simulation , 1977 .

[4]  Charles H. Sauer,et al.  Queueing network software for systems modelling , 1979, Softw. Pract. Exp..

[5]  K. Mani Chandy,et al.  Approximate Methods for Analyzing Queueing Network Models of Computing Systems , 1978, CSUR.

[6]  K. Mani Chandy,et al.  Approximate Solution of Queueing Models , 1980, Computer.

[7]  Edward D. Lazowska,et al.  The method of surrogate delays: Simultaneous resource possession in analytic models of computer systems , 1981, SIGMETRICS '81.

[8]  Charles H. Sauer.  Numerical solution of some multiple chain queueing networks , 1981, PERV.

[9]  Yonathan Bard.  An Analytic Model of the VM/370 System , 1978, IBM J. Res. Dev..

[10]  Charles H. Sauer,et al.  Computational algorithms for state-dependent queueing networks , 1983, TOCS.

[11]  Jr. Thomas Walter Keller,et al.  Computer system models with passive resources. , 1976 .

[12]  K. Mani Chandy,et al.  Solution of Queuing Problems by a Recursive Technique , 1975, IBM J. Res. Dev..

[13]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[14]  K. Mani Chandy,et al.  Computational algorithms for product form queueing networks , 1980, Performance.

[15]  William J. Stewart,et al.  A comparison of numerical techniques in Markov modeling , 1978, CACM.

[16]  Donald F. Towsley,et al.  Queuing Network Models with State-Dependent Routing , 1980, JACM.

[17]  K. Mani Chandy,et al.  Memory management and response time , 1977, CACM.

[18]  B. R. Newsom.  Effects of Finite Memory on the Performance of a Large Scale Multiprogrammed Batch Computer System , 1979, Int. CMG Conference.

[19]  Donald F. Towsley,et al.  Product Form and Local Balance in Queueing Networks , 1977, JACM.

[20]  Alexandre Brandwajn.  An Iterative Solution of Two-Dimensional Birth and Death Processes , 1979, Oper. Res..

[21]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[22]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[23]  Charles H. Sauer,et al.  A Language for Extended Queuing Network Models , 1980, IBM J. Res. Dev..

[24]  K. Mani Chandy,et al.  Parametric Analysis of Queuing Networks , 1975, IBM J. Res. Dev..