How to share concurrent wait-free variables

Abstract

Sharing data between multiple asynchronous users - each of which can atomically read and write the data - is a feature that may help to increase the amount of parallelism in distributed systems. An algorithm implementing this feature is presented. The main construction of an n-user atomic variable directly from single-writer, single-reader atomic variables uses O(n) control bits and O(n) accesses per Read/Write running in O(1) parallel time.