2 papers
cs.DS2016
Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures
Jakob Gruber, Jesper Larsson Träff, Martin Wimmer
A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a throughput benchmark that uses a uniform distributi…
cs.DS2015
The Lock-free -LSM Relaxed Priority Queue
Martin Wimmer, Jakob Gruber, Jesper Larsson Träff +1
Priority queues are data structures which store keys in an ordered fashion to allow efficient access to the minimal (maximal) key. Priority queues are essential for many applicatio…