1 citations · 1 across the 3 of their papers we have counts for
5 papers
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…
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…
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…
Lock-Free Augmented Trees
Panagiota Fatourou, Eric Ruppert
Augmenting an existing sequential data structure with extra information to support greater functionality is a widely used technique. For example, search trees are augmented to buil…
Practically and Theoretically Efficient Garbage Collection for Multiversioning
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou +1
Multiversioning is widely used in databases, transactional memory, and concurrent data structures. It can be used to support read-only transactions that appear atomic in the presen…