Eventually linearizable shared objects

Serafini, M. and Dobre, D. and Majuntke, M. and Bokor, P. and Suri, Neeraj (2010) Eventually linearizable shared objects. In: PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. ACM, pp. 95-104. ISBN 9781605588889

Abstract

Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with ◇S and a majority of correct processes. In this paper we introduce the notion of Eventual Linearizability, the strongest known consistency property that can be attained with ◇S and any number of crashes. We show that linearizable shared object implementations can be augmented to support weak operations, which need to be linearized only eventually. Unlike strong operations that require to be always linearized, weak operations terminate in worst case runs. However, there is a tradeoff between ensuring termination of weak and strong operations when processes have only access to ◇S. If weak operations terminate in the worst case, then we show that strong operations terminate only in the absence of concurrent weak operations. Finally, we show that an implementation based on ◇P exists that guarantees termination of all operations. Copyright 2010 ACM.