Show simple item record

dc.contributor.authorRabinovich, Michael, 1955-en_US
dc.date.accessioned2009-10-06T16:51:23Z
dc.date.available2009-10-06T16:51:23Z
dc.date.issued1994en_US
dc.identifier.otherb3268678xen_US
dc.identifier.other32611561en_US
dc.identifier.otherThesis 43116en_US
dc.identifier.urihttp://hdl.handle.net/1773/6905
dc.descriptionThesis (Ph. D.)--University of Washington, 1994en_US
dc.description.abstractReplication is a critical aspect of large-scale distributed systems. Without it, the size of a system is limited by factors such as the increased risk of component failures, the overloading of popular services, and access latency to remote parts of the system.Replicating alleviates these problems by allowing service to continue despite failures using remaining replicas, and by distributing requests for a given service among multiple servers. However, replicated systems incur significant performance overhead for maintaining multiple replicas and keeping them mutually consistent. Managing replication efficiently is therefore important in building large-scale distributed systems.This dissertation concentrates on quorum-based replication management. It proposes several ways to efficiently manage replication in systems using different types of quorums.First, we study structure-based quorums, which are attractive because they result in low-overhead replica management when the number of replicas is high. We propose a way to significantly improve system availability in protocols using these quorums. We also study in depth the performance of a particular class of these quorums based on a grid structure.Second, for voting-based quorums, we propose a way to include new/repaired replicas into the system and exclude failed/disconnected/deactivated replicas, asynchronously with user operations. Thus, such reconfiguration does not involve any system interruption and can be done more freely for various purposes, e.g., improving data availability, migrating data, or redistributing load.Third, we propose a way to efficiently manage read-one-write-all (ROWA) replication. Protocols based on ROWA quorums maintain consistency by reading one copy of the data and writing all copies. They are especially attractive because they provide for highly efficient and fault-tolerant read operations, and because many services and data in distributed systems fall under the mostly-read category. The obvious weakness of ROWA, which has prevented it from being widely used in commercial wide-area networks, is lack of fault-tolerance for writes. This thesis proposes a new ROWA protocol that provides fault-tolerant write operations without any significant deterioration of read properties. This protocol offers immediate benefits to current systems.Finally, the thesis studies some issues that are common for all types of quorums, including semantics of write operations and efficient protocols for transaction commitment.en_US
dc.format.extentx, 216 p.en_US
dc.language.isoen_USen_US
dc.rightsCopyright is held by the individual authors.en_US
dc.rights.urien_US
dc.subject.otherTheses--Computer science and engineeringen_US
dc.titleEfficient replication management in distributed systemsen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record