An Implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP Real-Time Synchronization Protocols in LITMUS^RT

Authors:
Björn B. Brandenburg;James H. Anderson
Affiliations:
-;-
Venue:
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2008

Citing 0
Cited 7

A Comparison of the M-PCP, D-PCP, and FMLP on LITMUSRT

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Partitioning real-time systems on multiprocessors with shared resources

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Sharing resources among independently-developed systems on multi-cores

ACM SIGBED Review
Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Robust partitioning for real-time multiprocessor systems with shared resources

Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Integrating independently developed real-time applications on a shared multi-core architecture

ACM SIGBED Review
Exploring the design space of multiprocessor synchronization protocols for real-time systems

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the FMLP to partitioned static-priority scheduling and derive corresponding worst-case blocking bounds. Further, we present the first implementation of the PCP, SRP, D-PCP, M-PCP, and FMLP synchronization protocolsin a unified framework in a general-purpose OS and discuss design issues that were beyond the scope of prior algorithmic-oriented work on real-time synchronization.