3 papers
cs.DS2026
Concurrent Balanced Augmented Trees
Evan Wrench, Ajay Singh, Younghun Roh +4
Augmentation makes search trees tremendously more versatile, allowing them to support efficient aggregation queries, order-statistic queries, and range queries in addition to inser…
cs.DC2025
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…
cs.DC2025
Big Atomics
Daniel Anderson, Guy E. Blelloch, Siddhartha Jayanti
In this paper, we give theoretically and practically efficient implementations of Big Atomics, i.e., -word linearizable registers that support the load, store, and compare-and-s…