The weakest failure detectors to boost obstruction-freedom
type: Item
instance of: scholarly article
title: The weakest failure detectors to boost obstruction-freedom
zbMATH Open document ID: 1266.68052
author: Rachid Guerraoui
author: Michał Kapałka
author: Petr Kuznetsov
published in: Distributed Computing
publication date: 2013-06-20T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6177668
zbMATH Keywords: shared memory
zbMATH Keywords: obstruction-free
zbMATH Keywords: non-blocking
zbMATH Keywords: wait-free
zbMATH Keywords: contention manager
zbMATH Keywords: failure detector
MaRDI profile type: Publication
full work available at URL: s00446-007-0046-9
OpenAlex ID: W2047745508
cites work: Q4436044
cites work: Distributed Computing
cites work: Q4398822
cites work: The weakest failure detector for solving consensus
cites work: Unreliable failure detectors for reliable distributed systems
cites work: Impossibility of distributed consensus with one faulty process
cites work: Q2766889
cites work: Indulgent algorithms (preliminary version)
cites work: Toward a theory of transactional contention managers
cites work: Randomized wait-free concurrent objects (extended abstract)
cites work: Robust wait-free hierarchies
cites work: A performance evaluation of lock-free synchronization protocols
cites work: Wait-free algorithms for fast, long-lived renaming
DOI: 10.1007/S00446-007-0046-9
description: scientific article; zbMATH DE number 6177668