Synthesis of a Feedback Queueing Discipline for Computer Operation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Synthesis of a Feedback Queueing Discipline for Computer Operation

Full text

Pdf (774 KB)

Source

Journal of the ACM (JACM) archive
Volume 21 , Issue 2 (April 1974) table of contents

Pages: 329 - 339

Year of Publication: 1974

ISSN:0004-5411

Authors

J. A. Michel	Mathematics Department, United States Air Force Academy, Colorado Springs, Colorado
E. G. Coffman, Jr.	Computer Science Department, The Pennsylvania State University, University Park, Pennsylvania

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/321812.321828 What is a DOI?

ABSTRACT

Considerable effort has been invested in devising and analyzing sequencing rules for multiprogrammed or time-shared systems. A much studied discipline of this kind is the so-called system with feedback to lower priority queues. This discipline contains many parameters, in general, which must be fixed in order to achieve the desired waiting-time performance of the discipline. In this paper the problem of synthesizing a system of the above type is solved, by setting parameter values so that prespecified waiting time criteria are satisfied, assuming Poisson arrival and general service time parameters are known.

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	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]
	2	CORBATO, F. J., DAGGETT, M. M.~ AND DALEY, R. C. An experimental time-sharing system. Proc. AFIPS 1962 SJCC, Vol. 21, Spartan Books, New York, pp. 335-344.
	3	Jerome Alan Michel, Synthesis of priority queueing systems, 1972
	4	MUNTZ, R. R. Waiting time distribution for round-robin queueing systems. Proc. Symp. on Computer-Communications, Networks, and Teletraffic, Microwave Research Inst., Polytechnic Institute of Brooklyn, April 1972, pp. 429-439.
	5	SCHRAGE, L. E. The M/G/1 queue with feedback to lower priority queues. Manage. Sci. 13 (1967), 466-474.
	6	VAN DEN HEEVER, R. Computer Time Sharing Priority Systems. Tech. Rep. ORC 69-22 (Ph.D. Thesis), Operations Research Center, University of California at Berkeley, Aug. 1969.

CITED BY 3

	E. G. Coffman, Jr. , I. Mitrani, Selecting a scheduling rule that meets pre-specified response time demands, ACM SIGOPS Operating Systems Review, v.9 n.5, p.187-191, November 1975
	Manfred Ruschitzka, The Performance of Job Classes with Distinct Policy Functions, Journal of the ACM (JACM), v.29 n.2, p.514-526, April 1982
	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