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. 2004.02841
  4. Cited By
NVTraverse: In NVRAM Data Structures, the Destination is More Important
  than the Journey
v1v2 (latest)

NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey

6 April 2020
Michal Friedman
N. Ben-David
Yuanhao Wei
G. Blelloch
E. Petrank
ArXiv (abs)PDFHTML

Papers citing "NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey"

17 / 17 papers shown
Title
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
Abdullah Al Raqibul Islam
Dong Dai
24
7
0
05 Mar 2024
Snapshot: Fast, Userspace Crash Consistency for CXL and PM Using msync
Snapshot: Fast, Userspace Crash Consistency for CXL and PM Using msync
Suyash Mahar
Mingyao Shen
Terence Kelly
Steven Swanson
21
2
0
25 Oct 2023
The Fence Complexity of Persistent Sets
The Fence Complexity of Persistent Sets
Gaetano Coccimiglio
Trevor Brown
Yu Yang
76
0
0
11 Sep 2023
Recoverable and Detectable Self-Implementations of Swap
Recoverable and Detectable Self-Implementations of Swap
Tomer Lev Lehman
Hagit Attiya
Danny Hendler
36
1
0
07 Aug 2023
Transactional Composition of Nonblocking Data Structures
Transactional Composition of Nonblocking Data Structures
Wentao Cai
Haosen Wen
M. Scott
15
3
0
03 Jan 2023
Survey of Persistent Memory Correctness Conditions
Survey of Persistent Memory Correctness Conditions
N. Ben-David
Michal Friedman
Yuanhao Wei
KELMLRM
19
6
0
23 Aug 2022
When Is Recoverable Consensus Harder Than Consensus?
When Is Recoverable Consensus Harder Than Consensus?
C. Delporte-Gallet
P. Fatourou
H. Fauconnier
Eric Ruppert
26
1
0
27 May 2022
Turning Manual Concurrent Memory Reclamation into Automatic Reference
  Counting
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting
Daniel Anderson
G. Blelloch
Yuanhao Wei
20
12
0
12 Apr 2022
Practical Detectability for Persistent Lock-Free Data Structures
Practical Detectability for Persistent Lock-Free Data Structures
K. Cho
Seungmin Jeon
Jeehoon Kang
35
2
0
15 Mar 2022
Elimination (a,b)-trees with fast, durable updates
Elimination (a,b)-trees with fast, durable updates
Anubhav Srivastava
Trevor Brown
28
14
0
31 Dec 2021
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
27
4
0
07 Jul 2021
Execution of NVRAM Programs with Persistent Stack
Execution of NVRAM Programs with Persistent Stack
Vitaly Aksenov
Ohad Ben-Baruch
Danny Hendler
I. Kokorin
M. Rusanovsky
8
1
0
25 May 2021
Fast Nonblocking Persistence for Concurrent Data Structures
Fast Nonblocking Persistence for Concurrent Data Structures
Wentao Cai
Haosen Wen
Vladimir Maksimovski
Mingzhe Du
Rafaello Sanna
Shreif Abdallah
M. Scott
12
6
0
20 May 2021
Durable Queues: The Second Amendment
Durable Queues: The Second Amendment
G. Sela
E. Petrank
15
6
0
18 May 2021
Taming x86-TSO Persistency (Extended Version)
Taming x86-TSO Persistency (Extended Version)
Artem Khyzha
O. Lahav
8
1
0
26 Oct 2020
Tracking in Order to Recover: Detectable Recovery of Lock-Free Data
  Structures
Tracking in Order to Recover: Detectable Recovery of Lock-Free Data Structures
Hagit Attiya
Ohad Ben-Baruch
P. Fatourou
Danny Hendler
Eleftherios Kosmas
36
8
0
31 May 2019
1