Wait-free implementations in message-passing systems
From MaRDI portal
Publication:1292433
DOI10.1016/S0304-3975(98)00242-4zbMATH Open0916.68065OpenAlexW2172260702MaRDI QIDQ1292433FDOQ1292433
Authors: Soma Chaudhuri, Mark Tuttle, Maurice Herlihy 
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00242-4
Recommendations
data structuresdistributed algorithmsincrement registermessage-passing modelstrong renamingwait-free algorithms
Cites Work
- Renaming in an asynchronous environment
- Electing a leader in a synchronous ring
- Time, clocks, and the ordering of events in a distributed system
- The Weak Byzantine Generals Problem
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Knowledge and common knowledge in a distributed environment
- Randomized wait-free concurrent objects (extended abstract)
- A lower bound for the time to assure interactive consistency
- Programming simultaneous actions using common knowledge
- Modelling knowledge and action in distributed systems
- The asynchronous computability theorem for t-resilient tasks
Cited In (8)
- Generating fast indulgent algorithms
- Strong order-preserving renaming in the synchronous message passing model
- Hundreds of impossibility results for distributed computing
- Renaming in synchronous message passing systems with Byzantine failures
- Extending the wait-free hierarchy to multi-threaded systems
- Tight bounds for asynchronous renaming
- Fully-adaptive algorithms for long-lived renaming
- Efficient and Robust Sharing of Memory in Message-Passing Systems
This page was built for publication: Wait-free implementations in message-passing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292433)
