IEEE Transactions on Parallel and Distributed Systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
A hierarchial CPU scheduler for multimedia operating systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
The Strict Time Lower Bound and Optimal Schedules for Parallel Prefix with Resource Constraints
IEEE Transactions on Computers
On Parallelization of Static Scheduling Algorithms
IEEE Transactions on Software Engineering
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
Operating System Concepts
Operating System Support for Coexistence of Real-Time and Conventional Scheduling
Operating System Support for Coexistence of Real-Time and Conventional Scheduling
Processor Capacity Reserves for Multimedia Operating Systems
Processor Capacity Reserves for Multimedia Operating Systems
A Soft Real Time Scheduling Server in UNIX Operating System
A Soft Real Time Scheduling Server in UNIX Operating System
Stride Scheduling: Deterministic Proportional- Share Resource Management
Stride Scheduling: Deterministic Proportional- Share Resource Management
| Hi-index | 0.00 |
Traditional operating systems control the execution of programs regardless of how often they are run. This raises the question: can't the often run or the often used programs provide better performance if an operating system had an ability to optimize their execution behavior based on a knowledge the operating system had obtained from their previous execution(s)? In this paper, we integrate this ability into a part of an operating system called a process scheduler and examine its cost and benefit. Our initial evaluations show that the cost involved in our scheduler is small and the processing time can be reduced by using this scheduler.