Multi-queue scheduling of two tasks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multi-queue scheduling of two tasks

Full text

Pdf (333 KB)

Source

Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation table of contents

Cambridge, Massachusetts, United States

Pages: 102 - 108

Year of Publication: 1976

Author

Jeffrey R. Spirn

Sponsors

IFIP WG 7.3 : IFIP WG 7.3
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/800200.806186 What is a DOI?

ABSTRACT

A class of schedules in the two customer central server queueing model, consisting of a “CPU” server and m “I/O” servers, is considered. Optimal (maximal CPU utilization) CPU and I/O schedules are obtained. The best CPU schedule depends on the I/O schedule in effect; and is either Longest or Shortest-Expected-Remaining-Processing-Time-First. However, for certain I/O schedules the CPU schedule is immaterial. The best I/O schedule is always to process the (expected) longer CPU customer first.

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	K. M. Chandy, "The analysis and solutions for general queueing networks", Proc. 6th Princeton Conference on Information Sciences and Systems, Princeton, N. J. (March 1972).
	2	Forest Baskett , K. Mani Chandy , Richard R. Muntz , Fernando G. Palacios, Open, Closed, and Mixed Networks of Queues with Different Classes of Customers, Journal of the ACM (JACM), v.22 n.2, p.248-260, April 1975 [doi>10.1145/321879.321887]
	3	L. Schrage, "A proof of the optimality of the shortest remaining processing time discipline", Operations Research 16, 3 (May 1968), pp. 687-690.
	4	Thomas G. Price, An analysis of central processor scheduling in multiprogrammed computer systems (digest edition)., Stanford University, Stanford, CA, 1972
	5	J. P. Buzen, "Queueing network models of multiprogramming", (Ph.D. Thesis) Division of Eng. and Appl. Science, Harvard University (May 1971).
	6	J. Spirn, "A model for dynamic allocation in a paging machine", Proc. 8th Princeton Conf. On Information Sciences and Systems, Princeton, N. J. (March 1974).