Resilience of mutual exclusion algorithms to transient memory faults

DOI10.1145/1993806.1993817MaRDI QIDQ2943385zbMATH OpenOpenAlexFDO

Authors Thomas Moscibroda, Rotem Oshman

Publication date 11 September 2015

Published in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1993806.1993817

zbMATH Keywords

fault tolerancemutual exclusiontransient memory faults

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1696665
• Bounds on shared memory for mutual exclusion
• Recoverable mutual exclusion under system-wide failures
• The mutual exclusion problem: part II---Statement and solutions
• Mutual exclusion in asynchronous systems with failure detectors

Cites work

• Almost-Everywhere Secure Computation
• Broadcasting in dynamic radio networks
• Consensus algorithms with one-bit messages
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Fault Tolerance in Networks of Bounded Degree
• Flooding time in edge-Markovian dynamic graphs
• Gradient clock synchronization in dynamic networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Knowledge and common knowledge in a distributed environment
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Optimal gradient clock synchronization in dynamic networks
• Parsimonious flooding in dynamic graphs
• Perfectly secure message transmission
• Programming simultaneous actions using common knowledge
• Reaching Agreement in the Presence of Faults

Cited in

(4)

• Recoverable mutual exclusion
• scientific article; zbMATH DE number 1696665 (Why is no real title available?)
• Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
• Synchronous counting and computational algorithm design

This page was built for publication: Resilience of mutual exclusion algorithms to transient memory faults

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