论文信息 - A Protocol for Wait-Free, Atomic, Multi-Reader Shared Variables

A Protocol for Wait-Free, Atomic, Multi-Reader Shared Variables

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.

Richard E. Newman

[1] Gary L. Peterson. A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables , 1983, TOPL.

[2] Edsger W. Dijkstra,et al. Solution of a problem in concurrent programming control , 1965, CACM.

[3] Gary L. Peterson,et al. Concurrent reading while writing II: The multi-writer case , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4] G. S. Graham. A New Solution of Dijkstra ' s Concurrent Programming Problem , 2022 .

[5] Baruch Awerbuch,et al. Atomic shared register access by asynchronous hardware , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6] Gary L. Peterson,et al. Constructing multi-reader atomic values from non-atomic values , 1987, PODC '87.

[7] Gary L. Peterson,et al. Concurrent Reading While Writing , 1983, TOPL.

[8] David Lorge Parnas,et al. Concurrent control with “readers” and “writers” , 1971, CACM.