On Approximate Computer System Models

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On Approximate Computer System Models

Full text

Pdf (583 KB)

Source

Journal of the ACM (JACM) archive
Volume 22 , Issue 2 (April 1975) table of contents

Pages: 261 - 269

Year of Publication: 1975

ISSN:0004-5411

Author

Erol Gelenbe

Chaire d'Informatique de l'Université de Liège, Av des Tilleuls 59, Liège, Belgium and Institut de Recherche d'Informatique et d'Automatique, Rocquencourt, France

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 40, Citation Count: 20

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321879.321888 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BHARUCHA-REID, A. T. Elements of the Theory of Markov Processes and Their Apphcat~ons. McGraw-Hill, New York, 1960.
	2	FELLER, W. The parabolic differential equations and the associated semigroups of transformations. Ann. Math. 55 (1952), 468-519.
	3	FELLER, W Diffusion processes in one dimension. Trans Amer. Math. Soc 77 (1954), 1-31.
	4	FELLER, W. An Introduction to Probabzhty Theory and Its Applications, Vols. I, ti. Wiley, New York, 1966.
	5	GAvE~t, D.P. Diffusion approximations and models for certain congestion problems J. Appl. Probab~l. g (1968), 607-623.
	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. 1972
	7	GAVER, D. P , AND SI-IEDLER, G.S. Processor utilization in multlprogramming systems via diffusion approximations Oper. Res. 2I (1973), 569-576.
	8	GELENBE, E. Modbles de syst~mes informatiques. Ph D. Th., Etat bs Sciences Math~matiques, U. de Paris, Paris, France, 1973.
	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-620
	10	JACKSON, J.R. Jobshop-like queueing systems. Manage Scz. 10 (1963), 131-142.
	11	Hisashi Kobayashi, Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions, Journal of the ACM (JACM), v.21 n.2, p.316-328, April 1974 [doi>10.1145/321812.321827]
	12	NEWEL{,, G F. Apphcatwns of Queuemg Theory. Chapman and Hall, London, 1971.
	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-124
	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.

CITED BY 20

	Hark Hwang , Seongwoo Moon , Mitsuo Gen, An integrated model for the design of end-of-aisle order picking system and the determination of unit load sizes of AGVs, Computers and Industrial Engineering, v.42 n.2-4, p.249-258, June 2002
	K. Mani Chandy , Charles H. Sauer, Approximate Methods for Analyzing Queueing Network Models of Computing Systems, ACM Computing Surveys (CSUR), v.10 n.3, p.281-317, Sept. 1978
	Martin G. Kienzle , K. C. Sevcik, Survey of analytic queueing network models of computer systems, ACM SIGSIM Simulation Digest, v.11 n.1, p.113-129, Fall 1979
	E. Gelenbe , G. Pujolle, Probabilistic models of computer systems, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.118-125, March 29-31, 1976, Cambridge, Massachusetts, United States
	William J. Stewart , Gerald A. Zeiszler, On the existence of composite flow equivalent markovian servers, ACM SIGMETRICS Performance Evaluation Review, v.9 n.2, p.105-116, Summer 1980
	E. G. Coffman, Jr. , M. I. Reiman, Diffusion approximations for storage processes in computer systems, Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.93-117, August 29-31, 1983, Minneapolis, Minnesota, United States
	J. Labetoulle , G. Pujolle, A study of queueing networks with deterministic service and applications to computer networks, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.230-240, March 29-31, 1976, Cambridge, Massachusetts, United States
	J. C. Browne, A critical overview of computer performance evaluation, Proceedings of the 2nd international conference on Software engineering, p.138-145, October 13-15, 1976, San Francisco, California, United States
	J. MacGregor Smith, M/G/c/K blocking probability models and system performance, Performance Evaluation, v.52 n.4, p.237-267, May 2003
	Alexander Thomasian , Behzad Nadji, Aggregation of stations in queueing network models of multiprogrammed computers, ACM SIGMETRICS Performance Evaluation Review, v.10 n.3, p.86-104, Fall 1981
	Zinovi L. Krougly , David A. Stanford, Iterative algorithms for performance evaluation of closed network models, Performance Evaluation, v.61 n.1, p.41-64, June 2005
	I. F. Akyildiz , Albrecht Sieber, Approximate Analysis of Load Dependent General Queueing Networks, IEEE Transactions on Software Engineering, v.14 n.11, p.1537-1545, November 1988
	Raymond A. Marie , Patricia M. Snyder , William J. Stewart, Extensions and computational aspects of an iterative method, ACM SIGMETRICS Performance Evaluation Review, v.11 n.4, December 1982
	Tuna Güven , Richard J. La , Mark A. Shayman , Bobby Bhattacharjee, Measurement-based optimal routing on overlay architectures for unicast sessions, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.50 n.12, p.1938-1951, 24 August 2006
	F. R. B. Cruz , A. R. Duarte , T. van Woensel, Buffer allocation in general single-server queueing networks, Computers and Operations Research, v.35 n.11, p.3581-3598, November, 2008
	Dawn S. L. Dolcy , Costas C. Constantinou , Steven F. Quigley, A Fokker-Planck equation method predicting Buffer occupancy in a single queue, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.8, p.2198-2216, June, 2007
	Erol Gelenbe, A diffusion model for packet travel time in a random multihop medium, ACM Transactions on Sensor Networks (TOSN), v.3 n.2, p.10-es, June 2007
	K. Mani Chandy, Models of distributed systems, Proceedings of the third international conference on Very large data bases, p.105-120, October 06-08, 1977, Tokyo, Japan
	Tadeusz Czachórski , Jean-Michel Fourneau , Tomasz Nycz , Ferhan Pekergin, Diffusion Approximation Model of Multiserver Stations with Losses, Electronic Notes in Theoretical Computer Science (ENTCS), 232, p.125-143, March, 2009
	Horst Zisgen, A diffusion approximation for batch queues of type GX/G(b,b)/1, Performance Evaluation, v.66 n.9-10, p.557-563, September, 2009