From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation

DOI10.1016/j.jpdc.2006.06.002zbMath1110.68351OpenAlexW2019420507MaRDI QIDQ868046

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

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)

Related Items (2)

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