Introduces three linearizable GPU concurrent queues: an adapted wait-free queue using segments, a bounded lock-free queue with wave-batched paths, and a bounded wait-free queue using 64-bit CAS operations.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
citing papers explorer
-
Scalable Concurrent Queues for GPU
Introduces three linearizable GPU concurrent queues: an adapted wait-free queue using segments, a bounded lock-free queue with wave-batched paths, and a bounded wait-free queue using 64-bit CAS operations.
-
Concurrent Splay-Based Tree
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.