Some Mathematical Considerations of Time-Sharing Scheduling Algorithms
Journal of the ACM (JACM)
Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping
Journal of the ACM (JACM)
Resource management for a medium scale time-sharing operating system
Communications of the ACM
An Evaluation of CPU Efficiency Under Dynamic Quantum Allocation
Journal of the ACM (JACM)
Preemption costs in round robin scheduling
ACM '78 Proceedings of the 1978 annual conference - Volume 2
A Computer Resource Allocation Model with Some Measured and Simulation Results
IEEE Transactions on Computers
Hi-index | 48.23 |
A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists.