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.
Keywords
Computer scienceWorkloadExploitScheduling (production processes)ScheduleDistributed computingParallel computingDynamic priority schedulingProcessor schedulingReal-time computingMathematical optimizationOperating systemMathematics
Affiliated Institutions
Related Publications
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Directed diffusion
Advances in processor, memory and radio technology will enable small and cheap nodes capable of sensing, communication and computation. Networks of such nodes can coordinate to ...
A Database-Centric Virtual Chemistry System
We describe an Oracle database application for general use within virtual chemistry. The application functions as a central hub and repository for chemical data with interfaces ...
Computational intelligence PC tools
Computational intelligence is an emerging field in computer science which combines fuzzy logic, neural networks, and genetic algorithms for a flexible yet powerful approach to s...
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. ...
Publication Info
- Year
- 1960
- Type
- article
- Volume
- 3
- Issue
- 6
- Pages
- 347-350
- Citations
- 40
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
40
OpenAlex
Cite This
E. F. Codd
(1960).
Multiprogram scheduling.
Communications of the ACM
, 3
(6)
, 347-350.
https://doi.org/10.1145/367297.367317
Identifiers
- DOI
- 10.1145/367297.367317