Model Checking Simpson's Four-Slot Fully Asynchronous Communication Mechanism (2002)
by
John Rushby
| Citations: | 5 - 1 self |
BibTeX
@MISC{Rushby02modelchecking,
author = {John Rushby},
title = {Model Checking Simpson's Four-Slot Fully Asynchronous Communication Mechanism},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Simpson's four-slot fully asynchronous communication mechanism allows single reader and writer processes to access a shared memory in such a way that interference between concurrent reads and writes is avoided, the reader always accesses the most recent data stored by the writer, and neither process need wait for the other. In computer science parlance, it is a means for implementing a wait-free atomic register.
