| | |
Summary: EÆcient Pure-bu er Algorithms for Real-time Systems 1
James H. Anderson and Philip Holman
University of North Carolina, Chapel Hill, NC 27599-3175
Abstract
We present wait-free algorithms for implementing
multi-writer read/write pure-bu ers in multiprocessor
real-time systems. Such bu ers are commonly used
when existing data is overwritten as newly-produced
data becomes available. Pure-bu er algorithms share
several bu ers between client processes and use hand-
shaking mechanisms to ensure the safety of concurrent
read and write operations. We present algorithms op-
timized for both quantum- and priority-scheduled sys-
tems. When used to implement a B-word bu er shared
across a constant number of processors, the time com-
plexity for reading and writing in each of our algorithms
is O(B), and the space complexity is (B).
1 Introduction
Shared read/write bu ers are commonly used in real-
time applications to exchange data values between pro-
|
