Filters








106 Hits in 3.5 sec

Probabilistically bounded staleness for practical partial quorums

Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, Ion Stoica
2012 Proceedings of the VLDB Endowment  
We introduce Probabilistically Bounded Staleness (PBS) consistency, which provides expected bounds on staleness with respect to both versions and wall clock time.  ...  In this work, we explain why partial quorums are regularly acceptable in practice, analyzing both the staleness of data they return and the latency benefits they offer.  ...  Acknowledgments The authors would like to thank Alex Feinberg and Coda Hale for their cooperation in providing real-world distributions for experiments and for exemplifying positive industrial-academic  ... 
doi:10.14778/2212351.2212359 fatcat:vwxn2umrkfevjlmiuuskxcmoci

Probabilistically Bounded Staleness for Practical Partial Quorums [article]

Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, Ion Stoica
2012 arXiv   pre-print
We introduce Probabilistically Bounded Staleness (PBS) consistency, which provides expected bounds on staleness with respect to both versions and wall clock time.  ...  In this work, we explain why partial quorums are regularly acceptable in practice, analyzing both the staleness of data they return and the latency benefits they offer.  ...  Acknowledgments The authors would like to thank Alex Feinberg and Coda Hale for their cooperation in providing real-world distributions for experiments and for exemplifying positive industrial-academic  ... 
arXiv:1204.6082v1 fatcat:77y7biwjs5fqrgp67sdwsdkbw4

Quantifying eventual consistency with PBS

Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, Ion Stoica
2014 Communications of the ACM  
To quantify the behavior of eventually consistent stores, we introduce Probabilistically Bounded Staleness (PBS), a consistency model that provides expected bounds on data staleness with respect to both  ...  We derive a closed-form solution for version-based staleness and model real-time staleness for a large class of quorum replicated, Dynamo-style stores.  ...  We present probabilistic models for such bounds called Probabilistically Bounded Staleness, or PBS.  ... 
doi:10.1145/2632792 fatcat:zkemja4mbvayxlwyftf47nurba

Quantifying eventual consistency with PBS

Peter Bailis, Shivaram Venkataraman, Michael J. Franklin, Joseph M. Hellerstein, Ion Stoica
2013 The VLDB journal  
To quantify the behavior of eventually consistent stores, we introduce Probabilistically Bounded Staleness (PBS), a consistency model that provides expected bounds on data staleness with respect to both  ...  We derive a closed-form solution for version-based staleness and model real-time staleness for a large class of quorum replicated, Dynamo-style stores.  ...  We present probabilistic models for such bounds called Probabilistically Bounded Staleness, or PBS.  ... 
doi:10.1007/s00778-013-0330-1 fatcat:y553lm2woffefavt6wqflhpc4m

On the Availability of Non-strict Quorum Systems [chapter]

Amitanand Aiyer, Lorenzo Alvisi, Rida A. Bazzi
2005 Lecture Notes in Computer Science  
For environments with a relatively large failure frequency compared to write frequency, we propose K-quorums that can provide higher availability than the strict quorum systems and also guarantee bounded  ...  cannot enforce a bound on the staleness of data read.  ...  To ensure bounded staleness we require that any K partial-writequorums, used for successive writes, collectively contain a write quorum.  ... 
doi:10.1007/11561927_6 fatcat:slcoy323jjcsdgm7un6nopeypy

Byzantine and Multi-writer K-Quorums [chapter]

Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
2006 Lecture Notes in Computer Science  
For a system with m writers, we prove a lower bound of (2m − 1)(k − 1) + 1 ¡ on the staleness of any multi-writer protocol built over a single-writer k-quorum system and propose a multi-writer protocol  ...  that provides an almost matching staleness bound of (2m − 1)(k − 1) + m ¡ .  ...  By allowing for lower availability than probabilistic systems, they guaran-tee a bound on the staleness of returned values even in the presence of an adversarial scheduler.  ... 
doi:10.1007/11864219_31 fatcat:nje7clgzlrhklpajvmiedyhpsa

Continuous Partial Quorums for Consistency-Latency Tuning in Distributed NoSQL Storage Systems [article]

Marlon McKenzie, Hua Fan, Wojciech Golab
2015 arXiv   pre-print
We propose a novel technique called continuous partial quorums (CPQ) that assigns the consistency level on a per-operation basis by choosing randomly between two options, such as eventual and strong consistency  ...  NoSQL storage systems are used extensively by web applications and provide an attractive alternative to conventional databases when the need for scalability outweighs the need for transactions.  ...  Probabilistically bounded staleness (PBS) is a mathematical model of partial quorums that overcomes these limitations but is based upon the simplifying assumption that writes do not execute concurrently  ... 
arXiv:1507.03162v3 fatcat:aryowfy6yrejdnx3pk4vxcg2ou

Achieving Probabilistic Atomicity with Well-Bounded Staleness and Low Read Latency in Distributed Datastores

