Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Derivation of a termination detection algorithm for distributed computations

From MaRDI portal
Publication:2216413
Jump to:navigation, search

zbMath1451.68121MaRDI QIDQ2216413

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

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)


Related Items

Fine-grained concurrent completion, A distributed algorithm for distributed termination, On the proof of a distributed algorithm, A fully distributed termination detection scheme, 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, Synchronous, asynchronous, and causally ordered communication, Parallel adaptation of general three-dimensional hybrid meshes, Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP, An assertional proof of Rana's algorithm



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2216413&oldid=14754509"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 2 February 2024, at 04:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki