Algorithmic Building Blocks for Asymmetric Memories

DOI10.4230/LIPIcs.ESA.2018.44OpenAlexW2810316586MaRDI QIDQ5009607

Guy E. Blelloch, Yihan Sun, Yan Gu

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1806.10370

zbMATH Keywords

hash tablesasymmetric memorygraph-traversal algorithmsI/O costwrite-efficient algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Uses Software

• SNAP

Cites Work

• A note on two problems in connexion with graphs
• Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
• Efficient Algorithms with Asymmetric Read and Write Costs
• Scheduling to Optimize Cache Utilization for Non-Volatile Main Memories
• Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel
• Competitive Analysis of Flash-Memory Algorithms
• Unnamed Item

This page was built for publication: Algorithmic Building Blocks for Asymmetric Memories