Strong order-preserving renaming in the synchronous message passing model

DOI10.1016/j.tcs.2010.06.001zbMath1206.68355OpenAlexW1964746194MaRDI QIDQ708233

Michael S. Okun

Publication date: 11 October 2010

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

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

zbMATH Keywords

crash failuresrenamingmessage passing systemsapproximate agreementwait-free computation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Related Items (1)

Tight Bounds for Asynchronous Renaming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new fault-tolerant algorithm for clock synchronization
• Wait-free implementations in message-passing systems
• Asynchronous approximate agreement
• Wait-free algorithms for fast, long-lived renaming
• Renaming in synchronous message passing systems with Byzantine failures
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• The topological structure of asynchronous computability
• Exploiting omissive faults in synchronous approximate agreement
• Renaming in an asynchronous environment
• Renaming in Message Passing Systems with Byzantine Failures
• Fully-Adaptive Algorithms for Long-Lived Renaming
• Reaching approximate agreement in the presence of faults
• Electing a leader in a synchronous ring
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• New hybrid fault models for asynchronous approximate agreement
• Immediate atomic snapshots and fast renaming
• Principles of Distributed Systems
• Time bounds for decision problems in the presence of timing uncertainty and failures

This page was built for publication: Strong order-preserving renaming in the synchronous message passing model