Efficient Stream Compaction on Wide SIMD Many-Core Architectures

Simple item page
dc.contributor.authorBilleter, Markusen_US
dc.contributor.authorOlsson, Olaen_US
dc.contributor.authorAssarsson, Ulfen_US
dc.contributor.editorDavid Luebke and Philipp Slusalleken_US
dc.date.accessioned2013-10-29T15:48:19Z
dc.date.available2013-10-29T15:48:19Z
dc.date.issued2009en_US
dc.description.abstractStream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several processing steps and reduces overall memory usage. For wide SIMD many-core architectures, we present a novel stream compaction algorithm and explore several variations thereof. Our algorithm is designed to maximize concurrent execution, with minimal use of synchronization. Bandwidth and auxiliary storage requirements are reduced significantly, which allows for substantially better performance. We have tested our algorithms using CUDA on a PC with an NVIDIA GeForce GTX280 GPU. On this hardware, our reference implementation provides a 3× speedup over previous published algorithms.en_US
dc.description.seriesinformationHigh-Performance Graphicsen_US
dc.identifier.isbn978-1-60558-603-8en_US
dc.identifier.issn2079-8687en_US
dc.identifier.urihttps://doi.org/10.1145/1572769.1572795en_US
dc.publisherThe Eurographics Associationen_US
dc.titleEfficient Stream Compaction on Wide SIMD Many-Core Architecturesen_US
Files
Collections
High-Performance Graphics 2009