Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Ecient Pure-bu er Algorithms for Real-time Systems James H. Anderson and Philip Holman
 

Summary: E∆cient Pure-bu er Algorithms for Real-time Systems 
James H. Anderson and Philip Holman
Department of Computer Science
University of North Carolina
Chapel Hill, NC 27599-3175
Phone: (919) 962-1757
Fax: (919) 962-1799
E-mail: fanderson,holmang@cs.unc.edu
July 2000
Abstract
We present several wait-free algorithms for implementing read/write bu ers in real-time systems. Such
bu ers are commonly used in situations where newly-produced data values take precedence over older data,
and hence older data can be overwritten. Each of our algorithms is a \pure-bu er" algorithm. In a pure-
bu er algorithm, several bu ers are shared between the writer and reader processes, and a handshaking
mechanism is employed that ensures that a writer never writes into a bu er that is concurrently being read
by some reader. Each of our algorithms is optimized by taking characteristics of quantum- and priority-based
schedulers into account. When used to implement a B-word bu er that is shared across a constant number
of processors, the time complexity for reading and writing in each of our algorithms is O(B), and the space
complexity is (B). These complexity gures are obviously asymptotically optimal and are independent of
the number of writer and reader processes. In contrast, all previously-published pure-bu er algorithms are

  

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

 

Collections: Computer Technologies and Information Sciences