Priority Queues Resilient to Memory Faults

DOI10.1007/978-3-540-73951-7_12zbMath1209.68159OpenAlexW1488399669MaRDI QIDQ3603521

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

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

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

Related Items (7)

Fault Tolerant External Memory Algorithms ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Designing reliable algorithms in unreliable memories ⋮ Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Resilient dynamic programming ⋮ The price of resiliency: a case study on sorting with memory faults ⋮ Exploiting non-constant safe memory in resilient algorithms and data structures

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