A closer look at fault tolerance

DOI10.1007/s00224-017-9779-4zbMath1392.68209OpenAlexW2614969776MaRDI QIDQ5895044

Gadi Taubenfeld

Publication date: 23 July 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-017-9779-4

zbMATH Keywords

fault tolerancemessage passingshared memoryconsensusstackcrash failuresswapelectionrenamingfetch-and-addset-consensustest-and-set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The renaming problem in shared memory systems: an introduction
• Fully-adaptive algorithms for long-lived renaming
• Bounds on shared memory for mutual exclusion
• Possibility and impossibility results in a shared memory environment
• Wait-free algorithms for fast, long-lived renaming
• The concurrency hierarchy, and algorithms for unbounded concurrency
• The topological structure of asynchronous computability
• Algorithms adapting to point contention
• Renaming in an asynchronous environment
• The Computational Structure of Progress Conditions
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• The BG distributed simulation algorithm
• On asymmetric progress conditions
• Common2 extended to stacks and unbounded concurrency
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Randomized mutual exclusion algorithms revisited
• A completeness theorem for a class of synchronization objects
• Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
• Brief Announcement

This page was built for publication: A closer look at fault tolerance