A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability

  • Authors:
  • Sushil Jajodia;David Mutchler

  • Affiliations:
  • George Mason Univ., Fairfax, VA;Univ. of Tennessee, Knoxville

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

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.