Fault Tolerant External Memory Algorithms
From MaRDI portal
Recommendations
- Sorting and searching in the presence of memory faults (without redundancy)
- Sorting and searching in faulty memories
- Optimal resilient sorting and searching in the presence of memory faults
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- Resilient algorithms and data structures
Cites work
- scientific article; zbMATH DE number 2119642 (Why is no real title available?)
- Algorithm-Based Fault Tolerance for Matrix Operations
- Algorithms and data structures for external memory
- An Approach to Concurrent Control Flow Checking
- Designing reliable algorithms in unreliable memories
- Optimal Resilient Dynamic Dictionaries
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults
- Organization and maintenance of large ordered indexes
- Priority Queues Resilient to Memory Faults
- Resilient search trees
- Sorting and searching in the presence of memory faults (without redundancy)
- The Price of Resiliency: A Case Study on Sorting with Memory Faults
Cited in
(4)
This page was built for publication: Fault Tolerant External Memory Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183472)