Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining

31 January 2023

Papers citing "Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining"

9 / 9 papers shown

Title
Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion D. Y. C. Chan Philipp Woelfel 34 8 0 06 Jun 2021
Recoverable Mutual Exclusion with Abortability P. Jayanti Anup Joshi 22 11 0 05 Dec 2020
Efficient Multi-word Compare and Swap R. Guerraoui Alex Kogan Virendra J. Marathe I. Zablotchi 31 13 0 06 Aug 2020
An Adaptive Approach to Recoverable Mutual Exlcusion Sahil Dhoked N. Mittal 26 16 0 12 Jun 2020
Understanding and Optimizing Persistent Memory Allocation Wentao Cai Haosen Wen H. A. Beadle Chris Kjellqvist Mohammad Hedayati M. Scott 24 39 0 14 Mar 2020
Upper and Lower Bounds on the Space Complexity of Detectable Object Ohad Ben-Baruch Danny Hendler M. Rusanovsky 33 16 0 26 Feb 2020
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS G. Blelloch Yuanhao Wei 26 11 0 21 Nov 2019
Delay-Free Concurrency on Faulty Persistent Memory N. Ben-David G. Blelloch Michal Friedman Yuanhao Wei 36 54 0 12 Jun 2018
The Parallel Persistent Memory Model G. Blelloch Phillip B. Gibbons Yan Gu Charles McGuffey Julian Shun VLM LRM 42 26 0 15 May 2018