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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service....
DL_POLY_3: new dimensions in molecular dynamics simulations via massive parallelism
DL_POLY_3 is a general-purpose massively parallel molecular dynamics simulation package \nembedding a highly efficient set of methods and algorithms such as: Domain Decompos...
Scalable Algorithms for Molecular Dynamics Simulations on Commodity Clusters
Although molecular dynamics (MD) simulations of biomolecular systems often run for days to months, many events of great scientific interest and pharmaceutical relevance occur on...
Dryad
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational "vertices" with communication "ch...
Multidirectional search: a direct search algorithm for parallel machines
In recent years there has been a great deal of interest in the development of optimization algorithms which exploit the computational power of parallel computer architectures. W...
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