By Topic

Associative prioritized worker model with priority inheritance protocol

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)
Hong-Jin Park ; Syst. Software Lab., Chung-Ang Univ., Seoul, South Korea ; Kyung-Ah Chun ; Young-Chan Kim ; Sung-Ik Jun

Synchronization and communication are two common sources of priority inversion that may make the behavior of systems unpredictable and analyzable. In real-time systems, to predict the timing constraints of applications, we need to solve the priority inversion problem using the priority inheritance protocol. This requires a real-time server model that would provide us with better preemptability without affecting the overhead of the real-time system. However, the traditional real-time server model is not able to solve the trade-off between the high preemptability and the low overhead of the real-time system. We propose an associative prioritized worker model as a new real-time server model that solves the problems mentioned. Our approach enables us to build operating system servers and to decompose applications into several tasks without the priority inversion problem

Published in:

Object-Oriented Real-time Distributed Computing, 1998. (ISORC 98) Proceedings. 1998 First International Symposium on

Date of Conference:

20-22 Apr 1998