The design of the UNIX operating system
The design of the UNIX operating system
Performance of a software MPEG video decoder
MULTIMEDIA '93 Proceedings of the first ACM international conference on Multimedia
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
The design and implementation of the 4.4BSD operating system
The design and implementation of the 4.4BSD operating system
Exploiting process lifetime distributions for dynamic load balancing
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A hierarchial CPU scheduler for multimedia operating systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
The design, implementation and evaluation of SMART: a scheduler for multimedia applications
Proceedings of the sixteenth ACM symposium on Operating systems principles
CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Predicting MPEG execution times
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A Framework-Based Approach to the Development of Network-Aware Applications
IEEE Transactions on Software Engineering
ETI resource distributor: guaranteed resource allocation and scheduling in multimedia systems
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Architecture of a networked image search and retrieval system
Proceedings of the eighth international conference on Information and knowledge management
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Communications of the ACM
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Issues ofReserving Resources in Advance
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks
Dynamic Server Selection using Bandwidth Probing in Wide-Area Networks
Stride Scheduling: Deterministic Proportional- Share Resource Management
Stride Scheduling: Deterministic Proportional- Share Resource Management
Operating system resource reservation for real-time and multimedia applications
Operating system resource reservation for real-time and multimedia applications
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
A middleware for autonomic QoS management based on learning
SEM '05 Proceedings of the 5th international workshop on Software engineering and middleware
Modeling distributed applications for qos management
SEM'04 Proceedings of the 4th international conference on Software Engineering and Middleware
| Hi-index | 0.00 |
The benefits of QoS network features are easily lost when the endnodes are managed by a conventional, best-effort operating system. Schedulers of such operating systems provide only rudimentary tools (like priority adjustment) for processor management. We present here a simple extension to a processor management system that allows an application to reserve a share of the processor for a specified interval. The system is targeted at applications with frequently changing resource demands or recurring, though non-periodic resource requests. An example of such an application is a network-aware image search and retrieval system, but other network-aware client-server applications also fall into the same category. The admission control component of the processor management system decides if a resource request can be satisfied. To limit the amount of time spent negotiating with the operating system, the application can present a ranked list of acceptable reservations. The admission controller then picks the best request that can still be satisfied (using the Simplex linear programming algorithm to find the best solution). If there are insufficient resources, the application must deal with the shortage. Any possible adaptation (if the accepted request was not the application's first choice) is left to the application. The processor management system has been implemented for NetBSD and been ported to Linux, and the paper includes an evaluation of its effectiveness. The overhead is low, and although reservations are not guaranteed, in practical settings the application almost always obtains the cycles requested