Nonpriority Multiprogramming Systems Under Heavy Demand Conditions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Nonpriority Multiprogramming Systems Under Heavy Demand Conditions—Customers' Viewpoint

Full text

Pdf (336 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 3 (July 1972) table of contents

Pages: 445 - 452

Year of Publication: 1972

ISSN:0004-5411

Author

I. Mitrani

Computing Laboratory, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

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/321707.321715 What is a DOI?

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	ADIRI, I., AND AVI-ITzHAK, B. A time-sharing model with many queues. Mimeograph Series No. 20, Technion--Israel Inst. of Technol., Haifa, Israel, July 1968.
	2	Cox, D. R., AND SMITH, W.L. Queues. Methuen, London, 1961.
	3	FINE, G. H., AND MCISAAC, P.V. Simulation of a time-sharing system. Manag. Sci. 12 (Feb. 1966), 180-194.
	4	P. A. W. Lewis , G. S. Shedler, A Cyclic-Queue Model of System Overhead in Multiprogrammed Computer Systems, Journal of the ACM (JACM), v.18 n.2, p.199-220, April 1971 [doi>10.1145/321637.321642]
	5	LITTLE, J. D.C. A proof for the queueing formula L = ~W. Oper. Res. 9 (1961), 383-387.
	6	SAATY, T.L. Elements of Queueing Theory. McGraw-Hill, London, 1961.
	7	SMITH, J .L . An analysis of time-sharing computer systems using Markov models. Proc. AFIPS 1966 SJCC, Vol. 28, Spartan Books, New York, pp. 87-95.
	8	V. L. Wallace , D. L. Mason, Degree of multiprogramming in page-on-demand systems, Communications of the ACM, v.12 n.6, p.305-308, June 1969 [doi>10.1145/363011.363026]

CITED BY 6

	John Peterson , William Bulgren, Studies in Markov models of computer systems, Proceedings of the 1975 annual conference, p.102-107, January 1975
	Don M. Warner , Udo W. Pooch, Model of a multiprogrammed computer system with a multilevel memory hierarchy, Proceedings of the 1977 annual conference, p.351-357, January 1977
	K. C. Sevcik , I. Mitrani, The Distribution of Queuing Network States at Input and Output Instants, Journal of the ACM (JACM), v.28 n.2, p.358-371, April 1981
	Guy Latouche, Algorithmic Analysis of a Multiprogramming-Multiprocessor Computer System, Journal of the ACM (JACM), v.28 n.4, p.662-679, Oct. 1981
	Demetres D. Kouvatsos, A maximum entropy queue length distribution for the G/G/1 finite capacity queue, ACM SIGMETRICS Performance Evaluation Review, v.14 n.1, p.224-236, May 1986