GPU-ABiSort: Optimal parallel sorting on stream architectures

20th International Parallel and Distributed Processing Symposium, IPDPS 2006

Volumn 2006, Issue , 2006, Pages

  Greß, Alexander ^a   Zachmann, Gabriel ^b  

^a UNIVERSITY OF BONN   (Germany)

^b CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; GRAPHIC METHODS; SORTING;

LINEAR STREAM MEMORY; OPTIMAL TIME COMPLEXITY; PARALLEL SORTING; STREAM ARCHITECTURES;

PARALLEL PROCESSING SYSTEMS;

EID: 33847140219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2006.1639284     Document Type: Conference Paper

References (19)

1. M. Ajtai, J. Komlós, and E. Szemerédi. An O(n log n) sorting network. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '89), pages 1-9, 1983.
2. S. G. Akl. Parallel Sorting Algorithms. Academic Press, Inc., Orlando, FL, USA, 1990.
3. S. Amarasinghe. Multicores from the compiler's perspective: A blessing or a curse? In Proceedings of the international symposium on Code generation and optimization (CGO '05), pages 137-137, 2005.
4. K. E. Batcher. Sorting networks and their applications. In Proceedings of the 1968 Spring Joint Computer Conference (SJCC), volume 32, pages 307-314, 1968.
5. G. Bilardi and A. Nicolau. Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines. SIAM J. Comput., 18(2):216-228, Apr. 1989.
6. I. Buck, T. Foley, D. Horn, J. Sugerman, K. Fatahalian, M. Houston, and P. Hanrahan. Brook for CPUs: stream computing on graphics hardware. ACM Transactions on Graphics, 23(3):777-786, Aug. 2004.
7. R. Cole. Parallel merge sort. SIAM J. Comput., 17(4):770-785, Aug. 1988.
8. see Correction in SIAM J. Comput. 22, 1349.
9. A. Gibbons and W. Rytter. Efficient parallel algorithms. Cambridge University Press, Cambridge, England, 1988.
10. N. K. Govindaraju, N. Raghuvanshi, M. Henson, and D. Manocha. A cache-efficient sorting algorithm for database and data mining computations using graphics processors. Technical report, University of North Carolina, Chapel Hill, 2005.
11. N. K. Govindaraju, N. Raghuvanshi, and D. Manocha. Fast and approximate stream mining of quantiles and frequencies using graphics processors. In Proceedings of the 2005 ACM SIGMOD international conference on Management of data (SIGMOD '05), pages 611-622, 2005.
12. A. Greß and G. Zachmann. GPU-ABiSort: Optimal parallel sorting on stream architectures (extended version). Technical report, Clausthal University of Technology, Feb. 2006.
13. U. J. Kapasi, W. J. Dally, S. Rixner, P. R. Mattson, J. D. Owens, and B. Khailany. Efficient conditional operations for data-parallel architectures. In Proceedings of the 33rd Annual IEEE/ACM International Symposium on Microarchitecture (Micro-33), pages 159-170, 2000.
14. P. Kipfer, M. Segal, and R. Westermann. Uberflow: a gpu-based particle engine. In Proceedings of the 2004 ACM SIGGRAPH/Eurographics conference on Graphics hardware (EGGH '04), pages 115-122, 2004.
15. P. Kipfer and R. Westermann. Improved GPU sorting. In M. Pharr, editor, GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation, pages 733-746. Addison-Wesley, 2005.
16. L. Natvig. Logarithmic time cost optimal parallel sorting is not yet fast in practice! In Proceedings Supercomputing '90, pages 486-494, 1990.
17. J. Owens. Streaming architectures and technology trends. In M. Pharr, editor, GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation, pages 457-470. Addison-Wesley, 2005.
18. J. D. Owens. Computer Graphics on a Stream Architecture. PhD thesis, Stanford University, Nov. 2002.
19. T. J. Purcell, C. Donner, M. Cammarano, H. W. Jensen, and P. Hanrahan. Photon mapping on programmable graphics hardware. In Proceedings of the 2009 Annual ACM SIGGRAPH/Eurographics Conference on Graphics Hardware (EGGH '03), pages 41-50, 2003.