Back to Search
Start Over
Engineering a Multi-core Radix Sort
- Source :
- Euro-Par 2011 Parallel Processing ISBN: 9783642233968, Euro-Par (2)
- Publication Year :
- 2011
- Publisher :
- Springer Berlin Heidelberg, 2011.
-
Abstract
- We present a fast radix sorting algorithm that builds upon a microarchitecture-aware variant of counting sort. Taking advantage of virtual memory and making use of write-combining yields a per-pass throughput corresponding to at least 89% of the system's peak memory bandwidth. Our implementation outperforms Intel's recently published radix sort by a factor of 1.64. It also compares favorably to the reported performance of an algorithm for Fermi GPUs when data-transfer overhead is included. These results indicate that scalar, bandwidth-sensitive sorting algorithms remain competitive on current architectures. Various other memory-intensive applications can benefit from the techniques described herein.
Details
- ISBN :
- 978-3-642-23396-8
- ISBNs :
- 9783642233968
- Database :
- OpenAIRE
- Journal :
- Euro-Par 2011 Parallel Processing ISBN: 9783642233968, Euro-Par (2)
- Accession number :
- edsair.doi...........d8453a35a3b0ce31db4d36bf08d50c92