6 citations · 7 across the 4 of their papers we have counts for
10 papers
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
Safe memory reclamation (SMR) schemes are an essential tool for lock-free data structures and concurrent programming. However, manual SMR schemes are notoriously difficult to apply…
Lock-Free Locks Revisited
Naama Ben-David, Guy E. Blelloch, Yuanhao Wei
This paper presents a new and practical approach to lock-free locks based on helping, which allows the user to write code using fine-grained locks, but run it in a lock-free manner…
FliT: A Library for Simple and Efficient Persistent Algorithms
Yuanhao Wei, Naama Ben-David, Michal Friedman +2
Non-volatile random access memory (NVRAM) offers byte-addressable persistence at speeds comparable to DRAM. However, with caches remaining volatile, automatic cache evictions can r…
Concurrent Fixed-Size Allocation and Free in Constant Time
Guy E. Blelloch, Yuanhao Wei
Our goal is to efficiently solve the dynamic memory allocation problem in a concurrent setting where processes run asynchronously. On processes, we can support allocation and f…
Constant-Time Snapshots with Applications to Concurrent Data Structures
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch +3
We present an approach for efficiently taking snapshots of the state of a collection of CAS objects. Taking a snapshot allows later operations to read the value that each CAS objec…
Concurrent Reference Counting and Resource Management in Wait-free Constant Time
Guy E. Blelloch, Yuanhao Wei
A common problem when implementing concurrent programs is efficiently protecting against unsafe races between processes reading and then using a resource (e.g., memory blocks, file…