Filters








8,419 Hits in 4.6 sec

On the Practicality of Atomic MWMR Register Implementations

Nicolas Nicolaou, Chryssis Georgiou
2012 2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications  
We assume that requests made by read and write processes are well-formed: a process does not request a new operation until it receives the response for a previously invoked operation.  ...  Our results shed new light on the practicality of atomic MWMR register implementations. Atomicity: We study atomic read/write register implementations, where the register is replicated at servers.  ...  The more the writers and the quorums in the system, the more time the read operation takes to complete. Similar observations can be made for the write operations.  ... 
doi:10.1109/ispa.2012.51 dblp:conf/ispa/NicolaouG12 fatcat:hoqq55v53nbvvcbm4r4tnmjwde

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  
Under partial, or non-strict quorum replication, a data store waits for responses from a subset of replicas before answering a query, without guaranteeing that read and write replica sets intersect.  ...  Using PBS, we measure the latency-consistency trade-off for partial quorum systems.  ...  Quorum Foundations: Practice In practice, many distributed data management systems use quorums as a replication mechanism.  ... 
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
Under partial, or non-strict quorum replication, a data store waits for responses from a subset of replicas before answering a query, without guaranteeing that read and write replica sets intersect.  ...  Using PBS, we measure the latency-consistency trade-off for partial quorum systems.  ...  Quorum Foundations: Practice In practice, many distributed data management systems use quorums as a replication mechanism.  ... 
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  
Using PBS, we measure the trade-off between latency and consistency for partial, non-overlapping quorum systems under Internet production workloads.  ...  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.  ...  Partial quorum systems, which we will study, are a natural relaxation of strict quorum systems: at least two quorums in a partial quorum system do not overlap. 19 Quorum foundations: Practice In practice  ... 
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  
Using PBS, we measure the trade-off between latency and consistency for partial, non-overlapping quorum systems under Internet production workloads.  ...  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.  ...  Partial quorum systems, which we will study, are a natural relaxation of strict quorum systems: at least two quorums in a partial quorum system do not overlap. 19 Quorum foundations: Practice In practice  ... 
doi:10.1007/s00778-013-0330-1 fatcat:y553lm2woffefavt6wqflhpc4m

Page 51 of SMPTE Motion Imaging Journal Vol. 114, Issue 1 [page]

2005 SMPTE Motion Imaging Journal  
least one response containing the required data, a read quorum group must intersect any write quorum group Suppose we have N replicas.  ...  Mutual exclu- sion of writes is ensured by imposing the restriction that write quorum groups must have a common mem- ber, i.e., intersections are non-empty To ensure read requests will always receive at  ... 

On the Practicality of Atomic MWMR Register Implementations [article]

Chryssis Georgiou, Nicolas C. Nicolaou
2012 arXiv   pre-print
Fastness is measured in terms of the number of single round read and write operations that does not sacrifice correctness.  ...  In particular, considering that the performance is measured in terms of the latency of read and write operations due to both (a) communication delays and (b)local computation, they introduced two new algorithms  ...  The more the writers and the quorums in the system, the more time the read operation takes to complete. Similar observations can be made for the write operations.  ... 
arXiv:1111.2693v2 fatcat:vh53gokbujcqtbfvnea4tr2dua

A Generalised Solution to Distributed Consensus [article]

Heidi Howard, Richard Mortier
2019 arXiv   pre-print
The surprising result of this analysis is a substantial weakening to the quorum requirements of these widely studied algorithms.  ...  The Paxos algorithm is synonymous with distributed consensus, yet it performs poorly in practice and is famously difficult to understand.  ...  As a result, systems are typically limited in practice to just three or five participants.  ... 
arXiv:1902.06776v1 fatcat:ath3ugr5xjgytgtrapsz5efe6y

Paxos Quorum Leases

