A simple characterization of asynchronous computations

DOI10.1016/j.tcs.2014.07.022zbMath1303.68031OpenAlexW2087979599MaRDI QIDQ477089

Eli Gafni, Yehuda Afek

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.022

zbMATH Keywords

distributed algorithmsshared memorywait-freeasynchronous computabilityread writesubdivided simplex

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Communication Complexity of Wait-Free Computability in Dynamic Networks ⋮ A simple characterization of asynchronous computations

Cites Work

• Unnamed Item
• Unnamed Item
• A simple characterization of asynchronous computations
• The Heard-Of model: computing in distributed systems with benign faults
• Agreement in synchronous networks with ubiquitous faults
• The unified structure of consensus
• Unifying synchronous and asynchronous message-passing models
• Round-by-round fault detectors (extended abstract)
• Distributed computation in dynamic networks
• The topological structure of asynchronous computability
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• Reaching approximate agreement in the presence of faults
• Bounds on information exchange for Byzantine agreement
• Impossibility of distributed consensus with one faulty process
• Electing a leader in a synchronous ring
• Reaching Agreement in the Presence of Faults
• Sharing memory robustly in message-passing systems
• Time is not a healer
• Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming

This page was built for publication: A simple characterization of asynchronous computations