How to Select a Replication Protocol According to Scalability, Availability, and Communication Overhead
Reliable Distributed Systems, IEEE Symposium on (2001)
New Orleans, Louisiana
Oct. 28, 2001 to Oct. 31, 2001
R. Jiménez-Peris , Technical University of Madrid (UPM)
M. Patiño-Martínez , Technical University of Madrid (UPM)
B. Kemme , McGill University
G. Alonso , Swiss Federal Institute of Technology (ETHZ)
Data replication is playing an increasingly important role in the design of parallel information systems. In particular, the widespread use of cluster architectures in high-performance computing has created many opportunities for applying data replication techniques in new areas. For instance, as part of work related to cluster computing in bioinformatics, we have been confronted with the problem of having to chose an optimal replication strategy in terms of scalability, availability, and communication overhead. Thus, we have evaluated several representative replication protocols in order to better understand their behavior in practice. The results obtained are surprising in that they challenge many of the assumptions behind existing protocols. Our evaluation indicates that the conventional read-one/write-all approach is the best choice for a large range of applications requiring data replication. We believe this is an important result for anybody developing code for computing clusters as the read-one/write-all strategy is much simpler to implement and more flexible than quorum-based approaches. In this paper we show that, in addition, it is also the best choice using a number of other selection criteria.
data replication, quorums, transactions
G. Alonso, M. Patiño-Martínez, R. Jiménez-Peris and B. Kemme, "How to Select a Replication Protocol According to Scalability, Availability, and Communication Overhead," Reliable Distributed Systems, IEEE Symposium on(SRDS), New Orleans, Louisiana, 2001, pp. 0024.