By Topic

Data parallelization of Kd-tree ray tracing on the Cell Broadband Engine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yi Pang ; Computer Science Department, Tsinghua University, Beijing, China ; Lifeng Sun ; Shiqiang Yang

Ray tracing is a widely used rendering technique in computer graphics, and its intense computational requirement prohibits real-time ray tracing applications wide use in consumer markets. One main feature of ray tracing is parallelism and the mainstream computer market is switching to systems with multi-core. In this paper, in order to accelerate ray tracing to achieve real-time processing, we propose a data parallel kd-tree ray tracing algorithm on cell broadband engine (Cell/B.E.) which is a state-of-the-art multi-core processor. This paper expounds the feasibility and key issues of kd-tree ray tracing on the Cell/B.E. processor and introduces the implementation and cell-specific in ray tracing program design. The results highlight that our parallel algorithm for kd-tree ray tracing is scalable with a matrix of cores, resolutions or different object models. The execution time reduces from several minutes to several seconds.

Published in:

2009 IEEE International Conference on Multimedia and Expo

Date of Conference:

June 28 2009-July 3 2009