NEW ALGORITHMS FOR GPU STREAM COMPACTION A Comparative Study

• Type: Article in International Conference Proceedings Book
• Date: 2009

Authors

moreira, pm (Author) Other; reis, lp (Author) FEUP; de sousa, aa (Author) FEUP

Conference proceedings International

Title: GRAPP 2009: PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS THEORY AND APPLICATIONS

Pages: 119-128

4th International Conference on Computer Vision Theory and Applications4th International Conference on Computer Graphics Theory and Applications

Lisbon, PORTUGALLisbon, PORTUGAL, FEB 05-08, 2009FEB 05-08, 2009

Indexing

ISI Proceedings

ISI Web of Knowledge - 0 Citations

Scopus - 0 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-003-Q6W

Abstract (EN): With the advent of GPU programmability, many applications have transferred computational intensive tasks into it. Some of them compute intermediate data comprised by a mixture of relevant and irrelevant elements in respect to further processing tasks. Hence, the ability to discard irrelevant data and preserve the relevant portion is a desired feature, with benefits on further computational effort, memory and communication bandwidth. Parallel stream compaction is an operation that, given a discriminator, is able to output the valid elements discarding the rest. In this paper we contribute two original algorithms for parallel stream compaction on the GPU. We tested and compared our proposals with state-of-art algorithms against different data-sets. Results demonstrate that our proposals can outperform prior algorithms. Result analysis also demonstrate that there is not a best algorithm for all data distributions and that such optimal setting is difficult to be achieved without prior knowledge of the data characteristics.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10