This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing
CC-Radix:a Cache Conscious Sorting Based on Radix sort
Genova, Italy
February 05-February 07
ISBN: 0-7695-1875-3
Daniel Jiménex-González, Universitat Polit?cnica de Catalunya
Juan J. Navarro, Universitat Polit?cnica de Catalunya
Josep-L. Larriba-Pey, Universitat Polit?cnica de Catalunya
We focuss on the improvement of data locality for the in-core sequential Radix sort algorithm for 32-bit ositive integer keys.We propose a new algorithm that we call Cache Conscious Radix sort, CC-Radix.
CC-Radix improves the data locality by dynamically partitioning the data set into subsets that fit in cache level L2. Once in that cache level, each subset is sorted with Radix sort. In order to obtain the best implementations, we analyse the algorithms and obtain the algorithmic parameters that minimize the number of misses on cache levels L1 and L2, and the TLB structure.
Here, we present results for a MIPS R10000 processor based computer, the SGI Origin 2000. Our results show that our algorithm is about 2 and 1.4 times faster than Quicksort and Explicit Block Transfer Radix sort, which is the previous fastest sorting algorithm to our knowledge, respectively.
Citation:
Daniel Jiménex-González, Juan J. Navarro, Josep-L. Larriba-Pey, "CC-Radix:a Cache Conscious Sorting Based on Radix sort," pdp, pp.101, Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003
Usage of this product signifies your acceptance of the Terms of Use.