A Dynamic Time-Sharing Priority Queue

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Dynamic Time-Sharing Priority Queue

Full text

Pdf (459 KB)

Source

Journal of the ACM (JACM) archive
Volume 18 , Issue 4 (October 1971) table of contents

Pages: 603 - 610

Year of Publication: 1971

ISSN:0004-5411

Author

Igal Adiri

IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 18, Citation Count: 6

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/321662.321675 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	KLEINROCK, L. Analysis of time-shared processor. Naval Res. Logist. Quart. 2, 1 (1964)' 59-73.
	2	ADIRI, I ., AND AVI-ITZHAK, B. A time-sharing queue. Manag. Sci. 15, 11 (1969), 639-657.
	3	J. M. McKinney, A Survey of Analytical Time-Sharing Models, ACM Computing Surveys (CSUR), v.1 n.2, p.105-116, June 1969 [doi>10.1145/356546.356549]
	4	SCHRAGE, L.E. The queue M { G } 1 with feedback to lower priority queues. Manag. Sci. 13 (1967), 466-474.
	5	Jack E. Shemer, Some Mathematical Considerations of Time-Sharing Scheduling Algorithms, Journal of the ACM (JACM), v.14 n.2, p.262-272, April 1967 [doi>10.1145/321386.321389]
	6	ADIRI, I ., AND AVI-ITZHAK, B. A time-sharing model with many queues. Oper. Res. 17, 6 (1969), 1077-1089.
	7	COBHAM, A. Priority assignment in waiting time problems. Oper. Res. 2, 1 (1954), 70-76.
	8	TAKACS, L. Introduction to the Theory of Queues. Oxford U. Press, New York, 1962.
	9	WELCH, P.D. On a generalized M I G I 1 queueing process in which the first customer of each busy period received exceptional service. Oper. Res. 12, 5 (1964), 736-752.
	10	LITTLE, J. D.C. A proof of the queueing formula L = kW. Oper. Res. 9, 3 (1961), 383-387.

CITED BY 6

	Z. Rosberg , I. Adiri, Multilevel Queues with Extremal Priorities, Journal of the ACM (JACM), v.23 n.4, p.680-690, Oct. 1976
	Jair M. Babad, A Generalized Multi-Entrance Time-Sharing Priority Queue, Journal of the ACM (JACM), v.22 n.2, p.231-247, April 1975
	Jane W. S. Liu , J. M. Milner, Probabilistic models of inverted file information retrieval systems, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.25-37, March 29-31, 1976, Cambridge, Massachusetts, United States
	Jun Kiniwa , Toshio Hamada , Daisuke Mizoguchi, Lookahead Scheduling Requests for Multisize Page Caching, IEEE Transactions on Computers, v.50 n.9, p.972-983, September 2001
	S. Haldar , D. K. Subramanian, Fairness in processor scheduling in time sharing systems, ACM SIGOPS Operating Systems Review, v.25 n.1, p.4-18, Jan. 1991
	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