Efficient Pure-Buffer Algorithms for Real-Time Systems

James H. Anderson and Philip Holman

To appear at Work-In-Progress Sessions of The 21st IEEE Real-Time Systems Symposium (RTSSWIP00), Orlando, Florida, November 27-30, 2000


Abstract

We present a wait-free algorithm for implementing multi-writer read/write pure-buffers in priority-based multiprocessor real-time systems. For a B-word buffer shared across a constant number of processors, the time complexity for reading and writing in our algorithm is O(B), and the space complexity is Θ(B).


Server START Conference Manager
Update Time 28 Oct 2000 at 11:30:23
Maintainer sbrandt@cse.ucsc.edu.
Start Conference Manager
Conference Systems