A consistent observation of a given distributed computation is a sequence of global states that could be produced by executing that computation on a monoprocessor system. Therefore a distributed execution generally accepts several consistent observations. This paper investigates global states shared
Distributed snapshots: determining global states of distributed systems
โ Scribed by Chandy, K. Mani; Lamport, Leslie
- Book ID
- 120633989
- Publisher
- Association for Computing Machinery
- Year
- 1985
- Tongue
- English
- Weight
- 969 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0734-2071
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper shows that the memory overhead of distributed snapshots is unbounded. Several techniques are suggested for bounding it: bounded memory-overhead versions of distributed snapshots for specific problems, like termination detection and deadlock detection; use of alternative protocols; or use
The domain of a global function is the set of all global states of an execution of a distributed program. We show how to monitor a program in order to determine if there exists a global state in which the sum x 1 + x 2 + 1 1 1 + x N exceeds some constant K, where x i is defined in process i. We exam
A method 1s presented for determmmg fimte stabdlty regons for dlstnbuted parameter systems whose transient behavior IS governed by a smgle parabolic dlfferentlal equation The case of an a&abatlc catalytic reactlon IS &scussed m detad However, the same techmques can be apphed to many other systems m