TY - GEN

T1 - Brief announcement

T2 - 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

AU - Georgiou, Chryssis

AU - Nicolaou, Nicolas C.

AU - Shvartsman, Alexander A.

PY - 2008

Y1 - 2008

N2 - Atomic (linearizable) read/write memory is a fundamental abstractions in distributed computing. Following a seminal implementation of atomic memory of Attiya et al.[6], a folklore belief developed that in messaging-passing atomic memory implementations "reads must write." However, work by Dutta et al.[4] established that if the number of readers R is constrained with respect to the number of replicas S and the maximum number of crash-failures t so that R < S/t - 2, then single communication round-trip reads are possible. Such an implementation given in [4] is called fast. Subsequently, Georgiou et al.[3] relaxed the constraint in [4], and proposed semifast implementations with unbounded number of readers, where under realistic conditions most reads need only a single communication round-trip to complete. Their approach groups collections of readers into virtual nodes. Semifast behavior of their algorithm is preserved as long as the number of virtual nodes V is constrained by V < S/t - 2. Quorum systems are well-known mathematical tools that provide means for achieving coordination between processors in distributed systems. Given that the approach of Attiya et al.[6]is readily generalized from majorities to quorums (e.g., [5, 2]), and that the algorithms in [4] and[3] rely on intersections in specific sets of responding servers, one may ask: Can we characterize the conditions enabling fast implementations in a general quorumbased framework? This is what we establish in this work.

AB - Atomic (linearizable) read/write memory is a fundamental abstractions in distributed computing. Following a seminal implementation of atomic memory of Attiya et al.[6], a folklore belief developed that in messaging-passing atomic memory implementations "reads must write." However, work by Dutta et al.[4] established that if the number of readers R is constrained with respect to the number of replicas S and the maximum number of crash-failures t so that R < S/t - 2, then single communication round-trip reads are possible. Such an implementation given in [4] is called fast. Subsequently, Georgiou et al.[3] relaxed the constraint in [4], and proposed semifast implementations with unbounded number of readers, where under realistic conditions most reads need only a single communication round-trip to complete. Their approach groups collections of readers into virtual nodes. Semifast behavior of their algorithm is preserved as long as the number of virtual nodes V is constrained by V < S/t - 2. Quorum systems are well-known mathematical tools that provide means for achieving coordination between processors in distributed systems. Given that the approach of Attiya et al.[6]is readily generalized from majorities to quorums (e.g., [5, 2]), and that the algorithms in [4] and[3] rely on intersections in specific sets of responding servers, one may ask: Can we characterize the conditions enabling fast implementations in a general quorumbased framework? This is what we establish in this work.

UR - http://www.scopus.com/inward/record.url?scp=57549086455&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57549086455&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:57549086455

SN - 9781595939890

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 425

BT - PODC'08

Y2 - 18 August 2008 through 21 August 2008

ER -