Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network.
Abstract
We present a simple algorithm for maintaining a replicated distributed dictionary which achieves high availability of data, rapid processing of atomic actions, efficient utilization of storage, and tolerance to node or network failures including lost or duplicated messages. It does not require transaction logs, synchronized clocks, or other complicated mechanisms for its operation. It achieves consistency contraints which are considerably weaker than serial consistency but nonetheless are adequate for many dictionary applications such as electronic appointment calendars and mail systems. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1982
- Accession Number
- ADA111261
Entities
People
- Alan Michael
- Michael J. Fischer
Organizations
- University of Washington