A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Engineering a cache-oblivious sorting algorithm
2008
ACM Journal of Experimental Algorithmics
and KRISTOFFER VINTHER Systematic Software Engineering A/S This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort and compare the final algorithm with Quicksort, the established standard for comparison-based sorting, as well as with recent cache-aware proposals. The main result is a carefully implemented cache-oblivious sorting
doi:10.1145/1227161.1227164
fatcat:lsppepoiajf5dn4icisp23wmhe