Brief announcement: 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

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.

Original languageEnglish
Title of host publicationDistributed Computing - 24th International Symposium, DISC 2010, Proceedings
Pages127-129
Number of pages3
DOIs
StatePublished - 2010
Event24th International Symposium on Distributed Computing, DISC 2010 - Cambridge, MA, United States
Duration: 13 Sep 201015 Sep 2010

Publication series

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

Conference

Conference24th International Symposium on Distributed Computing, DISC 2010
Country/TerritoryUnited States
CityCambridge, MA
Period13/09/1015/09/10

Fingerprint

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

Cite this