Partial synchrony based on set timeliness
type: Item
instance of: scholarly article
title: Partial synchrony based on set timeliness
zbMATH Open document ID: 1257.68034
author: Carole Delporte-Gallet
author: Hugues Fauconnier
author: Sam Toueg
author: Marcos Kawazoe Aguilera
published in: Distributed Computing
publication date: 2013-02-04T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6134271
zbMATH Keywords: read-write shared memory systems
zbMATH Keywords: set timeliness
zbMATH Keywords: partial synchrony
zbMATH Keywords: consensus
MaRDI profile type: Publication
full work available at URL: s00446-012-0158-8
OpenAlex ID: W2042734235
cites work: Communication-efficient leader election and consensus with limited link synchrony
cites work: On implementing omega in systems with weak reliability and synchrony assumptions
cites work: Partial synchrony based on set timeliness
cites work: Adaptive progress: a gracefully-degrading liveness property
cites work: Generalized FLP impossibility result for t-resilient asynchronous computations
cites work: A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
cites work: The weakest failure detector for solving consensus
cites work: Unreliable failure detectors for reliable distributed systems
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Failure detectors are schedulers
cites work: On set consensus numbers
cites work: The topological structure of asynchronous computability
cites work: Implementing unreliable failure detectors with unknown membership
cites work: Distributed Computing
cites work: k-set agreement with limited accuracy failure detectors
cites work: Failure detectors and the wait-free hierarchy (extended abstract)
cites work: Failure detectors encapsulate fairness
cites work: The Iterated Restricted Immediate Snapshot Model
cites work: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
cites work: Anti-\(\Omega \): the weakest failure detector for set agreement
DOI: 10.1007/S00446-012-0158-8
description: scientific article; zbMATH DE number 6134271