A Space-Optimal Wait-Free Real-Time Synchronization Protocol

We present a wait-free protocol for the single-writer, multiple-reader problem in small-memory, embedded real-time systems. We analytically establish that our protocol requires lesser (or equal) number of buffers than what is needed by previously best wait-free protocols for this problem. Further, we prove that our protocol is space-optimal — the first such bound established for wait-free protocols that consider a-priori knowledge of preemptions. Our evaluation studies and implementation measurements (from an implementation using the SHaRK real-time OS kernel) confirm the protocol’s superiority and effectiveness.

• Type: Conference
• Year: 2005
• Where: ECRTS
• Authors: Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
• Keywords: ECRTS 2005, Embedded Real-time Systems, Multiple-reader Problem, Wait-free Protocols