Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (Q1822234)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP |
scientific article |
Statements
Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP (English)
0 references
1987
0 references
A new version of the Snapshot Algorithm of \textit{K. M. Chandy} and \textit{L. Lamport} [ACM Trans. Comput. Syst. 3, 63-75 (1985)] is presented. It considers synchronous communications and partially ordered semantics and allows for repeated snapshots. Its implementation in the language CSP is described: it is symmetric, generic and bounded in storage. It yields a symmetric and generic solution to the 'Distributed Termination Detection' problem of Francez.
0 references
Snapshot Algorithm
0 references
partially ordered semantics
0 references
Distributed Termination Detection
0 references
0 references
