Anonymous and fault-tolerant shared-memory computing
type: Item
instance of: scholarly article
title: Anonymous and fault-tolerant shared-memory computing
zbMATH Open document ID: 1266.68054
author: Rachid Guerraoui
author: Eric Ruppert
published in: Distributed Computing
publication date: 2013-06-20T00:00:00Z
full work available at URL: http://infoscience.epfl.ch/record/269474
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6177652
zbMATH Keywords: anonymous
zbMATH Keywords: shared memory
zbMATH Keywords: timestamps
zbMATH Keywords: snapshots
zbMATH Keywords: consensus
MaRDI profile type: Publication
OpenAlex ID: W2067397086
cites work: Atomic snapshots of shared memory
cites work: Composite registers
cites work: Computation in networks of passively mobile finite-state sensors
cites work: Relationships between broadcast and shared memory in reliable anonymous distributed systems
cites work: Wait-free consensus with infinite arrivals
cites work: Computing in totally anonymous asynchronous shared memory systems
cites work: Distributed Computing
cites work: On the importance of having an identity or, is consensus really universal?
cites work: Polylog randomized wait-free consensus
cites work: The Space Complexity of Unbounded Timestamps
cites work: Time-space tradeoffs for implementations of snapshots
cites work: Randomized wait-free concurrent objects (extended abstract)
cites work: The topological structure of asynchronous computability
cites work: The Las-Vegas Processor Identity Problem (How and When to Be Unique)
cites work: The processor identity problem
cites work: Q4525687
cites work: Space efficient processor identity protocol
DOI: 10.1007/S00446-007-0042-0
description: scientific article; zbMATH DE number 6177652