By Topic

Parallel hierarchical computation of specular radiosity

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
$31 $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

2 Author(s)
Richard, J. ; Stanford Univ., CA, USA ; Singh, J.P.

Computing radiosity is a very expensive problem in computer graphics. Recent hierarchical methods have greatly speeded up the computation of first diffuse and now also specular radiosity. The authors present a parallel algorithm for computing both diffuse and specular radiosity together, and discuss the techniques they used to improve its performance. The algorithm is both irregular and highly unpredictable. Despite this, by carefully designing a parallel algorithm that minimizes synchronization and memory access overhead and by identifying and correcting several synchronization bottlenecks that they did not anticipate, they were able to obtain speedups of 26.3 on a 32-processor machine with distributed memory and 14.2 on a 16-processor machine with centralized memory. They demonstrate how execution profiles obtained at runtime, for example time spent waiting at different locks, can be used to significantly improve the performance of complex, irregular parallel applications

Published in:

Parallel Rendering, 1997. PRS 97. Proceedings. IEEE Symposium on

Date of Conference:

20-21 Oct 1997