Implementing atomic actions on decentralized data
David P. Reed · ACM Transactions on Computer Systems · 1983
Synchronization of accesses to shared data and recovering the state of such data in the case of failures are really two aspects of the same problem--implementing atomic actions on a related set of data items.In this paper a mechanism that solves both problems simultaneously in a way that is compatible with requirements of decentralized systems is described.In particular, the correct construction and execution of a new atomic action can be accomplished without knowledge of all other atomic actions in the system that might execute concurrently.Further, the mechanisms degrade gracefully if parts of the system fail: only those atomic actions that require resources in failed parts of the system are prevented from executing, and there is no single coordinator that can fail and bring down the whole system.
Cited by 307 works. doi:10.1145/357353.357355 Open-access PDF
Authors
References
- Time, clocks, and the ordering of events in a distributed system
- The notions of consistency and predicate locks in a database system
- Notes on data base operating systems
- On the criteria to be used in decomposing systems into modules
- TENEX, a paged time sharing system for the PDP - 10
- Programming semantics for multiprogrammed computations
- System structure for software fault tolerance
- Process structuring, synchronization, and recovery using atomic actions