Wait-free implementations in message-passing systems
type: Item
instance of: scholarly article
title: Wait-free implementations in message-passing systems
zbMATH Open document ID: 0916.68065
DOI: 10.1016/S0304-3975(98)00242-4
author: Soma Chaudhuri
author: Mark Tuttle
author: Maurice Herlihy
published in: Theoretical Computer Science
publication date: 1999-06-21T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1306154
zbMATH Keywords: distributed algorithms
zbMATH Keywords: data structures
zbMATH Keywords: wait-free algorithms
zbMATH Keywords: message-passing model
zbMATH Keywords: increment register
zbMATH Keywords: strong renaming
MaRDI profile type: Publication
cites work: Renaming in an asynchronous environment
cites work: A lower bound for the time to assure interactive consistency
cites work: Impossibility of distributed consensus with one faulty process
cites work: Electing a leader in a synchronous ring
cites work: Modelling knowledge and action in distributed systems
cites work: Knowledge and common knowledge in a distributed environment
cites work: Randomized wait-free concurrent objects (extended abstract)
cites work: The asynchronous computability theorem for t-resilient tasks
cites work: Time, clocks, and the ordering of events in a distributed system
cites work: The Weak Byzantine Generals Problem
cites work: The Byzantine Generals Problem
cites work: Programming simultaneous actions using common knowledge
cites work: Reaching Agreement in the Presence of Faults
full work available at URL: s0304-3975(98)00242-4
OpenAlex ID: W2172260702
description: scientific article; zbMATH DE number 1306154