9184

Comparison based sorting for systems with multiple GPUs

Ivan Tanasic, Lluis Vilanova, Marc Jorda, Javier Cabezas, Isaac Gelado, Nacho Navarro, Wen-mei Hwu
Barcelona Supercomputing Center
6th Workshop on General Purpose Processor Using Graphics Processing Units (GPGPU-6), 2013
@inproceedings{Tanasic:2013:CBS:2458523.2458524,

   author={Tanasic, Ivan and Vilanova, Llu’{i}s and Jord’{a}, Marc and Cabezas, Javier and Gelado, Isaac and Navarro, Nacho and Hwu, Wen-mei},

   title={Comparison based sorting for systems with multiple GPUs},

   booktitle={Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units},

   series={GPGPU-6},

   year={2013},

   isbn={978-1-4503-2017-7},

   location={Houston, Texas},

   pages={1–11},

   numpages={11},

   url={http://doi.acm.org/10.1145/2458523.2458524},

   doi={10.1145/2458523.2458524},

   acmid={2458524},

   publisher={ACM},

   address={New York, NY, USA},

   keywords={CUDA, GPU, parallel, sorting}

}

Download Download (PDF)   View View   Source Source   

355

views

As a basic building block of many applications, sorting algorithms that efficiently run on modern machines are key for the performance of these applications. With the recent shift to using GPUs for general purpose compuing, researches have proposed several sorting algorithms for single-GPU systems. However, some workstations and HPC systems have multiple GPUs, and applications running on them are designed to use all available GPUs in the system. In this paper we present a high performance multi-GPU merge sort algorithm that solves the problem of sorting data distributed across several GPUs. Our merge sort algorithm first sorts the data on each GPU using an existing single-GPU sorting algorithm. Then, a series of merge steps produce a globally sorted array distributed across all the GPUs in the system. This merge phase is enabled by a novel pivot selection algorithm that ensures that merge steps always distribute data evenly among all GPUs. We also present the implementation of our sorting algorithm in CUDA, as well as a novel inter-GPU communication technique that enables this pivot selection algorithm. Experimental results show that an efficient implementation of our algorithm achieves a speed up of 1.9x when running on two GPUs and 3.3x when running on four GPUs, compared to sorting on a single GPU. At the same time, it is able to sort two and four times more records, compared to sorting on one GPU.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Like us on Facebook

HGPU group

142 people like HGPU on Facebook

Follow us on Twitter

HGPU group

1223 peoples are following HGPU @twitter

Featured events

* * *

Free GPU computing nodes at hgpu.org

Registered users can now run their OpenCL application at hgpu.org. We provide 1 minute of computer time per each run on two nodes with two AMD and one nVidia graphics processing units, correspondingly. There are no restrictions on the number of starts.

The platforms are

Node 1
  • GPU device 0: AMD/ATI Radeon HD 5870 2GB, 850MHz
  • GPU device 1: AMD/ATI Radeon HD 6970 2GB, 880MHz
  • CPU: AMD Phenom II X6 @ 2.8GHz 1055T
  • RAM: 12GB
  • OS: OpenSUSE 13.1
  • SDK: AMD APP SDK 2.9
Node 2
  • GPU device 0: AMD/ATI Radeon HD 7970 3GB, 1000MHz
  • GPU device 1: nVidia GeForce GTX 560 Ti 2GB, 822MHz
  • CPU: Intel Core i7-2600 @ 3.4GHz
  • RAM: 16GB
  • OS: OpenSUSE 12.2
  • SDK: nVidia CUDA Toolkit 6.0.1, AMD APP SDK 2.9

Completed OpenCL project should be uploaded via User dashboard (see instructions and example there), compilation and execution terminal output logs will be provided to the user.

The information send to hgpu.org will be treated according to our Privacy Policy

HGPU group © 2010-2014 hgpu.org

All rights belong to the respective authors

Contact us: