HackerPapers

arXiv:1406.7423cs.DC

An Efficient Read Dominant Data Replication Protocol under Serial Isolation using Quorum Consensus Approach

Vinit Kumar, Ajay Agarwal

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

In distributed systems, data replication provides better availability, higher read capacity, improved access efficiency and lower bandwidth requirements in the system. In this paper, we propose a significantly efficient approach of the data replication for serial isolation by using newly proposed Circular quorum systems. This paper has three major contributions. First, we have proposed the Circular quorum systems that generalize the various existing quorum systems, such as Read-one-write-all (ROWA) quorum systems, Majority quorum systems, Grid quorum systems, Diamond quorum systems, D-Space quorum systems, Multi-dimensional-grid quorum systems and Generalized-grid quorum systems. Second, Circular quorum systems not only generalizes but also improves the performance over existing quorum systems of their category. Third, we proposed a highly available Circular quorum consensus protocol for data replication under serial isolation level that uses a suitable Circular quorum system for read dominant scenario.

arXiv comments
Journal reference
DOI
Subjects
cs.DCDistributed, Parallel, and Cluster Computing

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Oct 2018 to Oct 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Sorry, I think either my fundamental understanding is off or I wasn't clear enough in how I was imagining this happening... If you and a majority of nodes agree on a value like an CRDT OpSet (more simplistically, just agreeing on the state of the log), how does that not…

      hardwaresoftonView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.