Computing in totally anonymous asynchronous shared memory systems

DOI10.1006/INCO.2001.3119zbMATH Open1009.68012OpenAlexW1977549931MaRDI QIDQ1854512FDOQ1854512

Authors: Hagit Attiya, Alla Gorbach, Shlomo Moran 

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/93b1afa9c1947beeba3a8e1135fb89ba83979609

Recommendations

• Anonymous and fault-tolerant shared-memory computing
• Distributed Computing
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• Mutual exclusion in fully anonymous shared memory systems
• Computing functions on asynchronous anonymous networks

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Computing on an anonymous ring
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Bounds on shared memory for mutual exclusion
• On the space complexity of randomized synchronization
• Time and Space Lower Bounds for Nonblocking Implementations
• Possibility and impossibility results in a shared memory environment
• The Wakeup Problem
• A Lower Bound on Wait-Free Counting
• Title not available (Why is that?)
• Closed schedulers: a novel technique for analyzing asynchronous protocols

Cited In (25)

• Byzantine agreement with homonyms in synchronous systems
• Computing with infinitely many processes
• Anonymous and fault-tolerant shared-memory computing
• Fast rendezvous on a cycle by agents with different speeds
• Byzantine agreement with homonyms
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• Fault-tolerant consensus with an abstract MAC layer
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• Hundreds of impossibility results for distributed computing
• A visit to mutual exclusion in seven dates
• On the importance of having an identity or, is consensus really universal?
• Leader-based de-anonymization of an anonymous read/write memory
• Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
• The computational power of population protocols
• Anonymous Shared Memory
• Title not available (Why is that?)
• Agreeing within a few writes
• Generalized symmetry breaking tasks and nondeterminism in concurrent objects
• Mutual exclusion in fully anonymous shared memory systems
• A knowledge-based analysis of global function computation
• Efficient algorithms for anonymous Byzantine agreement
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• Election in fully anonymous shared memory systems: tight space bounds and algorithms
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• Relationships between broadcast and shared memory in reliable anonymous distributed systems

This page was built for publication: Computing in totally anonymous asynchronous shared memory systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854512)