Rendering complex scenes with memory-coherent ray tracing
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Ray tracing deformable scenes using dynamic bounding volume hierarchies
ACM Transactions on Graphics (TOG)
Packet-based whitted and distribution ray tracing
GI '07 Proceedings of Graphics Interface 2007
Scan primitives for GPU computing
Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Faster ray packets - triangle intersection through vertex culling
ACM SIGGRAPH 2007 posters
Scalable Parallel Programming with CUDA
Queue - GPU Computing
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Dynamic Ray Scheduling to Improve Ray Coherence and Bandwidth Utilization
RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Using fuzzy inference system for architectural space analysis
Applied Soft Computing
SAH KD-tree construction on GPU
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Architectural space planning using evolutionary computing approaches: a review
Artificial Intelligence Review
Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays
EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
| Hi-index | 0.00 |
To obtain good performance on the GPU hardware, it is necessary to design algorithms to manage data, access memory under GPU memory hierarchy, and schedule more efficient threads. In this paper, we propose an efficient data management and task management designed for GPU based ray tracing. Due to the dynamic and uncertainty in ray tracing, we design data-management layer and task-management layer combined with fuzzy spatial analysis, use the two-level ray sorting and a ray bucket structure to reorganize ray data, then a warp's threads can be scheduled to access coherent geometry and nodes data, reduce memory bandwidth, and dispatch the data locally. We schedule tasks in data-driven execution according to coherent data, propose an adaptive ray compaction to eliminate inactive threads, maintain task efficiency of threads in a warp, and design two heuristics to decrease the compaction cost. On the basis of it, we also introduce a memory-optimized dynamic traversal management to reduce incoherent memory access, and avoid frequent sorting computation and compaction operations. Our experiments demonstrate all of these work combined can achieve good performance.