Packet efficient implementation of the Omega failure detector

DOI10.1007/978-3-319-49259-9_6zbMath1425.68029arXiv1505.05025OpenAlexW1594173627MaRDI QIDQ5918188

Sébastien Tixeuil, Quentin Bramas, Mikhail V. Nesterenko, Dianne Foreback

Publication date: 22 November 2019

Published in: Lecture Notes in Computer Science, Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.05025

zbMATH Keywords

fault tolerancedistributed algorithmsconsensusfailure detectors

Mathematics Subject Classification ID

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

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distributed leader election algorithm in crash-recovery and omissive systems
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• Stabilizing leader election in partial synchronous systems with crash failures
• Implementing unreliable failure detectors with unknown membership
• Revisiting the PAXOS algorithm
• On implementing omega in systems with weak reliability and synchrony assumptions
• Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
• Algorithms for Extracting Timeliness Graphs
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Distributed Computing: A Locality-Sensitive Approach
• Distributed Computing
• Communication-efficient leader election and consensus with limited link synchrony
• Random Graphs

This page was built for publication: Packet efficient implementation of the Omega failure detector