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.DS2025
Concurrent Double-Ended Priority Queues
Panagiota Fatourou, Eric Ruppert, Ioannis Xiradakis
This work provides the first concurrent implementation specifically designed for a double-ended priority queue (DEPQ). We do this by describing a general way to add an ExtractMax o…
cs.DC2024
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…