ACM logo

The ACM Journal of Experimental Algorithmics


Adapting Radix Sort to the Memory Hierarchy

by

Naila Rahman

and

Rajeev Raman


Abstract:

We demonstrate the importance of reducing misses in the translation-lookaside buer (TLB) for obtaining good performance on modern computer architectures. We focus on least-significant-bit first (LSB) radix sort, standard implementations of which make many TLB misses. We give three techniques which simultaneously reduce cache and TLB misses for LSB radix sort: reducing working set size, explicit block transfer and pre-sorting. We note that:

http://www.jea.acm.org/2001/RahmanRadix/

Received
Accepted
Final Revision
Published



November 19, 2003

Last updated and validated November 19, 2003, by editor@jea.acm.org