A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems

Full text

Pdf (709 KB)

Source

Journal of the ACM (JACM) archive
Volume 17 , Issue 1 (January 1970) table of contents

Pages: 131 - 145

Year of Publication: 1970

ISSN:0004-5411

Author

Philip J. Rasch

Recognition Equipment, Inc., Dallas, Texas and Texas Instruments Inc., Dallas, Texas

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 72, Citation Count: 8

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/321556.321569 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	Philip John Rasch, A queueing theory study of time-shared computer systems, 1967
	2	B. Krishnamoorthi , Roger C. Wood, Time-Shared Computer Operations With Both Interarrival and Service Times Exponential, Journal of the ACM (JACM), v.13 n.3, p.317-338, July 1966 [doi>10.1145/321341.321342]
	3	GnEEN~Ea~ER, M. The priority problem and computer time sharing. Manage. Sci. 12 (July 1966), 886-906.
	4	ScHmtR, A. L. An Analysis of Time-Shared Computer Systems. MIT Press, Cambridge, Mass., 1967.
	5	TAKXCS, L. Introduction to the Theory of Queues. Oxford U. Press, New York, 1962.
	6	Leonard Kleinrock, Time-shared Systems: a theoretical treatment, Journal of the ACM (JACM), v.14 n.2, p.242-261, April 1967 [doi>10.1145/321386.321388]
	7	I)RABHt:, N. Queues and Inventories. Wiley, New York, 1965.
	8	MORSE, P. Queues, Inventories and Maintenance. Wiley, New York, 1958.
	9	THOMAS, G. B. Calculus and Analytic Geometry. Addison-Wesley, Reading, Mass., 1956, p. 569.

CITED BY 8

	John Peterson , William Bulgren, Studies in Markov models of computer systems, Proceedings of the 1975 annual conference, p.102-107, January 1975
	J. Blatny , S. R. Clark , T. A. Rourke, On the optimization of performance of time-sharing systems by simulation, Communications of the ACM, v.15 n.6, p.411-420, June 1972
	Harry C. Heacox, Jr. , Paul W. Purdom, Jr., Analysis of Two Time-Sharing Queueing Models, Journal of the ACM (JACM), v.19 n.1, p.70-91, Jan. 1972
	S. R. Clark , T. A. Rourke, A simulation study of cost of delays in computer systems, Proceedings of the fourth annual conference on Applications of simulation, p.195-200, December 09-11, 1970, New York, New York, United States
	N. S. Losapio , William G. Bulgren, Simulation of dispatching algorithms in a multiprogramming environment, Proceedings of the ACM annual conference, p.903-913, August 01-01, 1972, Boston, Massachusetts, United States
	Thomas E. Reeves , Udo W. Pooch, A multiple subsystem simulator of processor scheduling, Proceedings of the 3rd symposium on Simulation of computer systems, p.129-138, August 12-14, 1975, Boulder, Colorado, United States
	James W. McGuffee , R. Andrew Cabezas, Starvation-proof priority round-robin queues for time-sharing systems, Journal of Computing Sciences in Colleges, v.21 n.4, p.253-258, April 2006
	M. A. Sencer , C. L. Sheng, An analysis of multiprogrammed time-sharing computer systems, Proceedings of the June 4-8, 1973, national computer conference and exposition, June 04-08, 1973, New York, New York