The Community for Technology Leaders
Green Image
<p>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.</p>
pessimistic consistency control algorithm; replicated files; high availability; network partitioning; communication link failures; mutual consistency; dynamic voting algorithm; fresh reads; one-copy serializable; concurrency control; data integrity; distributed databases.
D. Mutchler, S. Jajodia, "A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability", IEEE Transactions on Software Engineering, vol. 15, no. , pp. 39-46, January 1989, doi:10.1109/32.21724
154 ms
(Ver 3.3 (11022016))