Parallel hierarchical computation of specular radiosity

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.