Brief announcement: quasi-linearizability: relaxed consistency for improved concurrency

Authors:
Yehuda Afek;Guy Korland;Eitan Yanovsky
Affiliations:
Computer Science Department, Tel-Aviv University, Israel;Computer Science Department, Tel-Aviv University, Israel;Computer Science Department, Tel-Aviv University, Israel
Venue:
DISC'10 Proceedings of the 24th international conference on Distributed computing
Year:
2010

Citing 3
Cited 0

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
SEDA: an architecture for well-conditioned, scalable internet services

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many linearizable and optimized concurrent algorithms are available for known algorithms and data structures, such as, Queue, Tree, Stack, Counter and HashTable. However, sometimes these implementations are used in a more relaxed environment, provided as part of larger design pattern where a relaxed linearizability suffices rather than a strict one. 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.