12 citations · 18 across the 3 of their papers we have counts for
4 papers
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
Marvin Williams, Peter Sanders
Priority queues are used in a wide range of applications, including prioritized online scheduling, discrete event simulation, and greedy algorithms. In parallel settings, classical…
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
Marvin Williams, Peter Sanders, Roman Dementiev
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or greedy algorithms. However,…
Concurrent Hash Tables: Fast and General?(!)
Tobias Maier, Peter Sanders, Roman Dementiev
Concurrent hash tables are one of the most important concurrent data structures with numerous applications. Since hash table accesses can dominate the execution time of the overall…
MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues
Hamza Rihani, Peter Sanders, Roman Dementiev
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. However,…