By Topic

Performance evaluation of the quorum consensus replication method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. Helal ; Dept. of Comput. Sci. Eng., Texas Univ., Arlington, TX, USA ; B. Bhargava

The goal of data replication in distributed database systems is to increase data availability in the presence of failures. Using the quorum consensus method, up to [(n+1)/2] site failures can be tolerated, in an n-site system without loss of data accessability. Quorum consensus can however be very expensive to use, especially in large-scale systems. This is because multiple sites in the system must be accessed to perform the read or write operations. This paper describes an actual implementation of the quorum consensus method and gives an experimental evaluation of its performance. The implementation was done in the context of the Purdue Raid, which is a LAN-based distributed database system with extensive experimentation infrastructure. We focus our description on the particularities of managing version numbers and choosing object weights and thresholds. We also present a performance evaluation study, where the message traffic overhead, throughput and response time, and availability of the quorum consensus method is studied and compared to the read-one-write-all method

Published in:

Computer Performance and Dependability Symposium, 1995. Proceedings., International

Date of Conference:

24-26 Apr 1995