The design of the UNIX operating system
The design of the UNIX operating system
Communications of the ACM
The KornShell command and programming language
The KornShell command and programming language
A policy-driven scheduler for a time-sharing system
Communications of the ACM
An experimental investigation of scheduling strategies for UNIX
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
An analysis of decay-usage scheduling in multiprocessors
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Decay-usage scheduling in multiprocessors
ACM Transactions on Computer Systems (TOCS)
Progress-based regulation of low-importance processes
Proceedings of the seventeenth ACM symposium on Operating systems principles
Implicit coscheduling: coordinated scheduling with implicit information in distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed Job Scheduling in SCI Local-Area MultiProcessors
HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
An object-oriented framework for modular resource management
IWOOOS '96 Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96)
User-Driven Scheduling of Interactive Virtual Machines
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Implementing lottery scheduling: matching the specializations in traditional schedulers
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Cooperative cache partitioning for chip multiprocessors
Proceedings of the 21st annual international conference on Supercomputing
Comparison of the three CPU schedulers in Xen
ACM SIGMETRICS Performance Evaluation Review
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
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
The hybrid scheduling framework for virtual machine systems
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
A randomized scheduler with probabilistic guarantees of finding bugs
Proceedings of the fifteenth edition of ASPLOS on Architectural support for programming languages and operating systems
Design and implementation of a generic resource sharing virtual time dispatcher
Proceedings of the 3rd Annual Haifa Experimental Systems Conference
QoS and resource management in distributed interactive multimedia environments
Multimedia Tools and Applications
| Hi-index | 0.00 |
Decay usage scheduling is a priority- and usage-based approach to CPU allocation in which preference is given to processes that have consumed little CPU in the recent past. The author develops an analytic model for decay usage schedulers running compute-bound workloads, such as those found in many engineering and scientific environments; the model is validated from measurements of a Unix system. This model is used in two ways. First, ways to parameterize decay usage schedulers are studied to achieve a wide range of service rates. Doing so requires a fine granularity of control and a large range of control. The results show that, for a fixed representation of process priorities a larger range of control makes the granularity of control coarser, and a finer granularity of control decreases the range of control. A second use of the analytic model is to construct a low overhead algorithms for achieving service rate objectives. Existing approaches require adding a feedback loop to the scheduler. This overhead is avoided by exploiting the feedback already present in decay usage schedulers. Using both empirical and analytical techniques, it is shown that the algorithm is effective and that it provides fairness when the system is over- or under-loaded.