Iulian Moraru, David G. Andersen, Michael Kaminsky
2014 Proceedings of the ACM Symposium on Cloud Computing - SOCC '14  
Quorum leases do not sacrifice consistency and have only a small impact on system availability and write latency.  ...  This paper describes quorum leases, a new technique that allows Paxos-based systems to perform reads with high throughput and low latency.  ...  A variety of approaches to read leases have been used in practical systems.  ... 
doi:10.1145/2670979.2671001 dblp:conf/cloud/MoraruAK14 fatcat:hwkhqvffwjeatf4mkb2oksohre

Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers

Chryssis Georgiou, Nicolas Nicolaou, Alexander C. Russell, Alexander A. Shvartsman
2011 2011 IEEE 10th International Symposium on Network Computing and Applications  
The efficiency of atomic read/write register implementations is traditionally measured in terms of the latency of read and write operations.  ...  Then we present a new algorithm, called CWFR, that allows fast operations independently of the underlying quorum system construction.  ...  To obtain a weak-semifast implementation they introduced a client-side decision tool called Quorum Views that enables fast read operations under read/write concurrency when general quorum systems are used  ... 
doi:10.1109/nca.2011.18 dblp:conf/nca/GeorgiouNRS11 fatcat:u6pkfo7hgrghxco44lynujx5xm

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

Amitanand Aiyer, Lorenzo Alvisi, Rida A. Bazzi
2005 Lecture Notes in Computer Science  
Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems.  ...  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  ...  In synchronous s systems, the probability that a read violates safe-semantics can be made arbitrarily small by using a large quorum size with an appropriate access strategy.  ... 
doi:10.1007/11561927_6 fatcat:slcoy323jjcsdgm7un6nopeypy

Fault detection for Byzantine quorum systems

L. Alvisi, D. Malkhi, E. Pierce, M.K. Reiter
2001 IEEE Transactions on Parallel and Distributed Systems  
In such a system, some correct servers can be out-of-date after a write and can therefore, return values other than the most up-to-date value in response to a client's read request, thus complicating the  ...  Our goal is to detect arbitrary failures of data servers in a system where each client accesses the replicated data at only a subset (quorum) of servers in each operation.  ...  Intuitively, if each read and write is performed at a quorum of servers, then the use of a masking quorum system ensures that a read quorum P intersects the last write quorum I in a set I P n p such that  ... 
doi:10.1109/71.954640 fatcat:jn7rkxsgkfhzla2qdy7psggcvy

Practically Stabilizing Atomic Memory [article]

Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sebastien Tixeuil
2010 arXiv   pre-print
The simulation works in asynchronous message-passing systems, and allows processes to crash, as long as at least a majority of them remain working.  ...  The simulation is based on reads and writes to a (majority) quorum in a system with a fully connected graph topology 1 .  ...  write to a majority quorum before returning the read value.  ... 
arXiv:1007.1802v2 fatcat:gznptjlhzjboxacheqdo5viwci

Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network [chapter]

Chryssis Georgiou, Nicolas Hadjiprocopiou, Peter M. Musial
2009 Lecture Notes in Computer Science  
Practical implementations of atomically consistent read/write memory service are important building blocks for higher level applications.  ...  This demonstrates the feasibility of developing dependable reconfigurable sharable data services with provable consistency guarantees on unreliable distributed systems.  ...  The caveat here is to ensure consistency while supporting atomic read and write operations. Atomicity of operation access is provided by use of quorum systems.  ... 
doi:10.1007/978-3-642-03095-6_55 fatcat:kbnyoqqi7rg5rjhxypdzwusmgi

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

Jan Skrzypczak, Florian Schintke, Thorsten Schuett
2020 IEEE Transactions on Parallel and Distributed Systems  
The protocol builds a fault-tolerant atomic register that supports arbitrary read-modify-write operations.  ...  In particular, freeing the distributed, outdated states in a fault-tolerant way is not trivial and adds further complexity and cost to the system.  ...  Several practical systems [8] , [9] , [10] follow this general approach.  ... 
doi:10.1109/tpds.2020.2981891 fatcat:5rkwiyimd5ejbh6mm54gxnzoua
« Previous Showing results 1 — 15 out of 8,419 results