loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00)
Efficient pure-buffer algorithms for real-time systems
Cheju Island, South Korea
December 12-December 14
ISBN: 0-7695-0930-4
ASCII Text
x 
 
J.H. Anderson, P. Holman, "Efficient pure-buffer algorithms for real-time systems," Real-Time Computing Systems and Applications, International Workshop on, pp. 57, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2000.896371,
author = {J.H. Anderson and P. Holman},
title = {Efficient pure-buffer algorithms for real-time systems},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2000},
issn = {1533-2306},
pages = {57},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896371},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - Efficient pure-buffer algorithms for real-time systems
SN - 1533-2306
SP
EP
A1 - J.H. Anderson,
A1 - P. Holman,
PY - 2000
KW - buffer storage; real-time systems; computational complexity; processor scheduling; safety; multiprocessing systems; distributed algorithms; efficient pure-buffer algorithms; multiprocessor real-time systems; wait-free algorithms; multi-writer read/write pure-buffers; overwritten data; shared buffers; client processes; handshaking mechanisms; concurrent read/write operations safety; optimized algorithms; quantum-scheduled systems; priority-scheduled systems; buffer word length; processor number; time complexity; space complexity
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
J.H. Anderson, North Carolina Univ., Chapel Hill, NC, USA
P. Holman, North Carolina Univ., Chapel Hill, NC, USA
Presents wait-free algorithms for implementing multi-writer read/write pure-buffers in multiprocessor real-time systems. Such buffers are commonly used when existing data is overwritten as newly-produced data becomes available. Pure-buffer algorithms share several buffers between client processes and use handshaking mechanisms to ensure the safety of concurrent read and write operations. We present algorithms optimized for both quantum and priority-scheduled systems. When used to implement a B-word buffer 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 /spl Theta/(B).
Index Terms:
buffer storage; real-time systems; computational complexity; processor scheduling; safety; multiprocessing systems; distributed algorithms; efficient pure-buffer algorithms; multiprocessor real-time systems; wait-free algorithms; multi-writer read/write pure-buffers; overwritten data; shared buffers; client processes; handshaking mechanisms; concurrent read/write operations safety; optimized algorithms; quantum-scheduled systems; priority-scheduled systems; buffer word length; processor number; time complexity; space complexity
Citation:
J.H. Anderson, P. Holman, "Efficient pure-buffer algorithms for real-time systems," rtcsa, pp.57, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000
Usage of this product signifies your acceptance of the Terms of Use.