Tight failure detection bounds on atomic object implementations

DOI10.1145/1734213.1734216zbMath1327.68044OpenAlexW2137258273WikidataQ60019890 ScholiaQ60019890MaRDI QIDQ3578204

Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui

Publication date: 14 July 2010

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1734213.1734216

zbMATH Keywords

failure detectionatomic objects

Mathematics Subject Classification ID

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

Related Items (10)

A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Anonymous asynchronous systems: the case of failure detectors ⋮ The weakest failure detector to implement a register in asynchronous systems with hybrid communication ⋮ On set consensus numbers ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ What Can be Computed in a Distributed System? ⋮ The weakest failure detector for eventual consistency ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Wait-freedom with advice ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems

This page was built for publication: Tight failure detection bounds on atomic object implementations