By Topic

Scheduling in a hard real-time system with shared resources

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

2 Author(s)
P. Martineau ; Nantes Univ., France ; M. Silly

Hard real-time systems are those systems in which correctness depends on logical results of the computations as well as the times at which these results are produced. In a real-time context, concurrency control protocols for shared resources (as databases) must not only maintain the consistency constraints but also satisfy timing requirements of transactions. So, several protocols have been proposed to prevent priority inversion. All these protocols, including the Priority Ceiling Protocol and the Stack-Based Resource Allocation Policy were initially designed to be used with the Rate Monotonic algorithm. We have implemented these protocols with their original scheduler, Rate Monotonic, and their dynamic version with the Earliest Deadline based scheduler, in order to compare their behaviour

Published in:

Real-Time Systems, 1994. Proceedings., Sixth Euromicro Workshop on

Date of Conference:

15-17 Jun 1994