Lingzhi Ouyang, Yu Huang, Hengfeng Wei, Jian Lu
2020 IEEE Transactions on Parallel and Distributed Systems  
Index Terms-Probabilistic atomicity, well-bounded staleness, fast read algorithm, quorum-replicated datastore Ç 1 INTRODUCTION N OWADAYS cloud-based distributed datastores are expected to provide always-available  ...  In distributed storage systems, we investigate the generic notion of almost strong consistency in terms of designing fast read algorithms while guaranteeing Probabilistic Atomicity with well-Bounded staleness  ...  ACKNOWLEDGMENTS This work was supported in part by the National Natural Science Foundation of China (Grants 61932021, and 61772258), the Fundamental Research Funds for the Central Universities (Grant 14380063  ... 
doi:10.1109/tpds.2020.3034328 fatcat:swkxgiirarb37flanrtuxzqh6q

Overcoming the Majority Barrier in Large-Scale Systems [chapter]

Haifeng Yu
2003 Lecture Notes in Computer Science  
To overcome the barrier realistically, this paper proposes a witness model that probabilistically strengthens the traditional asynchronous model for large-scale systems.  ...  We argue that the majority barrier significantly limits the availability of practical systems such as peer-to-peer systems.  ...  to implement probabilistic quorums in real systems.  ... 
doi:10.1007/978-3-540-39989-6_25 fatcat:dufdhg2lczeuhiepnrkhqpdwje

Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks [chapter]

Kevin Henry, Colleen Swanson, Qi Xie, Khuzaima Daudjee
2009 Lecture Notes in Computer Science  
In practice, this should be accomplished by coordinating and writing to only a small number of peers.  ...  Furthermore, our two quorum approaches are interchangeable within the same network, providing adaptivity by allowing one to be swapped for the other as network conditions change.  ...  using a random traversal, and the other a partially-fixed traversal.  ... 
doi:10.1007/978-3-642-05148-7_14 fatcat:i2yqsdmavvdnrhdldmvistx3rq

Probabilistic quorum systems in wireless Ad Hoc networks

Roy Friedman, Gabriel Kliot, Chen Avin
2010 ACM Transactions on Computer Systems  
This article explores several access strategies for implementing probabilistic quorums in ad hoc networks.  ...  One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic.  ...  Probabilistic Quorums In probabilistic quorums [Malkhi et al. 2001 ], a quorum system is not fixed a priori, but is rather picked in a probabilistic manner for each interaction with the quorum system.  ... 
doi:10.1145/1841313.1841315 fatcat:uh4zmnvoavfathypq2nqd6jniq

Probabilistic quorum systems in wireless ad hoc networks

Roy Friedman, Gabriel Kliot, Chen Avin
2008 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)  
This article explores several access strategies for implementing probabilistic quorums in ad hoc networks.  ...  One of the known ways of making quorums scalable and efficient is by weakening their intersection guarantee to being probabilistic.  ...  Probabilistic Quorums In probabilistic quorums [Malkhi et al. 2001 ], a quorum system is not fixed a priori, but is rather picked in a probabilistic manner for each interaction with the quorum system.  ... 
doi:10.1109/dsn.2008.4630096 dblp:conf/dsn/FriedmanKA08 fatcat:j4qk5vkfijeb7bc5yhnntbgttu

Probabilistic quorums for dynamic systems

Ittai Abraham, Dahlia Malkhi
2005 Distributed computing  
The number of random walks performed is a function of the bound on the global gap C, and the required probabilistic guarantees. For a εintersecting quorum system we x a parameter ρ = ln 1 ε .  ...  For every time step s ≤ i ∈ T , let Q(i), ac i be a probabilistic quorum system and ev i be an evolution strategy.  ... 
doi:10.1007/s00446-005-0139-2 fatcat:ou2eyy673vhvrljdc3bwkz72zi

Probabilistic Quorums for Dynamic Systems [chapter]

Ittai Abraham, Dahlia Malkhi
2003 Lecture Notes in Computer Science  
The number of random walks performed is a function of the bound on the global gap C, and the required probabilistic guarantees. For a εintersecting quorum system we x a parameter ρ = ln 1 ε .  ...  For every time step s ≤ i ∈ T , let Q(i), ac i be a probabilistic quorum system and ev i be an evolution strategy.  ... 
doi:10.1007/978-3-540-39989-6_5 fatcat:bwdc254eu5az5kr5d74iiqbd7e

PAN

Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
2003 Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '03  
Inspired by the principles of probabilistic quorum systems, we present a Probabilistic quorum system for ad hoc networks (Pan), a collection of protocols for the reliable storage of data in mobile ad hoc  ...  It is precisely this unpredictability that makes probabilistic protocols very appealing for such environments.  ...  The main reason for this is the increased amount of stale routing information. In practice, this effect does not appear in the presence of background traffic.  ... 
doi:10.1145/778415.778417 dblp:conf/mobihoc/LuoHE03 fatcat:g6gj7jqk3vbftmbosmkbujg62a
« Previous Showing results 1 — 15 out of 106 results