On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
type: Item
instance of: scholarly article
title: On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
zbMATH Open document ID: 1222.68117
author: François Bonnet
author: Michel Raynal
published in: Theoretical Computer Science
publication date: 2011-07-22T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 5931172
zbMATH Keywords: asynchronous systems
zbMATH Keywords: eventual leaders
zbMATH Keywords: failure detectors
zbMATH Keywords: message-passing systems
zbMATH Keywords: quorums
zbMATH Keywords: reduction
zbMATH Keywords: \(k\)-set agreement
zbMATH Keywords: wait-freedom
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.11.007
OpenAlex ID: W1593125439
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Unreliable failure detectors for reliable distributed systems
cites work: The weakest failure detector for solving consensus
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Tight bounds for k -set agreement
cites work: Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
cites work: Sharing is harder than agreeing
cites work: Tight failure detection bounds on atomic object implementations
cites work: The weakest failure detectors to solve certain fundamental problems in distributed computing
cites work: The Weakest Failure Detector for Message Passing Set-Agreement
cites work: The Disagreement Power of an Adversary
cites work: The weakest failure detector for solving k-set agreement
cites work: Failure detectors as type boosters
cites work: Tight bounds for \(k\)-set agreement with limited-scope failure detectors
cites work: The topological structure of asynchronous computability
cites work: \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion
cites work: On the computability power and the robustness of set agreement-oriented failure detector classes
cites work: k-set agreement with limited accuracy failure detectors
cites work: Failure detectors and the wait-free hierarchy (extended abstract)
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
cites work: Anti-Ω
DOI: 10.1016/J.TCS.2010.11.007
description: scientific article; zbMATH DE number 5931172