From W to : A simple bounded quiescent reliable broadcast-based transformation

DOI10.1016/J.JPDC.2006.06.002zbMATH Open1110.68351OpenAlexW2019420507MaRDI QIDQ868046FDOQ868046

Corentin Travers, Michel Raynal, Achour Mostefaoui, Sergio Rajsbaum

Publication date: 19 February 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.06.002

Recommendations

• On implementing omega in systems with weak reliability and synchrony assumptions
• On Quiescent Reliable Communication
• Communication-efficient and crash-quiescent omega with unknown membership
• A necessary and sufficient condition for transforming limited accuracy failure detectors
• On implementing omega with weak reliability and synchrony assumptions

zbMATH Keywords

fault-tolerancedistributed algorithmasynchronous systemreliable broadcastfailure detectorprocess crasheventual leaderlayer abstraction

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cited In (3)

• On implementing omega with weak reliability and synchrony assumptions
• On the computability power and the robustness of set agreement-oriented failure detector classes
• A simple and communication-efficient omega algorithm in the crash-recovery model

This page was built for publication: From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation

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