Performance evaluation of the quorum consensus replication method

Performance evaluation of the quorum consensus replication method
复制标题

仲裁共识复制方法的性能评估

DOI:
10.1109/ipds.1995.395835
复制
发表时间:
1995
期刊:
Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium
影响因子:
--
通讯作者:
B. Bhargava
B. Bhargava
中科院分区:
--
文献类型:
--
作者:
A. Helal;B. Bhargava

文献摘要

被引文献

相似文献

分布式数据库系统中数据复制的目标是在出现故障时提高数据可用性。使用仲裁共识方法,在n站点系统中,可以容忍多达[(n+1)/2]个站点故障,而不会损失数据可访问性。然而,使用法定人数共识可能非常昂贵,特别是在大型系统中。这是因为必须访问系统中的多个站点才能执行读或写操作。本文描述了仲裁共识方法的一个实际实现,并对其性能进行了实验评估。该实现是在普渡RAID的背景下完成的,这是一个基于局域网的分布式数据库系统,具有广泛的实验基础设施。我们将重点描述管理版本号和选择对象权重和阈值的特殊性。我们还介绍了一项性能评估研究,其中研究了仲裁一致方法的消息流量开销、吞吐量和响应时间以及可用性,并与读一写所有方法进行了比较。
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.<<ETX>>