On implementing omega in systems with weak reliability and synchrony assumptions

DOI10.1007/S00446-008-0068-YMaRDI QIDQ2377261zbMATH OpenOpenAlexFDO

Authors Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg, Marcos Kawazoe Aguilera

Publication date 28 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-008-0068-y

Mathematics Subject Classification ID

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

Recommendations

• On implementing omega with weak reliability and synchrony assumptions
• Communication-efficient and crash-quiescent omega with unknown membership
• Implementing the Omega failure detector in the crash-recovery failure model

Cites work

• scientific article; zbMATH DE number 1696684 (Why is no real title available?)
• scientific article; zbMATH DE number 2006647 (Why is no real title available?)
• Communication-efficient leader election and consensus with limited link synchrony
• Distributed Computing
• Distributed Computing
• From an intermittent rotating star to a leader
• Implementing unreliable failure detectors with unknown membership
• On implementing omega in systems with weak reliability and synchrony assumptions
• On the minimal synchronism needed for distributed consensus
• Revisiting the PAXOS algorithm
• The weakest failure detector for solving consensus
• The weakest failure detector to solve nonuniform consensus
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• Unreliable failure detectors for reliable distributed systems

Cited in

(18)

• Communication-efficient failure detection and consensus in omission environments
• On implementing omega in systems with weak reliability and synchrony assumptions
• On implementing omega with weak reliability and synchrony assumptions
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
• A case study on parametric verification of failure detectors
• A simple and communication-efficient omega algorithm in the crash-recovery model
• Adaptive progress: a gracefully-degrading liveness property
• The asynchronous bounded-cycle model
• Consensus in anonymous asynchronous systems with crash-recovery and omission failures
• From W to : A simple bounded quiescent reliable broadcast-based transformation
• Distributed Computing
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• Failure detectors encapsulate fairness
• Partial synchrony based on set timeliness
• The Theta-Model: achieving synchrony without clocks
• Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
• Implementing the Omega failure detector in the crash-recovery failure model
• Stabilizing leader election in partial synchronous systems with crash failures

This page was built for publication: On implementing omega in systems with weak reliability and synchrony assumptions

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