Quasi-linearizability: Relaxed consistency for improved concurrency

Yehuda Afek*, Guy Korland, Eitan Yanovsky

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Linearizability, the key correctness condition that most optimized concurrent object implementations comply with, imposes tight synchronization between the object concurrent operations. This tight synchronization usually comes with a performance and scalability price. Yet, these implementations are often employed in an environment where a more relaxed linearizability condition suffices, where strict linearizability is not a must. Here we provide a quantitative definition of limited non-determinism, a notion we call Quasi Linearizability. Roughly speaking an implementation of an object is quasi linearizable if each run of the implementation is at a bounded "distance" away from some linear run of the object. However, as we show the limited distance has to be relative to some operations but not all. Following the definition we provide examples of quasi concurrent implementations that out perform state of the art standard implementations due to the relaxed requirement. Finally we show that the Bitonic Counting Network non-deterministic behavior can be quantified using our Quasi Linearizable notion.

Original languageEnglish
Title of host publicationPrinciples of Distributed Systems - 14th International Conference, OPODIS 2010, Proceedings
Number of pages16
StatePublished - 2010
Event14th International Conference on Principles of Distributed Systems, OPODIS 2010 - Tozeur, Tunisia
Duration: 14 Dec 201017 Dec 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6490 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Conference on Principles of Distributed Systems, OPODIS 2010


Dive into the research topics of 'Quasi-linearizability: Relaxed consistency for improved concurrency'. Together they form a unique fingerprint.

Cite this