TY - GEN
T1 - Brief announcement
T2 - 24th International Symposium on Distributed Computing, DISC 2010
AU - Afek, Yehuda
AU - Korland, Guy
AU - Yanovsky, Eitan
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=78649872100&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15763-9_12
DO - 10.1007/978-3-642-15763-9_12
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:78649872100
SN - 3642157629
SN - 9783642157622
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 127
EP - 129
BT - Distributed Computing - 24th International Symposium, DISC 2010, Proceedings
Y2 - 13 September 2010 through 15 September 2010
ER -