ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.04780
  4. Cited By
Delay-Free Concurrency on Faulty Persistent Memory
v1v2v3 (latest)

Delay-Free Concurrency on Faulty Persistent Memory

12 June 2018
N. Ben-David
G. Blelloch
Michal Friedman
Yuanhao Wei
ArXiv (abs)PDFHTML

Papers citing "Delay-Free Concurrency on Faulty Persistent Memory"

11 / 11 papers shown
Title
Highly-Efficient Persistent FIFO Queues
Highly-Efficient Persistent FIFO Queues
Panagiota Fatourou
Nikos Giachoudis
George Mallis
21
1
0
27 Feb 2024
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining
Durable Algorithms for Writable LL/SC and CAS with Dynamic Joining
P. Jayanti
S. Jayanti
Sucharita Jayanti
45
8
0
31 Jan 2023
Survey of Persistent Memory Correctness Conditions
Survey of Persistent Memory Correctness Conditions
N. Ben-David
Michal Friedman
Yuanhao Wei
KELMLRM
27
6
0
23 Aug 2022
Lock-Free Locks Revisited
Lock-Free Locks Revisited
N. Ben-David
G. Blelloch
Yuanhao Wei
47
8
0
03 Jan 2022
FliT: A Library for Simple and Efficient Persistent Algorithms
FliT: A Library for Simple and Efficient Persistent Algorithms
Yuanhao Wei
N. Ben-David
Michal Friedman
G. Blelloch
E. Petrank
VLM
108
16
0
09 Aug 2021
Persistent Software Combining
Persistent Software Combining
P. Fatourou
Nikolaos D. Kallimanis
Eleftherios Kosmas
38
4
0
07 Jul 2021
NVTraverse: In NVRAM Data Structures, the Destination is More Important
  than the Journey
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey
Michal Friedman
N. Ben-David
Yuanhao Wei
G. Blelloch
E. Petrank
49
58
0
06 Apr 2020
Upper and Lower Bounds on the Space Complexity of Detectable Object
Upper and Lower Bounds on the Space Complexity of Detectable Object
Ohad Ben-Baruch
Danny Hendler
M. Rusanovsky
36
16
0
26 Feb 2020
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala
Charles McGuffey
H. Kang
Yan Gu
G. Blelloch
Phillip B. Gibbons
Julian Shun
GNN
66
12
0
27 Oct 2019
Efficient Lock-Free Durable Sets
Efficient Lock-Free Durable Sets
Yoav Zuriel
Michal Friedman
Gali Sheffi
Nachshon Cohen
E. Petrank
30
61
0
02 Sep 2019
Multiversion Concurrency with Bounded Delay and Precise Garbage
  Collection
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection
N. Ben-David
G. Blelloch
Yihan Sun
Yuanhao Wei
54
17
0
23 Mar 2018
1