Multiprogram scheduling: parts 1 and 2. introduction and theory
Communications of the ACM
Effects of job loading policies for multiprogramming systems in processing a job stream
ACM Transactions on Computer Systems (TOCS)
Optimality of scheduling policy for processing a job stream
ACM Transactions on Computer Systems (TOCS)
Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system
Communications of the ACM
Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system
Communications of the ACM
Sensitivity of predictive scheduling
ANSS '75 Proceedings of the 3rd symposium on Simulation of computer systems
Trace driven modeling and analysis of CPU scheduling in a multi-programming system
Proceedings of the SIGOPS workshop on System performance evaluation
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
Some experiments in simulating OS/360 from performance data
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
Performance monitors for multi-programming systems
SOSP '69 Proceedings of the second symposium on Operating systems principles
Sensitivity of predictive scheduling
ACM SIGSIM Simulation Digest
Keyword access to a mass storage device at the record level
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Aspects of a Dynamically Adaptive Operating System
IEEE Transactions on Computers
Performance determination: the selection of tools, if any
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Some principles of time-sharing scheduler strategies
IBM Systems Journal
| Hi-index | 48.25 |
High-priority paralysis is the degradation that can occur in multiprogramming systems when scheduling is based primarily on preassigned priorities. It can be alleviated by modifying the scheduling algorithm to maximize the number of programs active at one time. The case history given in this paper indicates two general methods by which simultaneity can be increased. Possible refinements in the scheduling algorithm for future improvements are considered briefly.