ACM Transactions on Computer Systems · 1986 · 246 citations · 21 references
ComputingComputer ScienceComputer SystemsData ManagementDistributed SystemsFault ToleranceConcurrency ControlConsensus ProtocolsData ReplicationDistributed ComputingDistributed DatabasesDistributed StorageAbstract Data TypesAlgebraic Data TypesQuorum SystemsQuorum-based ReplicationReconfigurationRuntime Reconfiguration
Replication can enhance the availability of data in distributed systems. This paper introduces a new method for managing replicated data. Unlike many methods that support replication only for uninterpreted files, this method systematically exploits type-specific properties of objects such as sets, queues, or directories to provide more effective replication. Each operation requires the cooperation of a certain number of sites for its successful completion. A quorum for an operation is any such set of sites. Necessary and sufficient constraints on quorum intersections are derived from an analysis of the data type's algebraic structure. A reconfiguration method is proposed that permits quorums to be changed dynamically. By taking advantage of type-specific properties in a general and systematic way, this method can realize a wider range of availability properties and more flexible reconfiguration than comparable replication methods.
21
The notions of consistency and predicate locks in a database system
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie et al. · Communications of the ACM · 1976 · 2K citations · Full text
Weighted voting for replicated data
David K. Gifford · 1979 · 1.3K citations · Full text
How to assign votes in a distributed system
Héctor García-Molina, Daniel Barbará · Journal of the ACM · 1985 · 563 citations · Full text
Andrew Birrell, Roy Levin, Michael Schroeder et al. · Communications of the ACM · 1982 · 447 citations · Full text