A comparative analysis of disk scheduling policies
Communications of the ACM
Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system
Communications of the ACM
A policy-driven scheduler for a time-sharing system
Communications of the ACM
Operating Systems: On overcoming high-priority paralysis in multiprogramming systems: a case history
Communications of the ACM
Operating Systems Theory
A large-scale dual operating system
ACM '73 Proceedings of the ACM annual conference
Multi-queue scheduling of two tasks
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Trace driven modeling: Review and overview
ANSS '73 Proceedings of the 1st symposium on Simulation of computer systems
ANSS '74 Proceedings of the 2nd symposium on Simulation of computer systems
Resource demanded paging and dispatching to optimize resource utilization in an operating system
SIGME '73 Proceedings of the 1973 ACM SIGME symposium
A process-oriented model of resource demands in large, multiprocessing computer utilities
A process-oriented model of resource demands in large, multiprocessing computer utilities
Trace-driven modeling studies of the performance of computer systems
Trace-driven modeling studies of the performance of computer systems
A study of feedback coupled resource allocation policies in a multi-processing computer environment.
A study of feedback coupled resource allocation policies in a multi-processing computer environment.
A method for adaptive performance improvement of operating systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
| Hi-index | 48.22 |
Model studies of some integrated, feedback-driven scheduling systems for multiprogrammed-multiprocessor computer systems are presented. The basic control variables used are the data-flow rates for the processes executing on the CPU. The model systems feature simulated continuous-flow and preempt-resume scheduling of input-output activity. Attention is given to the amount of memory resource required for effective processing of the I/O activity (buffer space assignment). The model studies used both distribution-driven and trace-driven techniques. Even relatively simple dynamic schedulers are shown to improve system performance (as measured by user CPU time) over that given by optimal or near-optimal static schedulers imbedded in identical system structures and workload environments. The improvement is greatest under a heavy I/O demand workload.