A family of optimal termination detection algorithms
From MaRDI portal
Publication:1954237
DOI10.1007/S00446-007-0031-3zbMath1266.68220OpenAlexW1978918413MaRDI QIDQ1954237
Sathya Peri, Neeraj Mittal, S. Venkatesan
Publication date: 20 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-007-0031-3
optimal algorithmtermination detectionarbitrary communication topologydiffusing and non-diffusing computationsmonitoring distributed systemsimultaneous and delayed initiationssingle-hop and multi-hop application messages
Related Items (2)
On termination detection in crash-prone distributed systems with failure detectors ⋮ Safe termination detection in an asynchronous distributed system when processes may crash and recover
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How processes learn
- On distributed snapshots
- Termination detection for diffusing computations
- An optimal algorithm for distributed snapshots with causal message ordering
- A distributed solution of the distributed termination problem
- An efficient delay-optimal distributed termination detection algorithm
- Distributed Termination
- Time, clocks, and the ordering of events in a distributed system
- Introduction to Distributed Algorithms
- Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
- Principles of Distributed Systems
This page was built for publication: A family of optimal termination detection algorithms
