A modular approach to shared-memory consensus, with applications to the probabilistic-write model
type: Item
instance of: scholarly article
title: A modular approach to shared-memory consensus, with applications to the probabilistic-write model
zbMATH Open document ID: 1259.68015
author: James Aspnes
published in: Distributed Computing
publication date: 2013-02-04T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6134270
zbMATH Keywords: consensus
zbMATH Keywords: randomization
zbMATH Keywords: shared memory
zbMATH Keywords: weak adversaries
MaRDI profile type: Publication
full work available at URL: s00446-011-0134-8
OpenAlex ID: W2031281709
cites work: Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
cites work: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
cites work: Reaching Agreement in the Presence of Faults
cites work: Impossibility of distributed consensus with one faulty process
cites work: Randomized wait-free concurrent objects (extended abstract)
cites work: Q3549610
cites work: Approximate shared-memory counting despite a strong adversary
cites work: Lower Bounds for Randomized Consensus under a Weak Adversary
cites work: Efficient asynchronous consensus with the weak adversary scheduler
cites work: Fast randomized consensus using shared memory
cites work: Polylog randomized wait-free consensus
cites work: Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
cites work: Real-time object sharing with minimal system support
cites work: Wait-free synchronization in multiprogrammed systems
cites work: Fast deterministic consensus in a noisy environment
cites work: A modular approach to shared-memory consensus, with applications to the probabilistic-write model
cites work: Time- and Space-Efficient Randomized Consensus
cites work: Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
cites work: Randomized consensus in expected O(n log n) individual work
cites work: On generalized graphs
cites work: Q4255576
DOI: 10.1007/S00446-011-0134-8
description: scientific article; zbMATH DE number 6134270