| Research |
| [ CSI ] [ ETH ] |
[ Lab Manager ]
| [ Publications ] [ Research Opportunities ] [ Partners & Supporters ] [ Earlier Work ] |
|
Manging Resource Reservations and Admission Control for Adaptive Applications |
| Hans Domjan, Thomas Gross, Manging Resource Reservations and Admission Control for Adaptive Applications, Proceedings of the 30th International Conference on Parallel Processing, Valencia, Spain, September 3--7 2001, September 2001. [ICPP_2001.pdf ICPP_2001.ps] |
| An important class of adaptive applications can trade off one kind of resources (e.g., network bandwidth) for requests of other resources (e.g., CPU cycles). They create new challenges for operating systems: their processor demands change rapidly based on external factors, and resource requests are recurring, though non-periodic. However, these applications share some of the characteristics of ``soft real-time'' tasks and are often resilient with regard to un- or under-availability of resources. This paper presents a comprehensive approach to processor management for adaptive applications, the R-Scheduler. It co-exists with a best-effort scheduler and has been implemented for NetBSD and ported to Linux. The runtime costs of admission control and scheduling are modest (below 1%). For realistic usage scenarios, the R-Scheduler allows the application to meet its time limits, whereas the traditional (default) best-effort scheduling discipline fails to allocate the CPU resources effectively. Keywords: Processor Scheduling, Operating Systems, Resource Management, Adaptive Applications, Network-Aware Applications. |
| [ Publications ] [ Research Opportunities ] [ Partners & Supporters ] [ Earlier Work ] |