J. Chen and A. Burns. A three-slot asynchronous reader/writer mechanism for multiprocessor real-time systems. Technical Report YCS-186, Department of Computer Science, University of York, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Model Checking Simpson's Four-Slot Fully Asynchronous.. - Rushby (2002) (1 citation) (Correct)
....Simpson [Sim90] describes a three slot algorithm, but finds that it suffers from the same vulnerabilities as the two slot algorithm, so it looks as if at least four slots are necessary. A three slot algorithm can be made to work if we allow special hardware compare and swap instructions [CB97] Simpson s four slot algorithm arranges the slots as two pairs; we can call the pairs left and right, and within each pair refer to the top and bottom slots. The writer operates on one pair, alternating between the top and bottom slot. A control bit latest indicates to which pair the writer ....
Jing Chen and Alan Burns. A three-slot asynchronous reader-writer mechanism for multiprocessor real-time systems. Technical Report YCS-286, Department of Computer Science, University of York, May 1997.
Improving Wait-Free Algorithms for Interprocess.. - Huang, Pillai, Shin (2002) Self-citation (Real Department) (Correct)
....algorithms [9, 10] designed to ensure that reader tasks will always access uncorrupted messages. As mentioned earlier, synchronization, particularly with locks, can cause many problems of its own. Therefore, in this paper, we focus on wait free, singlewriter, multiple reader IPC algorithms [7, 8, 17, 24, 31]. However, these algorithms have higher space overheads than the synchronization based algorithms. Even though the worst case time overhead of these algorithms is significantly lower than that of the synchronization based ones, the execution overheads can still be significant. Later in this paper, ....
....et al. 17] and Anderson et al. 2] later demonstrated how to bound the number of retries by either increasing the buffer size or through judicious scheduling. To reduce the time overheads associated with read and check loops, algorithms that make space and time tradeoffs were later proposed [6 8, 17, 24, 31, 35]. These algorithms provide a good middle ground between the purely lock based approach (high WCET) and the purely buffer based approach (large buffer requirement) The benefit of these algorithms is that less time is wasted in read and check loops and the timing behavior is more predictable, ....
J. Chen and A. Burns. A three-slot asynchronous reader/writer mechanism for multiprocessor real-time systems. Technical Report YCS-186, Department of Computer Science, University of York, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC