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.
Fri 25 OctDisplayed time zone: Beirut change
11:00 - 12:30
|Efficient Lock-Free Durable Sets|
Yoav Zuriel Technion - Israel, Michal Friedman Technion - Israel, Gali Sheffi Technion - Israel, Nachshon Cohen Amazon, Erez Petrank Technion - IsraelDOI
|Weak Persistency Semantics from the Ground Up: Formalising the Persistency Semantics of ARMv8 and Transactional Models|
Azalea Raad MPI-SWS, Germany, John Wickerson Imperial College London, Viktor Vafeiadis MPI-SWS, GermanyDOI
|Verifying Safety and Accuracy of Approximate Parallel Programs via Canonical Sequentialization|
Vimuth Fernando University of Illinois at Urbana-Champaign, Keyur Joshi University of Illinois at Urbana-Champaign, Sasa Misailovic University of Illinois at Urbana-ChampaignDOI
|Dependence-Aware, Unbounded Sound Predictive Race Detection|
Kaan Genç Ohio State University, Jake Roemer Ohio State University, Yufan Xu Ohio State University, Michael D. Bond Ohio State UniversityDOI Pre-print