6 citations · 7 across the 7 of their papers we have counts for
12 papers · 1 filter
Upper and Lower Bounds on the Space Complexity of Multi-word Single-Writer Registers
Yuanhao Wei, Yousof Yavari
We prove matching upper and lower bounds on the space complexity of simulating a large shared register using smaller shared registers. We focus on the case where both the simulated…
Aggregating Funnels for Faster Fetch&Add and Queues
Younghun Roh, Yuanhao Wei, Eric Ruppert +3
Many concurrent algorithms require processes to perform fetch-and-add operations on a single memory location, which can be a hot spot of contention. We present a novel algorithm ca…
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…