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 Oct Times are displayed in time zone: Beirut change
11:00 - 12:30
|Efficient Lock-Free Durable Sets|
Yoav ZurielTechnion - Israel, Michal FriedmanTechnion - Israel, Gali SheffiTechnion - Israel, Nachshon CohenAmazon, Erez PetrankTechnion - IsraelDOI
|Weak Persistency Semantics from the Ground Up: Formalising the Persistency Semantics of ARMv8 and Transactional Models|
Azalea RaadMPI-SWS, Germany, John WickersonImperial College London, Viktor VafeiadisMPI-SWS, GermanyDOI
|Verifying Safety and Accuracy of Approximate Parallel Programs via Canonical Sequentialization|
Vimuth FernandoUniversity of Illinois at Urbana-Champaign, Keyur JoshiUniversity of Illinois at Urbana-Champaign, Sasa MisailovicUniversity of Illinois at Urbana-ChampaignDOI
|Dependence-Aware, Unbounded Sound Predictive Race Detection|
Kaan GençOhio State University, Jake RoemerOhio State University, Yufan XuOhio State University, Michael D. BondOhio State UniversityDOI Pre-print