Determination of the conditional response for quantum allocation algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Determination of the conditional response for quantum allocation algorithms

Full text

Pdf (639 KB)

Source

Journal of the ACM (JACM) archive
Volume 29 , Issue 2 (April 1982) table of contents

Pages: 448 - 460

Year of Publication: 1982

ISSN:0004-5411

Author

Theodore Brown

Department of Computer Science, Queens College of the City of New York, Flushing, NY

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references index terms

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/322307.322318 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	BROWN, T. M/G/I rouad robin discipline. Comput. 22, 3 (1979), 225-242
	2	Chua,, Y S., AtCD Bmu~s~m, AJ. Analysis of a feedback scheduler. SlAM ~ Comput. 3, 3 (Sept. 1974), 159-176.
	3	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]
	4	CONWAY, R.W., ~, W.L, AND Mr~.r.mL L.W.Reading, Mass., 1967. Theory of Scheduling. Addison-Wesley,
	5	Cox, D.R.Renewal Theory. Methuen, London, 1962.
	6	Germund Dahlquist , Ake Bjorck, Numerical Methods, Dover Publications, Incorporated, 2003
	7	F~L~, W. An Introduction to Probabdity Theory and Its Applications, vol I, 3rd ed. Wiley, New York, 1968.
	8	FISHXR, M.J. Amdysis and des~ of loop service systems via a diffmton approximation, Oper. Res. 25, 2 (1977), 269-278.
	9	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]
	10	KLEIUROCK, L.Queueing Systems, Vol l: Theory; Vol II: Computer Applications. Wiley, New York, 1975, 1976.
	11	M~, R.R. Waiting time dismbution for muad-robia queuing systems. Syrup. oa Computer. Communications Networks and Tel~traffic, Brooklyn, New York, April 1972.
	12	O'DoNov~, T.M. Conditioned response times in M/M/! processor-sharing models. Oper. Res. 23 (1976), 382-385.
	13	Z. Rosberg , I. Adiri, Multilevel Queues with Extremal Priorities, Journal of the ACM (JACM), v.23 n.4, p.680-690, Oct. 1976 [doi>10.1145/321978.321986]
	14	S~TA, M., Nc,3ucm, S., ~D OIzum, J.An analysis of the M/G/I queue under round-robin schedufing. Oper. Res. 19, (1971), 371-385.
	15	SCHtxOE, L.E. The queue M/G/I with feedback to lower priority queues. Manage. Sci. 13, 7 (March 1967), 466--474.
	16	T~cs, L.Introduction to the Theory of Queues. Oxford University Press, New York, 1962.
	17	WOLFF, R.W.Tune sharing wath priorities. SIAM J. Appl. Math. 19, 3 (Nov. 1970), 566-574.