dc.contributor.author | Wald, Ingo | en_US |
dc.contributor.editor | Carsten Dachsbacher and William Mark and Jacopo Pantaleoni | en_US |
dc.date.accessioned | 2016-02-18T11:01:48Z | |
dc.date.available | 2016-02-18T11:01:48Z | |
dc.date.issued | 2011 | en_US |
dc.identifier.isbn | 978-1-4503-0896-0 | en_US |
dc.identifier.issn | 2079-8687 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1145/2018323.2018331 | en_US |
dc.description.abstract | Modern GPUs like NVidia s Fermi internally operate in a SIMD manner by ganging multiple (32) scalar threads together into SIMD warps; if a warp s threads diverge, the warp serially executes both branches, temporarily disabling threads that are not on that path. In this paper, we explore and thoroughly analyze the concept of active thread compaction i.e., the process of taking multiple partially-filled warps and compacting them to fewer but fully utilized warps in the context of a CUDA path tracer. Our results show that this technique can indeed lead to significant improvements in SIMD utilization, and corresponding savings in theamount of work performed; however, they also show that certain inadequacies of today s hardware wipe out most of the achieved gains, leaving bottom-up speed-ups of a mere 12 16%. We believe our analysis of why this is the case will provide insight to otherresearchers experimenting with this technique in different contexts. | en_US |
dc.publisher | ACM | en_US |
dc.subject | I.3.7 [Computer Graphics] | en_US |
dc.subject | Three DimensionalGraphics and Realism Raytracing | en_US |
dc.title | Active Thread Compaction for GPU Path Tracing | en_US |
dc.description.seriesinformation | Eurographics/ ACM SIGGRAPH Symposium on High Performance Graphics | en_US |
dc.description.sectionheaders | Parallel Ray Tracing | en_US |
dc.identifier.doi | 10.1145/2018323.2018331 | en_US |
dc.identifier.pages | 51-58 | en_US |