Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies

DOI10.1007/978-3-540-30186-8_21MaRDI QIDQ5464199zbMATH OpenOpenAlexFDO

Authors Neeraj Mittal, S. Venkatesan, Sathya Peri

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30186-8_21

zbMATH Keywords

termination detectionoptimal message complexityquiescence detectionoptimal detection latency

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• A family of optimal termination detection algorithms
• An efficient delay-optimal distributed termination detection algorithm
• scientific article; zbMATH DE number 3938558
• Distributed termination detection for dynamic systems
• Distributed algorithms for static and dynamic termination detection

Cited in

(5)

• Distributed Computing
• Safe termination detection in an asynchronous distributed system when processes may crash and recover
• A family of optimal termination detection algorithms
• An efficient delay-optimal distributed termination detection algorithm
• scientific article; zbMATH DE number 1930745 (Why is no real title available?)

This page was built for publication: Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies

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