Fast sort on CPUs and GPUs: A case for bandwidth oblivious SIMD sort

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 351-362

  Satish, Nadathur ^a   Kim, Changkyu ^a   Chhugani, Jatin ^a   Nguyen, Anthony D ^a   Lee, Victor W ^a   Kim, Daehyun ^a   Dubey, Pradeep ^a  

^a INTEL CORPORATION   (United States)

Author keywords

buffer; databases; many core; merge; merge network; performance; radix; simd; sorting; tlp

Indexed keywords

ANALYTICAL MODEL; ARCHITECTURAL FEATURES; BUFFER; CARDINALITIES; COMPETITIVE ANALYSIS; CONSTANT BANDWIDTH; DATABASES; KEY SIZES; LARGE DATA; LARGE SIZES; LOW-BANDWIDTH; MAIN MEMORY; MANY-CORE; MODERN ARCHITECTURES; ON CURRENTS; RADIX SORT; SORTING ALGORITHM; SORTING METHOD;

BANDWIDTH; DATABASE SYSTEMS; MATHEMATICAL MODELS; PROGRAM PROCESSORS;

SORTING;

EID: 77954743119     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807207     Document Type: Conference Paper

References (27)

1. CUDPP: CUDA Data Parallel Primitives Library. gpgpu.org/developer/cudpp/.
2. Intel Performance Primitives. http://software.intel.com/en-us/intel-ipp/.
3. V. H. Allan, R. B. Jones, R. M. Lee, and S. J. Allan. Software pipelining. ACM Comput. Surv., 27(3):367-432, 1995.
4. K. E. Batcher. Sorting networks and their applications. In Spring Joint Computer Conference, pages 307-314, 1968.
5. C. Binnig, S. Hildenbrand, and F. Färber. Dictionary-based order-preserving string compression for column stores. In SIGMOD, pages 283-296, 2009.
6. G. E. Blelloch. Vector models for data-parallel computing. MIT Press, Cambridge, MA, USA, 1990.
7. P. Bohannon, P. Mcllroy, and R. Rastogi. Main-memory index structures with fixed-size partial keys. In SIGMOD, pages 163-174, 2001.
8. S. Chaudhry, R. Cypher, M. Ekman, M. Karlsson, et al. Rock: A High-Performance Sparc CMT Processor. IEEE Micro, 29(2):6-16, 2009.
9. J. Chhugani, A. D. Nguyen, V.W. Lee, et al. Efficient implementation of sorting on multi-core SIMD CPU architectures. VLDB, 1(2):1313-1324, 2008.
10. T. Cormen, C. Leiserson, and R. Rivest. Intro. to Algorithms. MIT Press, 1990.
11. R. S. Francis, I. D. Mathieson, and L. Pannan. A fast, simple algorithm to balance a parallel multiway merge. In Proceedings of PARLE, 1993.
12. N. Govindaraju, J. Gray, R. Kumar, et al. GPUTeraSort: High Performance Graphics Co-processor Sorting. In SIGMOD, pages 325-336, 2006.
13. H. Inoue, T. Moriyama, H. Komatsu, et al. AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors. In PACT, pages 189-198, 2007.
14. Intel Advanced Vector Extensions Programming Reference. 2008, http://softwarecommunity.intel.com/isn/downloads/intelavx/Intel-AVXProgramming- Reference-31943302.pdf.
15. D. Jiménex-González, J. J. Navarro, and J.-L. Larriba-Pey. CC-Radix:a Cache Conscious Sorting Based on Radix sort. Euromicro Conference on Parallel, Distributed, and Network-Based Processing, 0:101, 2003.
16. C. Kim, E. Sedlar, J. Chhugani, T. Kaldewey, et al. Sort vs. hash revisited: Fast join implementation on multi-core cpus. PVLDB, 2(2):1378-1389, 2009.
17. A. Lamarca and R. E. Ladner. The Influence of Caches on the Performance of Sorting. In Journal of Algorithms, pages 370-379, 1997.
18. N. Leischner, V. Osipov, and P. Sanders. Gpu sample sort, 2009.
19. NVIDIA. Fermi Architecture White Paper, 2009.
20. NVIDIA. NVIDIA CUDA Programming Guide 2.3. 2009.
21. M. Reilly. When multicore isn't enough: Trends and the future for multi-multicore systems. In HPEC, 2008.
22. N. Satish, , M. Harris, and M. Garland. Designing efficient sorting algorithms for manycore GPUs. In IPDPS, pages 1-10, 2009.
23. L. Seiler, D. Carmean, E. Sprangle, T. Forsyth, et al. Larrabee: A Many-Core x86 Architecture for Visual Computing. SIGGRAPH, 27(3), 2008.
24. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan Primitives for GPU Computing. In Graphics Hardware 2007, pages 97-106, Aug. 2007.
25. E. Sintorn and U. Assarsson. Fast Parallel GPU-Sorting Using a Hybrid Algorithm. In Workshop on GPGPU, 2007.
26. K. Thearling and S. Smith. An improved supercomputer sorting benchmark. In Proceedings of Supercomputing '92, pages 14-19, 1992.
27. M. Zagha and G. E. Blelloch. Radix sort for vector multiprocessors. In Proceedings of Supercomputing '91.