Local states in distributed computations
- 1 April 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 28 (2) , 65-72
- https://doi.org/10.1145/198153.198161
Abstract
If events produced by processes of a distributed computation are generally supposed to be instantaneous, it is not the case for local states generated by these events. Due to message exchanges and synchronization local states have some duration. This paper defines notions about local states such as weak precedence, strong precedence, weak concurrency and strong concurrency . Moreover a few formulas based on vector clocks, and consequently usable in an operational context, are introduced to decide about relations between local states. These relations and formulas can be used either to debug, test or analyze distributed programs (especially for global properties detection) or to define consistent checkpoints.Keywords
This publication has 5 references indexed in Scilit:
- Detecting relational global predicates in distributed systemsPublished by Association for Computing Machinery (ACM) ,1993
- Restoring consistent global states of distributed computationsPublished by Association for Computing Machinery (ACM) ,1991
- Consistent detection of global predicatesPublished by Association for Computing Machinery (ACM) ,1991
- Efficient solutions to the replicated log and dictionary problemsPublished by Association for Computing Machinery (ACM) ,1984
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978