Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort

TL;DR

The paper introduces Dualheap Sort, a generalized heapsort algorithm that enhances cache efficiency, parallelization, and performance on sorted inputs, despite increased comparison and move operations.

Contribution

It presents a novel dualheap sort algorithm that generalizes heapsort, improving parallelization and cache performance with a trade-off in comparison and move operations.

Findings

Better cache performance than heapsort

Improved performance on already sorted inputs

Easier to implement in parallel environments

Abstract

A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers several advantages over heapsort: improved cache performance, better performance if the input happens to be already sorted, and easier parallel implementations.