Summary: An Implementation of the PCP, SRP, D­PCP, M­PCP, and
FMLP Real­Time Synchronization Protocols in LITMUS RT
Bj˜ orn B. Brandenburg and James H. Anderson
The University of North Carolina at Chapel Hill
Abstract
We extend the FMLP to partitioned static­priority schedul­
ing and derive corresponding worst­case blocking bounds.
Further, we present the first implementation of the PCP,
SRP, D­PCP, M­PCP, and FMLP synchronization proto­
cols in 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.
1 Introduction
With the continued push towards multicore architectures by
most (if not all) major chip manufacturers [22, 28], the com­
puting industry is facing a paradigm shift: in the near fu­
ture, multiprocessors will be the norm. While current off­
the­shelf systems already routinely contain processors with
two, four, and even eight cores (examples include the Intel
Core 2 Duo, the AMD Phenom, and SUN UltraSPARC T1

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

Collections: Computer Technologies and Information Sciences