Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
type: Item
instance of: scholarly article
title: Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
zbMATH Open document ID: 1451.68039
author: Zohir Bouzid
author: Michel Raynal
author: Pierre Sutra
published in: Distributed Computing
publication date: 2018-04-11T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6858080
zbMATH Keywords: anonymous processes
zbMATH Keywords: asynchronous system
zbMATH Keywords: atomic read/write register
zbMATH Keywords: bounded number of registers
zbMATH Keywords: consensus
zbMATH Keywords: distributed algorithm
zbMATH Keywords: distributed computability
zbMATH Keywords: fault tolerance
zbMATH Keywords: \(k\)-set agreement
zbMATH Keywords: obstruction freedom
zbMATH Keywords: process crash
zbMATH Keywords: repeated \(k\)-set agreement
zbMATH Keywords: upper bound
zbMATH Keywords: colorless task
MaRDI profile type: Publication
full work available at URL: s00446-017-0301-7
OpenAlex ID: W2997829659
cites work: Atomic snapshots of shared memory
cites work: Computing in totally anonymous asynchronous shared memory systems
cites work: The complexity of obstruction-free implementations
cites work: Fast randomized consensus using shared memory
cites work: Anonymous asynchronous systems: the case of failure detectors
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: The BG distributed simulation algorithm
cites work: Q5363809
cites work: Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
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: Q4437126
cites work: On the space complexity of set agreement?
cites work: Distributed Computing
cites work: Impossibility of distributed consensus with one faulty process
cites work: Q2729100
cites work: Asynchronous Agreement and Its Relation with Error-Correcting Codes
cites work: On the optimal space complexity of consensus for anonymous processes
cites work: Anonymous and fault-tolerant shared-memory computing
cites work: The topological structure of asynchronous computability
cites work: Concurrent reading and writing
cites work: On interprocess communication. I: Basic formalism
cites work: Computing with infinitely many processes
cites work: Concurrent Reading While Writing
cites work: Concurrent Programming: Algorithms, Principles, and Foundations
cites work: Q3138972
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
cites work: Contention-Sensitive Data Structures and Algorithms
cites work: Wait-free solvability of colorless tasks in anonymous shared-memory model
cites work: A tight space bound for consensus
DOI: 10.1007/S00446-017-0301-7
description: scientific article; zbMATH DE number 6858080