Multi-dimensional quorum sets for read-few write-many replica control protocols

Authors:
B. Silaghi;P. Keleher;B. Bhattacharjee
Affiliations:
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA;Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
Venue:
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Year:
2004

Citing 0
Cited 4

SQUARE: scalable quorum-based atomic memory with local reconfiguration

Proceedings of the 2007 ACM symposium on Applied computing
Dynamic quorums for DHT-based enterprise infrastructures

Journal of Parallel and Distributed Computing
Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Rigorous design of fault-tolerant transactions for replicated database systems using event b

Rigorous Development of Complex Fault-Tolerant Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe d-spaces, a replica control protocol defined in terms of quorum sets on multi-dimensional logical structures. Our work is motivated by asymmetrical access patterns, where the number of read accesses to data are dominant relative to update accesses, i.e. where the protocols should be read-few write-many. D-spaces are optimal with respect to quorum group sizes. The quality of the tradeoff between read efficiency and update availability is not matched by existing quorum protocols. We also propose a novel scheme for implementing d-spaces that combines caching and local information to provide a best-effort form of global views. This allows quorum reconfiguration to be lightweight without impacting access latencies, even when the rate of membership changes is very high.