By Topic

Rate monotonic scheduling of real-time control systems with the minimum number of priority levels

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
$33 $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

4 Author(s)
R. Cayssials ; Univ. Nacional del Sur, Bahia Blanca, Argentina ; J. Orozco ; J. Santos ; R. Santos

When applying the Rate Monotonic discipline to schedule a set of periodic preemptible real-time tasks, the scheduler may be able to distinguish only a limited number of priority levels. This is common in control applications using low cost embedded controllers. If the number of tasks to be scheduled is larger than the number of distinguishable levels, the set of tasks must be partitioned in a set of priority classes. RM can be used only to arbitrate conflicts between tasks of different classes. In this paper a method to determine the minimum number of priority levels necessary to schedule the set of tasks is formally proved and its complexity analysed. Finally, a systematic method to obtain all the possible partitions with the minimum number of classes, resembling the Quine's method to minimize Boolean functions, is also given

Published in:

Real-Time Systems, 1999. Proceedings of the 11th Euromicro Conference on

Date of Conference: