Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping
Journal of the ACM (JACM)
Feedback Queueing Models for Time-Shared Systems
Journal of the ACM (JACM)
A Survey of Analytical Time-Sharing Models
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A policy-driven scheduler for a time-sharing system
Communications of the ACM
The working set model for program behavior
Communications of the ACM
The Performance of Job Classes with Distinct Policy Functions
Journal of the ACM (JACM)
Improved instruction formation in the exhaustive local microcode compaction algorithm
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
SWAP: a scheduler with automatic process dependency detection
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Adaptive disk scheduling with workload-dependent anticipation intervals
Journal of Systems and Software
Embedded hard real-time scheduling algorithm based on task's resource requirement
International Journal of High Performance Computing and Networking
| Hi-index | 48.22 |
This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of