Derivation of a termination detection algorithm for distributed computations

MaRDI QIDQ2216413zbMATH OpenFDO

Authors W. H. J. Feijen, A. J. M. van Gasteren, Edsger W. Dijkstra

Publication date 16 December 2020

Published in Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited in

(13)

• A distributed algorithm for distributed termination
• On the proof of a distributed algorithm
• A fully distributed termination detection scheme
• An assertional proof of Rana's algorithm
• Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP
• Fine-grained concurrent completion
• Synchronous, asynchronous, and causally ordered communication
• Mapping tree-structured combinatorial optimization problems onto parallel computers
• Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
• Distributed termination detection with counters
• Comments on ``On the proof of a distributed algorithm: Always-true is not invariant
• Comments on Ring based termination detection algorithm for distributed computations
• Parallel adaptation of general three-dimensional hybrid meshes

This page was built for publication: Derivation of a termination detection algorithm for distributed computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216413)