Counting and Occurrence Sort for GPUs using an Embedded Language
Paper in proceedings, 2013

This paper investigates two sorting algorithms: counting sort and a variation, occurrence sort, which also removes duplicate elements, and examines their suitability for running on the GPU. The dupli- cate removing variation turns out to have a natural functional, data- parallel implementation which makes it particularly interesting for GPUs. The algorithms are implemented in Obsidian, a high-level do- main specific language for GPU programming. Measurements show that our implementations in many cases outperform the sorting algorithm provided by the library Thrust. Furthermore, occurrence sort is another factor of two faster than ordinary counting sort. We conclude that counting sort is an impor- tant contender when considering sorting algorithms for the GPU, and that occurrence sort is highly preferable when applicable. We also show that Obsidian can produce very competitive code.

Sorting

Embedded language

Author

Josef Svenningsson

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Joel Bo Svensson

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Mary Sheeran

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

The 2nd ACM SIGPLAN Workshop on Functional High-Performance Computing, FHPC'13

Vol. 48 12 37-45

Areas of Advance

Information and Communication Technology

Subject Categories

Software Engineering

DOI

10.1145/2502323.2502325

ISBN

978-145032381-9

More information

Created

10/7/2017