Delay-optimal quorum consensus for distributed systems

Author

Fu, Ada Waichee

Author_Institution

Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong

Volume

8

Issue

1

fYear

1997

fDate

1/1/1997 12:00:00 AM

Firstpage

59

Lastpage

69

Abstract

Given a set of nodes S, a coterie is a set of pairwise intersecting subsets of S. Each element in a coterie is called a quorum. Mutual exclusion in a distributed system can be achieved if each request is required to gel consensus from a quorum of nodes. This technique of quorum consensus is also used for replicated distributed database systems, and bicoteries and wr-coteries have been defined to capture the requirements of read and write operations in user transactions. The author is interested in finding coteries, bicoteries, and wr-coteries with optimal communication delay. The protocols take into account the network topology. They design delay-optimal quorum consensus protocols for network topologies of trees, rings, and clustered networks

Keywords

delays; network topology; protocols; replicated databases; transaction processing; wide area networks; bicoteries; clustered networks; coterie; delay-optimal quorum consensus; distributed systems; mutual exclusion; network topology; nodes; optimal communication delay; pairwise intersecting subsets; protocols; read operations; replicated distributed database systems; rings; trees; user transactions; wr-coteries; write operations; Artificial satellites; Clocks; Concurrency control; Costs; Database systems; Delay effects; Delay systems; Helium; Network topology; Protocols;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.569655

Filename

569655