Data structures resilient to memory faults: an experimental study of dictionaries

DOI10.1145/2444016.2444022MaRDI QIDQ5178739zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Umberto Ferraro-Petrillo, Fabrizio Grandoni, Giuseppe F. Italiano

Publication date 16 March 2015

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2444016.2444022

zbMATH Keywords

computing with unreliable informationexperimental algorithmicsfault injectionmemory faultsmemory modelssorting

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Resilient dictionaries
• Optimal Resilient Dynamic Dictionaries
• Resilient search trees
• Resilient algorithms and data structures
• Lossless fault-tolerant data structures with additive overhead

Cited in

(8)

• Exploiting non-constant safe memory in resilient algorithms and data structures
• Resilient dictionaries
• Optimal Resilient Dynamic Dictionaries
• Resilient Dictionaries for Randomly Unreliable Memory
• Resilient dynamic programming
• Lossless fault-tolerant data structures with additive overhead
• Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees
• Fault-tolerant database using distributed associative memories

This page was built for publication: Data structures resilient to memory faults: an experimental study of dictionaries

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