Erol Gelenbe
Abstract
A new treatment of the boundary conditions of diffusion approximations for interconnected queueing systems is presented. The results have applications to the study of the performance of multiple-resource computer systems. In this approximation method, additional equations to represent the behavior of the queues when they are empty are introduced. This reduces the dependence of the model on heavy traffic assumptions and yields certain results which would be expected from queueing or renewal theory. The accuracy of the approach is evaluated by comparison with certain known exact or numerical results.
- 1 BHARUCHA-REID, A. T. Elements of the Theory of Markov Processes and Their Apphcat~ons. McGraw-Hill, New York, 1960.Google Scholar
- 2 FELLER, W. The parabolic differential equations and the associated semigroups of transformations. Ann. Math. 55 (1952), 468-519.Google Scholar
- 3 FELLER, W Diffusion processes in one dimension. Trans Amer. Math. Soc 77 (1954), 1-31.Google Scholar
- 4 FELLER, W. An Introduction to Probabzhty Theory and Its Applications, Vols. I, ti. Wiley, New York, 1966.Google Scholar
- 5 GAvE~t, D.P. Diffusion approximations and models for certain congestion problems J. Appl. Probab~l. g (1968), 607-623.Google Scholar
- 6 GAvEa, D. P., AND SnEDLER, G.S. Approximate models for processor utdization in multiprogrammed computer systems Res. Rep., Naval Postgraduate School, Monterey, Calif., Sept. 1972Google Scholar
- 7 GAVER, D. P , AND SI-IEDLER, G.S. Processor utilization in multlprogramming systems via diffusion approximations Oper. Res. 2I (1973), 569-576.Google Scholar
- 8 GELENBE, E. Modbles de syst~mes informatiques. Ph D. Th., Etat bs Sciences Math~matiques, U. de Paris, Paris, France, 1973.Google Scholar
- 9 I-IA~I, R, AND NEWELL, G, F. A relation between stationary queue and waiting time distributions. J. Appl. Probab,l. 8, 3 (1971), 617-620Google Scholar
- 10 JACKSON, J.R. Jobshop-like queueing systems. Manage Scz. 10 (1963), 131-142.Google Scholar
- 11 KOBAYAS~I, H. Application of the diffusion approximation to queueing networks I: Equilibrium queue distributions. J ACM 21, 2 (April 1974), 316-328. Google Scholar
- 12 NEWEL{,, G F. Apphcatwns of Queuemg Theory. Chapman and Hall, London, 1971.Google Scholar
- 13 REmEa, M., AND KO~AYAS~I, H Accuracy of the diffusion approximation for some queueing systems IBM J. Res Devel 18, 2 (March 1974), 110-124Google Scholar
- 14 S~EDLER, G.S. A cychc queue model of a paging machine. IBM Res. Rep. RC-2814, IBM Watson Res Center, Yorktown Heights, N Y., March 1970.Google Scholar
Index Terms
- On Approximate Computer System Models
Recommendations
Approximate Queuing Models for Multiprogramming Computer Systems
In a multiprogramming computer system several jobs may be handled simultaneously by utilizing the central processing unit in processing one job while other jobs are being served by the peripheral devices. Our analysis of such a computer system proceeds ...
Approximate blocking probabilities in loss models with independence and distribution assumptions relaxed
Effective approximations are developed for the blocking probability in a general stationary loss model, where key independence and exponential-distribution assumptions are relaxed, giving special attention to dependence among successive service times, ...
Markov-modulated finite-source queueing models in evaluation of computer and communication systems
The present paper deals with a first-come, first-served (FCFS) queueing model to analyze the behaviour of a heterogeneous finite-source system with a single server. The sources and the server are assumed to operate in independent Markovian environments, ...
Comments