Preemption costs in round robin scheduling

Authors:
Charles M. Shub
Affiliations:
-
Venue:
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Year:
1978

Citing 6
Cited 0

A Generalized Multi-Entrance Time-Sharing Priority Queue

Journal of the ACM (JACM)
Trace-driven modeling and analysis of CPU scheduling in a multiprogramming system

Communications of the ACM
A processor allocation method for time-sharing

Communications of the ACM
A policy-driven scheduler for a time-sharing system

Communications of the ACM
System Simulation

System Simulation
Operating Systems Theory

Operating Systems Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Round robin scheduling with preemption costs taken into consideration is examined. Both a uniprocessor configuration and a multiprocessor configuration, one processor dedicated to the scheduling, are considered. Approximation formulae to obtain effective load on the system from the actual load and the overhead parameters are derived and compared with simulation results.