Multiprogramming STRETCH: feasibility considerations
Communications of the ACM
Production and Stabilization of Real-Time Task Schedules
Journal of the ACM (JACM)
Dynamic space-sharing in computer systems
Communications of the ACM
Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history
Communications of the ACM
Problems of storage allocation in a multiprocessor multiprogrammed system
Communications of the ACM
Techniques for storage allocation algorithms
Communications of the ACM
Use of multiprogramming in the design of a low cost digital computer
Communications of the ACM
Scheduling algorithms for multiprogramming in a hard-real-time environment
Readings in hardware/software co-design
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
An experimental time-sharing system
AIEE-IRE '62 (Spring) Proceedings of the May 1-3, 1962, spring joint computer conference
On the solution of an information retrieval problem
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
Generalized multiprocessing and multiprogramming systems
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Remote computing--an experimental system: part 2: internal design
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
| Hi-index | 48.30 |
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.