Partial synchrony based on set timeliness

DOI10.1007/s00446-012-0158-8zbMath1257.68034OpenAlexW2042734235MaRDI QIDQ1938365

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

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-012-0158-8

zbMATH Keywords

consensuspartial synchronyread-write shared memory systemsset timeliness

Mathematics Subject Classification ID

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

Related Items (4)

A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Wait-freedom with advice ⋮ Characterizing Consensus in the Heard-Of Model ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks

Cites Work

• On set consensus numbers
• Implementing unreliable failure detectors with unknown membership
• Adaptive progress: a gracefully-degrading liveness property
• Anti-\(\Omega \): the weakest failure detector for set agreement
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Failure detectors encapsulate fairness
• On implementing omega in systems with weak reliability and synchrony assumptions
• The topological structure of asynchronous computability
• The Iterated Restricted Immediate Snapshot Model
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Partial synchrony based on set timeliness
• k-set agreement with limited accuracy failure detectors
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Failure detectors and the wait-free hierarchy (extended abstract)
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Distributed Computing
• Failure detectors are schedulers
• Communication-efficient leader election and consensus with limited link synchrony

This page was built for publication: Partial synchrony based on set timeliness