Wait-free object-sharing schemes for real-time uniprocessors and multiprocessors

Authors:
James H. Anderson;Rohit Jain;Srikanth Ramamurthy
Affiliations:
-;-;-
Venue:
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Year:
1997

Citing 0
Cited 7

Implementing wait-free objects on priority-based systems

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Versioning concurrency control for hard real-time systems

Journal of Systems and Software
On avoiding remote blocking via real-time concurrency control protocols

Journal of Systems and Software
A Non-Blocking Buffer Mechanism for Real-Time Event Message Communication

Real-Time Systems
Lock-free synchronization for dynamic embedded real-time systems

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Space-Optimal, Wait-Free Real-Time Synchronization

IEEE Transactions on Computers
Lock-free synchronization for dynamic embedded real-time systems

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several new wait-free object-sharing schemes for real-time uniprocessors and multiprocessors are presented. These schemes have characteristics in common with the priority inheritance and priority ceiling protocols, but are nonblocking and implemented at the user level. In total, six new object-sharing schemes are proposed: two for uniprocessors and four for multiprocessors. Breakdown utilization experiments are presented that show that the multiprocessor schemes entail less overhead than lock-based schemes.