Massively Parallel Identification of Intersection Points for GPGPU Ray Tracing

Alexandre S. Nery, Nadia Nedjah, Felipe M. G. Franca, Lech Jozwiak
LAM – Computer Architecture and Microeletronics Laboratory, Systems Engineering and Computer Science Program, COPPE, Universidade Federal do Rio de Janeiro
Algorithms and Architectures for Parallel Processing, Lecture Notes in Computer Science, Volume 7017/2011, 14-23, 2011


   title={Massively Parallel Identification of Intersection Points for GPGPU Ray Tracing},

   author={Nery, A. and Nedjah, N. and Fran{c{c}}a, F. and Jozwiak, L.},

   journal={Algorithms and Architectures for Parallel Processing},





Download Download (PDF)   View View   Source Source   



The latest advancements in computer graphics architectures, as the replacement of some fixed stages of the pipeline for programmable stages (shaders), have been enabling the development of parallel general purpose applications on massively parallel graphics architectures (Streaming Processors). For years the graphics processing unit (GPU) is being optimized for increasingly high throughput of massively parallel floating-point computations. However, only the applications that exhibit Data Level parallelism can achieve substantial acceleration in such architectures. In this paper we present a parallel implementation of the GridRT architecture for GPGPU ray tracing. Such architecture can expose two levels of parallelism in ray tracing: parallel ray processing and parallel intersection tests, respectively. We also present a traditional parallel implementation of ray tracing in GPGPU, for comparison against the GridRT-GPGPU implementation.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: