The Price of Resiliency: A Case Study on Sorting with Memory Faults

DOI10.1007/11841036_68zbMATH Open1131.68434OpenAlexW2592565581MaRDI QIDQ5449579FDOQ5449579

Irene Finocchi, Umberto Ferraro-Petrillo, Giuseppe F. Italiano

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_68

Recommendations

• The price of resiliency: a case study on sorting with memory faults
• 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

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cited In (7)

• Sorting and searching in the presence of memory faults (without redundancy)
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Fault Tolerant External Memory Algorithms
• Designing reliable algorithms in unreliable memories
• Sorting and searching in faulty memories
• The price of resiliency: a case study on sorting with memory faults
• Optimal resilient sorting and searching in the presence of memory faults

This page was built for publication: The Price of Resiliency: A Case Study on Sorting with Memory Faults

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