Efficient data management for incoherent ray tracing

Xin Yang

doi:10.1016/j.asoc.2012.07.002

2013-01-01

PRE

DOI：10.1016/j.asoc.2012.07.002

原文链接

原文求助

摘要

En 中文

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. Crown Copyright (C) 2012 Published by Elsevier B. V. All rights reserved.

Keyword:

Ray tracing

GPU

CUDA

Secondary ray

Memory access