The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks
IRTAW '88 Proceedings of the second international workshop on Real-time Ada issues
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Temporal Isolation in Ravenscar-Java
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Preemptible Atomic Regions for Real-Time Java
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
A real-time Java virtual machine with applications in avionics
ACM Transactions on Embedded Computing Systems (TECS)
Flexible task graphs: a unified restricted thread programming model for java
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Handling mixed-criticality in SoC-based real-time embedded systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Non-blocking inter-partition communication with wait-free pair transactions
Proceedings of the 11th International Workshop on Java Technologies for Real-time and Embedded Systems
Hi-index | 0.00 |
Priority inheritance protocol (PIP) is an important protocol to prevent unbounded priority inversion of threads which contend on shared resources. Recently, there has been a renewed interest in reducing the latency and increasing predictability for high priority threads that acquire contended resources from low priority threads. In this paper we present an extension to PIP called Priority Rollback Protocol, which allows high priority threads to rollback low priority threads, thereby freeing contended resources. PRP leverages recent advances in software transactional memory (STM) to facilitate efficient and predictable reversion of low priority threads. We present two versions of the PRP algorithm and compare and contrast their tradeoffs. PRP is geared toward mixed criticality systems, specifically for providing tight and predictable bounds for direct communication between processes. Since PRP is an extension of PIP, systems can seamlessly leverage both PIP and PRP locks.