A pessimistic consistency control algorithm for replicated files which achieves high availability

Author

Jajodia, Sushil ; Mutchler, David

Volume

15

Issue

1

fYear

1989

fDate

1/1/1989 12:00:00 AM

Firstpage

39

Lastpage

46

Abstract

A consistency control algorithm is described for managing replicated files in the face of network partitioning due to node or communication link failures. It adopts a pessimistic approach in that mutual consistency among copies of a file is maintained by permitting files to be accessed only in a single partition at any given time. The algorithm simplifies the Davcev-Burkhard dynamic voting algorithm (1985) and also improves its availability by adding the notion of linearly ordered copies. A proof that any pessimistic algorithm with fresh reads is one-copy serializable is given

Keywords

concurrency control; data integrity; distributed databases; communication link failures; dynamic voting algorithm; fresh reads; high availability; mutual consistency; network partitioning; one-copy serializable; pessimistic consistency control algorithm; replicated files; Availability; Communication system control; Computer science; Distributed databases; Heuristic algorithms; Information systems; Laboratories; Partitioning algorithms; Protocols; Voting;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.21724

Filename

21724