Strong order-preserving renaming in the synchronous message passing model

DOI10.1016/J.TCS.2010.06.001MaRDI QIDQ708233zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Brief announcement
• Byzantine renaming in synchronous systems with \(t < N\)
• Renaming in synchronous message passing systems with Byzantine failures
• Renaming in an asynchronous environment
• Renaming in Message Passing Systems with Byzantine Failures

Cites work

• scientific article; zbMATH DE number 1696672 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• A new fault-tolerant algorithm for clock synchronization
• A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
• Adaptive and efficient algorithms for lattice agreement and renaming
• Asynchronous approximate agreement
• Electing a leader in a synchronous ring
• Exploiting omissive faults in synchronous approximate agreement
• Fully-Adaptive Algorithms for Long-Lived Renaming
• Immediate atomic snapshots and fast renaming
• New hybrid fault models for asynchronous approximate agreement
• Principles of Distributed Systems
• Reaching approximate agreement in the presence of faults
• Renaming in Message Passing Systems with Byzantine Failures
• Renaming in an asynchronous environment
• Renaming in synchronous message passing systems with Byzantine failures
• The topological structure of asynchronous computability
• Time bounds for decision problems in the presence of timing uncertainty and failures
• Wait-free algorithms for fast, long-lived renaming
• Wait-free implementations in message-passing systems

Cited in

(3)

• Brief announcement
• Renaming in synchronous message passing systems with Byzantine failures
• Tight bounds for asynchronous renaming

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

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