MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  An optimal priority inheritance policy for synchronization in real-time systems (1995) [3 citations — 0 self]

Download:
pdf | ps
by Ragunathan Rajkumar, Lui Sha, John P. Lehoczky, Krithi Ramamritham
Advances in Real-Time Systems
http://cs.chungnam.ac.kr/~ykim/courses/grad-rts2000/son-book/chap11.ps
Add To MetaCart

Abstract:

Hard real-time systems require predictable timing behavior, and priority-driven preemptive scheduling is increasingly being used in these systems. Resources in these enviroiments should ideally be allocated to the highest-priority task. Priority inversion is a situation in which a higher-priority job is forced to wait for a lowerpriority job. Priority inversion degrades system schedulability. Hence, priority inversion should be minimized in a hard real-time environment. Unfortunately, a direct application of synchronization primitives such as semaphores, monitors, and Ada rendezvous can cause uncontrolled priority inversion, a situation in which a low-priority job blocks a higher-priority job for an indefinite period of time. In this chapter we investigate policies belonging to the class of priority inheritance policies that minimize priority inversion. We develop a priority inheritance policy called the Optimal Mutex Policy (OMP) which has two desirable properties: deadlocks are avoided and the worst-case blocking duration of a job is bounded by the duration of execution of a single critical section of a lower-priority job.

Citations

2168 Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973
640 ªPriority Inheritance Protocols: An Approach to Real-Time Synchronization,º – Sha, Rajkumar, et al. - 1990
439 The rate monotonic scheduling algorithm-Exact characterization and average case behavior – Lehoczky, Sha, et al. - 1989
211 Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment – Mok - 1993
182 The structure of systems using upcalls – Clark - 1985
123 Experiences with processes and monitors in Mesa – Lampson, Redell - 1980
90 Dynamic priority ceiling: A concurrency control protocol for real time systems. Real-time Systems – Chen, Lin - 1990
76 A note on preemptive scheduling of periodic, real time tasks – Leung, Merrill - 1980
58 Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems – Jeffay - 1992
50 A stack-based resource allocation policy for real-time process – Baker - 1990
44 Performance of Real-Time Bus Scheduling Algorithms – Lehoczky, Sha - 1986
34 Solutions for some practical problems in prioritized preemptive scheduling – Sha, Lehoczky, et al. - 1986
30 Task Synchronization in Real-Time Systems – Rajkumar - 1989
29 Guaranteed response time in a hard real-time environment – Leinbaugh - 1980
28 Dynamic task scheduling in hard real-time distributed system – Ramamritham, Stankovic - 1984
11 Real-Time Scheduling Theory and – Sha, Goodenough - 1990
6 An optimal priority inheritance protocol for real-time synchronization – Rajkumar, Sha, et al. - 1988
2 Designing real-time systems in ada – Inc - 1986