Resilience of mutual exclusion algorithms to transient memory faults

DOI10.1145/1993806.1993817zbMATH Open1321.68172OpenAlexW2143504116MaRDI QIDQ2943385FDOQ2943385

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

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

zbMATH Keywords

fault tolerancemutual exclusiontransient memory faults

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Recoverable mutual exclusion
• Title not available (Why is that?)
• 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)