Talks and Poster Presentations (with Proceedings-Entry):
J. Gruber, J. Träff, M. Wimmer:
"Brief Announcement: Benchmarking Concurrent Priority Queues";
Talk: 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016),
Asilomar State Beach, California, USA;
- 2016-07-13; in: "Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016)",
New York, NY, USA
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 distribution of keys from a large integer range, a balanced mixture of operations, and mostly for single systems. We have conducted more extensive benchmarking of three recent, relaxed priority queues on four different types of systems with different key ranges and distributions. While we can show superior throughput and scalability for our own k-LSM priority queue for the uniform key distribution, the picture changes drastically for other distributions, both with respect to achieved throughput and relative merit of the priority queues. The throughput benchmark alone is thus not sufficient to characterize the performance of concurrent priority queues. Our priority queue, benchmark code and full set of results are publicly available to foster comparison.
Priority Queues, Concurrency, Relaxation, Benchmarking
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.