Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system

Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system

Loading next page...
 
/lp/association-for-computing-machinery/trace-driven-modeling-and-analysis-of-cpu-scheduling-in-a-P7Eu6uXswW

References (16)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1972 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/361598.361626
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Dec 1, 1972

There are no references for this article.