Proportional Share Scheduling of Operating System Services for Real-Time Applications
نویسندگان
چکیده
While there is currently great interest in the problem of providing real-time services in general purpose operating systems, the issue of real-time scheduling of internal operating system activities has received relatively little attention. Without such real-time scheduling, the system is susceptible to conditions such as receive livelock — a situation in which an operating system spends all its time processing arriving network packets, and application processes, even if scheduled with a real-time scheduler, are starved. We investigate the problem of scheduling operating system activities such as network protocol processing in a proportional share manner. We describe a proportional share implementation of the FreeBSD operating system and demonstrate that it solves the receive livelock problem. Packets are processed within the operating system only at the cumulative rate at which the destination applications are prepared to receive them. If packets arrive at a faster rate then they are discarded after consuming minimal system resources. In this manner the performance of “well behaved” applications is unaffected by “misbehaving” applications. We demonstrate this effect by running a set of multimedia applications under a variety of network conditions on a set of increasingly sophisticated proportional share implementations of FreeBSD and comparing their performance. This work contributes to our knowledge of the engineering of proportional share real-time systems.
منابع مشابه
A comparative study of the realization of rate-based computing services in general purpose operating systems
Scheduling architectures that support a rate abstraction are becoming increasingly popular for realizing real-time services in general-purpose operating systems. While many rate-based schemes have been proposed, there has been little discussion of the relative merits of each approach. We study the performance of a set of multimedia applications under three different rate-based scheduling scheme...
متن کاملSome Guidelines for Proportional Share CPU Scheduling in General-Purpose Operating Systems
Our premise is that since there already exists a large, mature body of literature on real-time scheduling in general-purpose operating systems, it is time to spend more effort deciding which of these algorithms should be used and when, and less effort on generating new algorithms. In this paper we focus on proportional share schedulers. We introduce the notion of pessimism—the proportion of ove...
متن کاملThe Design of SMART: A Scheduler for Multimedia Applications
We have created SMART, a Scheduler for Multimedia And Real-Time applications. SMART supports both real-time and conventional computations and provides flexible and accurate control over the sharing of processor time. SMART is able to satisfy real-time constraints in an optimal manner and provide proportional sharing across all real-time and conventional tasks. Furthermore, when not all real-tim...
متن کاملOn the Duality between Resource Reservation and Proportional Share Resource Allocation
We describe a new framework for resource allocation that unifies the well-known proportional share and resource reservation policies. Each client is characterized by two parameters: a weight that represents the rate at which the client “pays” for the resource, and a share that represents the fraction of the resource that the client should receive. A fixed rate corresponds to a proportional shar...
متن کاملOn the Duality between Resource Reservation and ProportionalShare Resource
We describe a new framework for resource allocation that uniies the well-known proportional share and resource reservation policies. Each client is characterized by two parameters: a weight that represents the rate at which the client \pays" for the resource, and a share that represents the fraction of the resource that the client should receive. A xed rate corresponds to a proportional share a...
متن کامل