Eventually Perfect Failure Detectors Using ADD Channels

DOI10.1007/978-3-540-74742-0_44zbMath1491.68026OpenAlexW1590586151MaRDI QIDQ3523237

Srikanth Sastry, Scott M. Pike

Publication date: 2 September 2008

Published in: Parallel and Distributed Processing and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74742-0_44

zbMATH Keywords

partial synchronyfailure detectorscommunication models

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (4)

An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values ⋮ Implementing ♢P with Bounded Messages on a Network of ADD Channels ⋮ Communication-efficient and crash-quiescent omega with unknown membership ⋮ Wait-Free Dining Under Eventual Weak Exclusion

This page was built for publication: Eventually Perfect Failure Detectors Using ADD Channels