An Inherently Parallel Generalization of Heapsort
Cao Ji-dong · Computer Knowledge and Technology · 2010
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.