Priority Queues Resilient to Memory Faults

DOI10.1007/978-3-540-73951-7_12MaRDI QIDQ3603521zbMATH OpenOpenAlexFDO

Authors Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave

Publication date 17 February 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-73951-7_12

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Data structures (68P05)

Recommendations

• Exploiting non-constant safe memory in resilient algorithms and data structures
• Resilient search trees
• Resilient dictionaries
• Optimal Resilient Dynamic Dictionaries
• Sorting and searching in faulty memories

Cited in

(11)

• The price of resiliency: a case study on sorting with memory faults
• Exploiting non-constant safe memory in resilient algorithms and data structures
• Fault Tolerant External Memory Algorithms
• Optimal Resilient Dynamic Dictionaries
• Counting in the presence of memory faults
• On RAM Priority Queues
• Designing reliable algorithms in unreliable memories
• Selection in the presence of memory faults, with applications to in-place resilient sorting
• Resilient Dictionaries for Randomly Unreliable Memory
• Resilient dynamic programming
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees

This page was built for publication: Priority Queues Resilient to Memory Faults

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