SimdQuickHeap: The QuickHeap Reconsidered

TL;DR

The paper introduces SimdQuickHeap, a SIMD-optimized priority queue that outperforms existing structures in benchmarks and graph algorithms by leveraging a modified QuickHeap design for efficient operations.

Contribution

It presents the SimdQuickHeap, a novel SIMD-friendly priority queue with improved amortized complexity and practical performance over traditional heaps.

Findings

Up to twice as fast as competitors in synthetic benchmarks.

Requires approximately 1.5 log2 n comparisons per push-pop pair.

Consistently fastest in graph algorithms like Dijkstra and Prim.

Abstract

Priority queues are data structures that maintain a dynamic collection of elements and allow inserting new elements and removing the smallest element. The most widely known and used priority queue is likely the implicit binary heap, even though it is has frequent cache misses and is hard to optimize using e.g. SIMD instructions. We introduce the SimdQuickHeap, a variant of the QuickHeap that was introduced by Navarro and Paredes in 2010. As suggested by the name, the data structure bears some similarity to QuickSort. We modify the data layout of the original QuickHeap to have all \emph{pivots} adjacent in memory, with elements between consecutive pivots stored in dedicated \emph{buckets}. This allows efficient SIMD implementations for both partitioning of buckets and scanning the list of pivots to find the bucket to append newly inserted elements to. The SimdQuickHeap has amortized expected complexity $O(\log n)$ per operation, which improves to $O(\frac 1W\log n)$ in non-degenerate cases, where $W$ is the number of words in a SIMD register. In this case, the I/O-complexity is amortized $O(\frac 1B)$ per push and $O(\frac 1B \log_2 \frac nM)$ per pop. In synthetic benchmarks, the SimdQuickHeap is up to twice as fast as the next-best competitor, including the non-comparison radix heap, and needs around $1.5\log_2 n$ comparisons and $\log_2 n$ nanoseconds per pair of push and pop operations. On graph benchmarks with Dijkstra's shortest path algorithm and Jarnik-Prim's minimum spanning tree algorithm, the SimdQuickHeap is consistently the fastest.