Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency

被引：0
|
作者：
Afek, Yehuda [1 ]
Korland, Guy [1 ]
Yanovsky, Eitan [1 ]
机构：
[1] Tel Aviv Univ, Dept Comp Sci, Tel Aviv, Israel
来源：
DISTRIBUTED COMPUTING | 2010年 / 6343卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Many linearizable and optimized concurrent algorithms are available for known algorithms and data structures, such as, Queue, Tree, Stack, Counter and Hash Table. 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.
引用
收藏
页码：127 / 129
页数：3
相关论文
共 33 条
  • [21] Brief Announcement: Read Invisibility, Virtual World Consistency and Permissiveness are Compatible
    Crain, Tyler
    Imbs, Damien
    Raynal, Michel
    [J]. SPAA 11: PROCEEDINGS OF THE TWENTY-THIRD ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2011, : 315 - 316
  • [22] Brief Announcement: A New Improved Bound for Coflow Scheduling
    Shafiee, Mehrnoosh
    Ghaderi, Javad
    [J]. PROCEEDINGS OF THE 29TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA'17), 2017, : 91 - 93
  • [23] Brief Announcement: Global Consistency can be Easier than Point-to-Point Communication
    Gopal, Prasant
    Gupta, Anuj
    Vasishta, Pranav K.
    Bansal, Piyush
    Srinathan, K.
    [J]. PODC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2009, : 310 - 311
  • [24] Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores
    Arad, Cosmin
    Shafaat, Tallat M.
    Haridi, Self
    [J]. DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 445 - 446
  • [25] Brief Announcement: Left-Right - A Concurrency Control Technique with Wait-Free Population Oblivious Reads
    Ramalhete, Pedro
    Correia, Andreia
    [J]. DISTRIBUTED COMPUTING (DISC 2015), 2015, 9363 : 663 - 664
  • [26] Brief Announcement: MUSIC: Multi-Site Entry Consistency for Geo-Distributed Services
    Balasubramanian, Bharath
    Schlichting, Richard
    Zave, Pamela
    [J]. PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 281 - 283
  • [27] Brief Announcement: Consistency and Complexity Tradeoffs for Highly-Available Multi-cloud Store
    Chockler, Gregory
    Dobre, Dan
    Shraer, Alexander
    [J]. DISTRIBUTED COMPUTING, 2013, 8205 : 569 - +
  • [28] Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds
    Anh Tran
    Talmage, Edward
    [J]. PROCEEDINGS OF THE 2023 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2023, 2023, : 370 - 373
  • [29] Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity
    Barenboim, Leonid
    Tzur, Yaniv
    [J]. SPAA'18: PROCEEDINGS OF THE 30TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2018, : 223 - 226
  • [30] Brief Announcement: An Improved Distributed Approximate Single-Source Shortest Paths Algorithm
    Cao, Nairen
    Fineman, Jeremy T.
    Russell, Katina
    [J]. PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 493 - 496
1234