By Topic

A comparative study of the realization of rate-based computing services in general purpose operating systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jeffay, K. ; Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA ; Lamastra, G.

Scheduling architectures that support a late 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 late-based scheduling schemes implemented in the FreeBSD operating system: a proportional share scheme (Earliest Eligible Virtual Deadline First scheduling), a polling, server-based scheme (the Constant Bandwidth Server), and a rate-based extension to the original Liu and Layland task model (Rate-Based Execution). Furthermore, we consider three specific scheduling problems: scheduling application level tasks, scheduling system calls, and scheduling the kernel-level processing of data input from devices such as network interfaces. Based on empirical evidence, we conclude that “one size does not fit all”-that no one rate-based resource allocation scheme suffices for all scheduling problems along the data path from the device to an application. Rather, we achieve the best performance for our multimedia workload when we apply different rate-based scheduling policies at different layers of the operating system such as proportional share scheduling of system calls and application tasks, and rate-based Liu and Layland scheduling of device processing

Published in:

Real-Time Computing Systems and Applications, 2000. Proceedings. Seventh International Conference on

Date of Conference:

2000