FliT: A Library for Simple and Efficient Persistent Algorithms

9 August 2021

Papers citing "FliT: A Library for Simple and Efficient Persistent Algorithms"

6 / 6 papers shown

Title
Efficient Multi-word Compare and Swap R. Guerraoui Alex Kogan Virendra J. Marathe I. Zablotchi 25 13 0 06 Aug 2020
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey Michal Friedman N. Ben-David Yuanhao Wei G. Blelloch E. Petrank 33 56 0 06 Apr 2020
RECIPE : Converting Concurrent DRAM Indexes to Persistent-Memory Indexes Se Kwon Lee Jayashree Mohan Sanidhya Kashyap Taesoo Kim Vijay Chidambaram 18 165 0 23 Sep 2019
Efficient Lock-Free Durable Sets Yoav Zuriel Michal Friedman Gali Sheffi Nachshon Cohen E. Petrank 21 60 0 02 Sep 2019
Tracking in Order to Recover: Detectable Recovery of Lock-Free Data Structures Hagit Attiya Ohad Ben-Baruch P. Fatourou Danny Hendler Eleftherios Kosmas 28 8 0 31 May 2019
Delay-Free Concurrency on Faulty Persistent Memory N. Ben-David G. Blelloch Michal Friedman Yuanhao Wei 30 54 0 12 Jun 2018