A scheduling philosophy for multiprocessing systems
Communications of the ACM
Further experimental data on the behavior of programs in a paging environment
Communications of the ACM
Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history
Communications of the ACM
Multiprogram scheduling: parts 3 and 4. scheduling algorithm and external constraints
Communications of the ACM
Efficiency vs responsiveness in a multiple-services computer facility
ACM '68 Proceedings of the 1968 23rd ACM national conference
Dynamic program behavior under paging
ACM '66 Proceedings of the 1966 21st national conference
An analysis of time-sharing computer systems using Markov models
AFIPS '66 (Spring) Proceedings of the April 26-28, 1966, Spring joint computer conference
Considerations in block-oriented systems design
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Experience using a time-shared multi-programming system with dynamic address relocation hardware
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
An approach to the simulation of a time-sharing system
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
JOSS: 20,000 hours at a console: a statistical summary
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Computer scheduling methods and their countermeasures
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Multiprogramming, swapping and program residence priority in the FACOM 230-60
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Program behavior in a paging environment
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
| Hi-index | 0.00 |
Fundamental considerations in time and space scheduling for time-sharing systems are reviewed. Workload components are classified as trivial and nontrivial foreground, and background. Each has certain resource-use and required response properties. A central issue in scheduling is the degree of advance knowledge available to the scheduler about calls on system resources. This provides a theme for classifying several algorithms. A response figure of merit believed to be helpful in understanding time-sharing schedulers is defined. Simulation results using a very simple workload and system model are included in the discussion. A summary is given of some major issues in scheduling for time-sharing and virtual systems.