A closer look at fault tolerance
From MaRDI portal
Publication:5895044
Recommendations
Cites work
- scientific article; zbMATH DE number 1696672 (Why is no real title available?)
- scientific article; zbMATH DE number 2006648 (Why is no real title available?)
- scientific article; zbMATH DE number 6131611 (Why is no real title available?)
- A completeness theorem for a class of synchronization objects
- Algorithms adapting to point contention
- Bounds on shared memory for mutual exclusion
- Brief announcement: Computing in the presence of weak crash failures
- Common2 extended to stacks and unbounded concurrency
- Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
- Fully-adaptive algorithms for long-lived renaming
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Impossibility of distributed consensus with one faulty process
- On asymmetric progress conditions
- Possibility and impossibility results in a shared memory environment
- Randomized mutual exclusion algorithms revisited
- Reaching Agreement in the Presence of Faults
- Renaming in an asynchronous environment
- The BG distributed simulation algorithm
- The computational structure of progress conditions
- The concurrency hierarchy, and algorithms for unbounded concurrency
- The renaming problem in shared memory systems: an introduction
- The topological structure of asynchronous computability
- Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Wait-free algorithms for fast, long-lived renaming
Cited in
(3)
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)