Multiprogram scheduling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multiprogram scheduling: parts 1 and 2. introduction and theory

Full text

Pdf (502 KB)

Source

Communications of the ACM archive
Volume 3 , Issue 6 (June 1960) table of contents

Pages: 347 - 350

Year of Publication: 1960

ISSN:0001-0782

Author

E. F. Codd

IBM Corp., Poughkeepsie, NY

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references cited by 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/367297.367317 What is a DOI?

ABSTRACT

In order to exploit fully a fast computer which possesses simultaneous processing abilities, it should to a large extent schedule its own workload. The scheduling routine must be capable of extremely rapid execution if it is not to prove self-defeating. The construction of a schedule entails determining which programs are to be run concurrently and which sequentially with respect to each other. A concise scheduling algorithm is described which tends to minimize the time for executing the entire pending workload (or any subset of it), subject to external constraints such as precedence, urgency, etc. The algorithm is applicable to a wide class of machines.

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.

E. F. Codd , E. S. Lowry , E. McDonough , C. A. Scalzi, Multiprogramming STRETCH: feasibility considerations, Communications of the ACM, v.2 n.11, p.13-17, Nov. 1959 [doi>10.1145/368481.368502]

CITED BY 12

	L. A. Belady , C. J. Kuehner, Dynamic space-sharing in computer systems, Communications of the ACM, v.12 n.5, p.282-288, May 1969
	David F. Stevens, Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history, Communications of the ACM, v.11 n.8, p.539-541, Aug. 1968
	J. P. Penny , T. Pearcey, Use of multiprogramming in the design of a low cost digital computer, Communications of the ACM, v.5 n.9, p.473-476, Sept. 1962
	J. E. Kelley, Jr., Techniques for storage allocation algorithms, Communications of the ACM, v.4 n.10, p.449-454, Oct. 1961
	C. L. Liu , James W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, Readings in hardware/software co-design, Kluwer Academic Publishers, Norwell, MA, 2001
	Thomas Murray Cook, Schedule—constrained job scheduling in a multiprogrammed computer system, Proceedings of the 7th conference on Winter simulation, p.675-685, January 14-16, 1974, Washington, DC
	G. K. Manacher, Production and Stabilization of Real-Time Task Schedules, Journal of the ACM (JACM), v.14 n.3, p.439-465, July 1967
	R. J. Maher, Problems of storage allocation in a multiprocessor multiprogrammed system, Communications of the ACM, v.4 n.10, p.421-422, Oct. 1961
	Burnett H. Sams, On the solution of an information retrieval problem, Proceedings of the May 21-23, 1963, spring joint computer conference, May 21-23, 1963, Detroit, Michigan
	Fernando J. Corbató , Marjorie Merwin-Daggett , Robert C. Daley, An experimental time-sharing system, Proceedings of the May 1-3, 1962, spring joint computer conference, May 01-03, 1962, San Francisco, California
	A. J. Critcklow, Generalized multiprocessing and multiprogramming systems, Proceedings of the November 12-14, 1963, fall joint computer conference, November 12-14, 1963, Las Vegas, Nevada
	J. M. Keller , E. C. Strum , G. H. Yang, Remote computing--an experimental system: part 2: internal design, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.

Collaborative Colleagues:

E. F. Codd: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player