Eventually Perfect Failure Detectors Using ADD Channels

DOI10.1007/978-3-540-74742-0_44MaRDI QIDQ3523237zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• Brief Announcement: Leader Election in the ADD Communication Model
• Automatic Classification of Eventual Failure Detectors
• Perfect failure detection with very few bits

Cited in

(5)

• Wait-Free Dining Under Eventual Weak Exclusion
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• Communication-efficient and crash-quiescent omega with unknown membership
• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels
• Passive fault tolerant perfect tracking with additive faults

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

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