Some criteria for time-sharing system performance
Communications of the ACM
Process control and communication
SOSP '69 Proceedings of the second symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The Performance of Job Classes with Distinct Policy Functions
Journal of the ACM (JACM)
Third Generation Computer Systems
ACM Computing Surveys (CSUR)
Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system
Communications of the ACM
A unifying approach to scheduling
Communications of the ACM
Scheduling algorithms for multiprogramming in a hard-real-time environment
Readings in hardware/software co-design
Achieving Service Rate Objectives with Decay Usage Scheduling
IEEE Transactions on Software Engineering
An adaptive microscheduler for a multiprogrammed computer system
ACM '73 Proceedings of the ACM annual conference
Simulation of dispatching algorithms in a multiprogramming environment
ACM '72 Proceedings of the ACM annual conference - Volume 2
Policy/mechanism separation in Hydra
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
ANSS '74 Proceedings of the 2nd symposium on Simulation of computer systems
An adaptive policy driven scheduler
SIGMETRICS '74 Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation
Preemption costs in round robin scheduling
ACM '78 Proceedings of the 1978 annual conference - Volume 2
A performance measurement and system evaluation project plan proposal
ACM SIGMETRICS Performance Evaluation Review
ACM SIGSIM Simulation Digest
Aspects of a Dynamically Adaptive Operating System
IEEE Transactions on Computers
Laboratory automation at General Electric Corporate Research and Development
AFIPS '71 (Fall) Proceedings of the November 16-18, 1971, fall joint computer conference
Balancing processor shares of scheduling classes through controlled allocation of memory
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
The OS/VS2 release 2 system resources manager
IBM Systems Journal
Experimental study of deadline scheduling for interactive systems
IBM Journal of Research and Development
| Hi-index | 48.25 |
The services received by a process from a time-sharing operating system can be characterized by a resource count ∑ wiRij where Rij is the number of units of service received by process j from resource i and wi 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.