Optimizing Sorting Algorithms Using Ubiquitous Multi-core Massively Parallel GPGPU Processors

• Published in: Procedia computer science Vol. 79; pp. 231 - 237
• Main Author: Rathi, Sheetal
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 2016
• Subjects: Bitonic sort; GPGPU; HPC; Bitonic sort; HPC; GPGPU
• ISSN: 1877-0509; 1877-0509
• DOI: 10.1016/j.procs.2016.03.030

While developing naive code is uncomplicated, optimizing extremely parallel algorithms requires deep understanding of the core architecture. Recent years have witnessed a phenomenal growth in the computational capabilities and applications of GPUs. High performance of modern Graphics Processing Units may be used not only for graphics related application but also for general computing. Out of the vast applications which require parallel computing, some broadly classified are real-world applications like scientific computing, numerical simulations, healthcare, energy, data-analysis, etc. All of these applications involve wide data-intensive tasks, often subject to time constraints and space complexity. One of the fundamental issues in computer science is ordering a list of items. Bitonic sort is one of the most basic computing problems which also play a very important role in plenty of algorithms commonly used in graphics applications, such as visibility ordering or collision detection. This paper makes use of the parallel property of GPU and accelerates the function of bitonic sort which in itself is designed explicitly for parallel networks.