Abstract
The services received by a process from a time-sharing operating system can be characterized by a resource count ∑ w i R ij where R ij is the number of units of service received by process j from resource i and w i is the cost per unit of the service. Each class of users can be characterized by a policy function which specifies the amount of service a user who belongs to this class should receive as a function of time. Priority changes dynamically as a function of the difference between the service promised to the user by the policy function and the service he actually receives. A scheduling and swapping algorithm which keeps the resource count of each process above its policy function will provide the specified level of service. Overhead can be reduced by avoiding swaps of processes which have received at least this level of service. The algorithm has been implemented in a general purpose operating system, and it has provided significantly better service to interactive and to batch jobs than the previous scheduler.
Keywords
Computer scienceScheduling (production processes)Shared resourceService (business)Time-sharingOverhead (engineering)Function (biology)Operating systemBusinessOperations managementEngineering
Affiliated Institutions
Related Publications
The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid
The Computational Grid is a promising platform for the efficient execution of parameter sweep applications over large parameter spaces. To achieve performance on the Grid, such ...
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service....
TSAaaS: Time Series Analytics as a Service on IoT
In recent years, the evolving of IoT (Internet of Things) has resulted in the deployment of massive numbers of sensors in various fields, such as the Energy and Utility (E&U) in...
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
“Grid” computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applicatio...
A national-scale authentication infrastructure
Participants in virtual organizations commonly need to share resources such as data archives, computer cycles, and networks, resources usually available only with restrictions b...
Publication Info
- Year
- 1971
- Type
- article
- Volume
- 14
- Issue
- 2
- Pages
- 74-78
- Citations
- 33
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
33
OpenAlex
Cite This
A. J. Bernstein,
J.C. Sharp
(1971).
A policy-driven scheduler for a time-sharing system.
Communications of the ACM
, 14
(2)
, 74-78.
https://doi.org/10.1145/362515.362520
Identifiers
- DOI
- 10.1145/362515.362520