2019/09/02 by Zuriel, Yoav, Friedman, Michal, Sheffi, Gali +2 · 1 citation
#Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Performance (cs.PF) #and Cluster Computing (cs.DC)
paper · doi:10.48550/arxiv.1909.02852
Non-volatile memory is expected to co-exist or replace DRAM in upcoming architectures. Durable concurrent data structures for non-volatile memories are essential building blocks for constructing adequate software for use with these architectures. In this paper, we propose a new approach for durable concurrent sets and use this approach to build the most efficient durable hash tables available today. Evaluation shows a performance improvement factor of up to 3.3x over existing technology.