Year: 1987
Type: conference-paper
Abstract: A wait-free solution to the atomic (r,1kCRWW problem is presented.It uses (r+2)(Sr+2+6)-I safe, multi-reader bits to implement a &bit variable shared among t readers and 1 writer, solving an open question of Lamport [Lamport '851.Thus, it closes a gap in the simulation of systems of shared variables for single writers.It differs from other approaches to this problem in that mutual exclusion is maintained between the writer and other processes on the copies of the shared variable used in the implementation.
DOI: 10.1145/41840.41860
Author: Richard Newman-Wolfe
Institution: University of Florida
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1990291124
