By Topic

Better real-time response for time-share scheduling

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)
Banachowski, S.A. ; Comput. Sci. Dept., California Univ., Santa Cruz, CA, USA ; Brandt, S.A.

As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CPU schedulers derived from time-share algorithms; because they are based on best-effort policies, these general-purpose systems provide little support for real-time constraints. This paper describes BeRate, a scheduler that integrates best-effort and soft real-time processing using a best-effort programming model in which soft real-time application parameters are inferred from runtime behavior. We show that with no a prior! information about applications, BeRate outperforms Linux when scheduling workloads containing soft real-time applications.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003