Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
Data Structures and Algorithms
2007-06-21 v1 Computational Complexity
Distributed, Parallel, and Cluster Computing
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.
Cite
@article{arxiv.0706.2893,
title = {Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort},
author = {Greg Sepesi},
journal= {arXiv preprint arXiv:0706.2893},
year = {2007}
}