Coherence-based Analysis of GPU-assisted Ray Tracing Acceleration Structures
Date Issued
2006
Date
2006
Author(s)
Hsu, Shih-hsuan
DOI
en-US
Abstract
With the rapidly increasing processing power and the growing of the levels of the programmability of graphics processing units (GPUs), GPUs have become popular platforms for doing lots of computation-intensive jobs. However, while transferring programs from CPUs to GPUs, many issues have to be taken into consideration to make the programs execute efficiently on GPU's SIMD architecture. In this thesis, we put our focus on three acceleration structures for the GPU ray tracing algorithm: uniform grid, KD-tree, and bounding volume hierarchies. The concepts about how to do the general purpose computations on GPUs (GPGPU) and the techniques used in the GPGPU programming are introduced first. Then we give the details about the construction of these acceleration structures and how to do the traversal with GPU implementations. Afterward, we discuss the performance differences among them from the coherence's point of view. Experiments about the control coherence and the data coherence, such as texture fetching patterns, ray order while doing traversing, the looping limit of a shader, and the hardware-assisted z-culling, are performed to reveal the distinct characteristics of different structures. By observing the results of these coherencebased experiments, we get better understandings about the underlying GPU architecture and have more insights about how to maximize the capabilities of GPUs to increase the performance of the ray tracing algorithm.
Subjects
繪圖加速器
光線追蹤法
光線追蹤法加速結構
一致性
coherence
GPU
ray tracing
ray tracing acceleration structure
BVH
KD-tree
uniform grid
graphics hardware
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93922007-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):990e82f66cc93d65e4b028996ec2461c