Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
type: Item
instance of: scholarly article
title: Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
zbMATH Open document ID: 1189.68021
author: Michel Raynal
author: Corentin Travers
author: Achour Mostefaoui
published in: Theoretical Computer Science
publication date: 2009-12-01T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5641351
zbMATH Keywords: consensus
zbMATH Keywords: efficiency
zbMATH Keywords: lower bound
zbMATH Keywords: round-based algorithm
zbMATH Keywords: set agreement
zbMATH Keywords: synchronous system
zbMATH Keywords: \(t\)-resilience
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.09.002
OpenAlex ID: W2085152632
cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds
cites work: Q4437137
cites work: Complexity of network synchronization
cites work: Simplifying fault-tolerance
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: Uniform consensus is harder than 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: Early stopping in Byzantine agreement
cites work: A lower bound for the time to assure interactive consistency
cites work: Impossibility of distributed consensus with one faulty process
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: From a static impossibility to an adaptive lower bound
cites work: A topological treatment of early-deciding set-agreement
cites work: Tight bounds for \(k\)-set agreement with limited-scope failure detectors
cites work: Algebraic spans
cites work: The topological structure of asynchronous computability
cites work: A simple proof of the uniform consensus synchronous lower bound.
cites work: Q3126969
cites work: Conditions on input vectors for consensus solvability in asynchronous distributed systems
cites work: The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
cites work: Synchronous condition-based consensus
cites work: k-set agreement with limited accuracy failure detectors
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
cites work: Design and Analysis of Distributed Algorithms
cites work: A bivalency proof of the lower bound for uniform consensus
DOI: 10.1016/J.TCS.2009.09.002
description: scientific article; zbMATH DE number 5641351