Abstract

Stream compaction is an important parallel computing primitive that produces a reduced (compacted) output stream consisting of only valid elements from an input stream containing both invalid and valid elements. Computing on this compacted stream rather than the mixed input stream leads to improvements in performance, load balancing, and memory footprint. Stream compaction has numerous applications in a wide range of domains: e.g., deferred shading, isosurface extraction, and surface voxelization in computer graphics and visualization. We present a novel In-Kernel stream compaction method, where compaction is completed before leaving an operating kernel. This contrasts with conventional parallel compaction methods that require leaving the kernel and running a prefix sum kernel followed by a scatter kernel. We apply our compaction methods to ray-tracing-based visualization of volumetric data. We demonstrate that the proposed In-Kernel Compaction outperforms the standard out-of-kernel Thrust parallel-scan method for performing stream compaction in this real-world application. For the data visualization, we also propose a novel multi-kernel ray-tracing pipeline for increased thread coherency and show that it outperforms a conventional single-kernel approach.

Related Files

Pre-print

DOI

10.1111/cgf.12083
https://dx.doi.org/10.1111/cgf.12083

Citation

BibTeX

@article {InK-Compact,
	author = {Hughes, D. M. and Lim, I. S. and Jones, M. W. and Knoll, A. and Spencer, B.},
	title = {{InK-Compact}: In-Kernel Stream Compaction and Its Application to Multi-Kernel Data Visualization on General-Purpose GPUs},
	journal = {Computer Graphics Forum},
	volume = {32},
	number = {6},
	issn = {1467-8659},
	url = {http://dx.doi.org/10.1111/cgf.12083},
	doi = {10.1111/cgf.12083},
	pages = {178--188},
	date={2013-09-01},
	year = {2013},
}