A simple characterization of asynchronous computations

DOI10.1016/J.TCS.2014.07.022zbMATH Open1303.68031OpenAlexW2087979599MaRDI QIDQ477089FDOQ477089

Authors: Yehuda Afek, Eli Gafni 

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

Recommendations

• A simple constructive computability theorem for wait-free computation
• The topological structure of asynchronous computability
• An asynchronous computability theorem for fair adversaries
• Initial failures in distributed computations
• Synchronous, asynchronous, and causally ordered communication

zbMATH Keywords

distributed algorithmsshared memorywait-freeasynchronous computabilityread writesubdivided simplex

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• A simple characterization of asynchronous computations
• A hierarchy of equivalences for asynchronous calculi
• Toward a Topological Characterization of Asynchronous Complexity
• Communication Complexity of Wait-Free Computability in Dynamic Networks
• Title not available (Why is that?)

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

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