Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Brown (1960)
Statistical forecasting for inventory control, 123
(1969)
Dynamic calculation of dispatching priorities under OS/360 MVT
Paul Cheng (1969)
Trace-Driven System ModelingIBM Syst. J., 8
F. Baskett, J. Browne, W. Raike (1899)
The management of a multi-level non-paged memory system
Controlled experiments on the resource utilization on the multi - processor , multiprogrammed computer system
W. Wulf (1969)
Performance monitors for multi-programming systems
(1970)
Syst. Note-12
D. Stevens (1968)
Operating Systems: On overcoming high-priority paralysis in multiprogramming systemsCommunications of the ACM, 11
F. Baskett (1970)
Mathematical models of multiprogrammed computer systems
A. Scherr (1965)
AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS
G. Bryan (1967)
JOSS: 20,000 hours at a console: a statistical summary
Tad Pinkerton (1969)
Performance monitoring in a time-sharing systemCommun. ACM, 12
(1970)
These authors pungently draw attention to the need for controlled experimental studies
Keith Ryder (1970)
A Heuristic Approach to Task DispatchingIBM Syst. J., 9
J. Saltzer, J. Gintell (1969)
The instrumentation of multics
J. Schwetman (1970)
A study of resource utilization and performance evaluation of large-scalecomputer systems
Microscopic level job stream data obtained in a production environment by an event-driven software probe is used to drive a model of a multiprogramming computer system. The CPU scheduling algorithm of the model is systematically varied. This technique, called trace-driven modeling, provides an accurate replica of a production environment for the testing of variations in the system. At the same time alterations in scheduling methods can be easily carried out in a controlled way with cause and effects relationships being isolated. The scheduling methods tested included the best possible and worst possible methods, the traditional methods of multiprogramming theory, round-robin, first-come-first-served, etc., and dynamic predictors. The relative and absolute performances of these scheduling methods are given. It is concluded that a successful CPU scheduling method must be preemptive and must prevent a given job from holding the CPU for too long a period.
Communications of the ACM – Association for Computing Machinery
Published: Dec 1, 1972
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.