Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

The implementation of hierarchical schedulers in the RED-Linux scheduling framework

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)
Yu-Chung Wang ; Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA ; Kwei-Jay Lin

Hierarchical schedulers are useful to integrate different scheduling paradigms together. The original RED-Linux general scheduling framework does not support hierarchical schedulers efficiently because the dispatcher cannot tell whether a job is an aperiodic job or a real-time job. In the work reported in this paper, we add an extra parameter, the group number, to the RED-Linux scheduling framework in order to identify the type of jobs. This mechanism does not introduce any overhead to normal real-time tasks and only a constant overhead per job for hierarchical jobs. We discuss how to implement hierarchical schedulers and how to use this extension to support sporadic schedulers. We also discuss various versions of the sporadic server algorithm

Published in:

Real-Time Systems, 2000. Euromicro RTS 2000. 12th Euromicro Conference on

Date of Conference:

2000