Analysis of Two Time-Sharing Queueing Models

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Analysis of Two Time-Sharing Queueing Models

Full text

Pdf (921 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 1 (January 1972) table of contents

Pages: 70 - 91

Year of Publication: 1972

ISSN:0004-5411

Authors

Harry C. Heacox, Jr.	Space Astronomy Laboratory, University of Wisconsin and Computer Sciences Department, University of Wisconsin, Madison, Wisconsin
Paul W. Purdom, Jr.	Mathematics Department, Indiana University and Computer Sciences Department, University of Wisconsin, Madison, Wisconsin

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/321679.321686 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	E. G. Coffman, Jr., Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping, Journal of the ACM (JACM), v.15 n.3, p.341-353, July 1968 [doi>10.1145/321466.321467]
	2	SAATY, T.L. Elements of Queueing Theory. McGraw-Hill, New York, 1961.
	3	Philip J. Rasch, A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems, Journal of the ACM (JACM), v.17 n.1, p.131-145, Jan. 1970 [doi>10.1145/321556.321569]
	4	Edward G. Coffman , Leonard Kleinrock, Feedback Queueing Models for Time-Shared Systems, Journal of the ACM (JACM), v.15 n.4, p.549-576, Oct. 1968 [doi>10.1145/321479.321483]
	5	Igal Adiri, Computer Time-Sharing Queues with Priorities, Journal of the ACM (JACM), v.16 n.4, p.631-645, Oct. 1969 [doi>10.1145/321541.321552]
	6	SCHRAGE, L.E. Some queueing models for a time-sharing facility. Ph.D. thesis, Cornel} University, Ithaca, N. Y. (Feb. 1961).
	7	APOSTOL, T.M. Mathematical Analysis. Addison-Wesley, Reading, Mass., 1957.
	8	LITTLE, J. D.C. A proof for the queueing formula L = XW. Oper. Res. 9, 3 (1961), 383-387.

CITED BY 2

	D. Potier , E. Gelenbe , J. Lenfant, Adaptive Allocation of Central Processing Unit Quanta, Journal of the ACM (JACM), v.23 n.1, p.97-102, Jan. 1976
	U. Narayan Bhat , Richard E. Nance, An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation, Journal of the ACM (JACM), v.26 n.4, p.761-778, Oct. 1979