Summary: From Total Order to Database Replication
Yair Amir and Ciprian Tutu
Department of Computer Science
Johns Hopkins University
Baltimore, MD 21218, USA
{yairamir, ciprian}@cnds.jhu.edu
Technical Report
CNDS­2001­6
http://www.cnds.jhu.edu
November 5, 2001
Abstract
This paper presents in detail an e#cient and provably correct algorithm for database replication
over partitionable networks. Our algorithm avoids the need for end­to­end acknowledgments for
each action while supporting network partitions and merges and allowing dynamic instantiation
of new replicas. One round of end­to­end acknowledgments is required only upon a membership
change event such as a network partition. New actions may be introduced to the system at any
point, not only while in a primary component. We show how performance can be further improved
for applications that allow relaxation of consistency requirements. We provide experimental results
that demonstrate the superiority of this approach.
1 Introduction

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

Collections: Computer Technologies and Information Sciences