A closer look at fault tolerance

DOI10.1007/S00224-017-9779-4zbMATH Open1392.68209OpenAlexW2614969776MaRDI QIDQ5895044FDOQ5895044

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

Recommendations

• A closer look at fault tolerance
• scientific article
• Factorizing fault tolerance.
• scientific article; zbMATH DE number 2011462

zbMATH Keywords

consensusfault tolerancestackshared memorycrash failuresswapelectionrenamingmessage passingtest-and-setset-consensusfetch-and-add

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• A closer look at fault tolerance
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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