The design of the UNIX operating system
The design of the UNIX operating system
Communications of the ACM
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Journal of the ACM (JACM)
The magic garden explained: the internals of UNIX System V Release 4: an open systems design
The magic garden explained: the internals of UNIX System V Release 4: an open systems design
UNIX internals: the new frontiers
UNIX internals: the new frontiers
The design and implementation of the 4.4BSD operating system
The design and implementation of the 4.4BSD operating system
Time-shared Systems: a theoretical treatment
Journal of the ACM (JACM)
Sharing a Processor Among Many Job Classes
Journal of the ACM (JACM)
Achieving Service Rate Objectives with Decay Usage Scheduling
IEEE Transactions on Software Engineering
Stride Scheduling: Deterministic Proportional- Share Resource Management
Stride Scheduling: Deterministic Proportional- Share Resource Management
Earliest Eligible Virtual Deadline First : A Flexible and Accurate Mechanism for Proportional Share Resource Allocation
Proportional-share scheduling in single-server and multiple-server computing systems
ACM SIGMETRICS Performance Evaluation Review
User-Driven Scheduling of Interactive Virtual Machines
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Design and implementation of a generic resource sharing virtual time dispatcher
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
On-line fair allocations based on bottlenecks and global priorities
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
| Hi-index | 0.00 |
Decay-usage scheduling is a priority-aging time-sharing scheduling policy capable of dealing with a workload of both interactive and batch jobs by decreasing the priority of a job when it acquires CPU time, and by increasing its priority when it does not use the (a) CPU. In this article we deal with a decay-usage scheduling policy in multiprocessors modeled after widely used systems. The priority of a job consists of a base priority and a time-dependent component based on processor usage. Because t he priorities in our model are time dependent, a queuing-theoretic analysis—for instance, for the mean job response time—seems impossible. Still, it turns out that as a consequence of the scheduling policy, the shares of the available CPU time obtained by jobs converge, and a deterministic analysis for these shares is feasible: We show how for a fixed set of jobs with large processing demands, the steady-state shares can be obtained given the base priorities, and conversely, how to set the base priorities given the required shares. In addition, we analyze the relation between the values of the scheduler parameters and the level of control it can exercise over the steady-state share ratios, and we deal with the rate of convergence. We validate the model by simulations and by measurements of actual systems.