Designing reliable algorithms in unreliable memories

DOI10.1016/J.COSREV.2007.10.001zbMATH Open1302.68106DBLPjournals/csr/FinocchiGI07OpenAlexW2140026235WikidataQ61609562 ScholiaQ61609562MaRDI QIDQ458451FDOQ458451

Irene Finocchi, Giuseppe F. Italiano, Fabrizio Grandoni

Publication date: 7 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2007.10.001

Recommendations

• Algorithms – ESA 2005
• Resilient algorithms and data structures
• Sorting and searching in faulty memories
• Sorting and searching in the presence of memory faults (without redundancy)
• Resilient dynamic programming

zbMATH Keywords

resilient priority queuesresilient search treesresilient searchingresilient sorting

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Searching and sorting (68P10)

Cites Work

• Introduction to algorithms
• Coping with errors in binary search procedures
• Title not available (Why is that?)
• Computing with Noisy Information
• Checking the correctness of memories
• Searching with known error probability
• Computer Aided Verification
• Searching games with errors -- fifty years of coping with liars
• Title not available (Why is that?)
• Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Fault-Tolerant Networks for Sorting
• Optimal Resilient Dynamic Dictionaries
• Cache-oblivious priority queue and graph algorithm applications
• Sorting and searching in the presence of memory faults (without redundancy)
• Priority Queues Resilient to Memory Faults
• Optimal Resilient Sorting and Searching in the Presence of Memory Faults
• Fault Tolerant Sorting Networks
• Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
• Title not available (Why is that?)
• Title not available (Why is that?)
• On word-level parallelism in fault-tolerant computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparison-based search in the presence of errors
• The Price of Resiliency: A Case Study on Sorting with Memory Faults
• Automata, Languages and Programming

Cited In (9)

• Exploiting non-constant safe memory in resilient algorithms and data structures
• On the error resilience of ordered binary decision diagrams
• Algorithmic Building Blocks for Asymmetric Memories
• Fault Tolerant External Memory Algorithms
• Recursive merge sort with erroneous comparisons
• Algorithms – ESA 2005
• Reliable computing with unreliable components: Using separable environments to stabilize long-term information storage
• Dependability Aspects Regarding the Cache Level of a Memory Hierarchy using Hamming Codes
• The price of resiliency: a case study on sorting with memory faults

This page was built for publication: Designing reliable algorithms in unreliable memories

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