Data Locality in Parallel Rendering  Frederik Jansen and Erik Reinhard

Frederik W. Jansen and Erik Reinhard, "Data Locality in Parallel Rendering", In Second Eurographics Workshop on Parallel Graphics and Visualisation, pages 1-15. Eurographics, September 1998

One of the main challenges in global illumination is rendering scenes with millions of polygons and megabytes of textures. Combining the processing power and the memory of multiple processors or workstations to render these complex scenes is an attractive proposition but the complex interactions between data and processing introduces a significant amount of data communication. Data locality methods may improve cache coherence and cache access coherence by finding an optimal data partitioning, by re-ordering computations, and by replac-ing complex geometry with simplified image-based representations. We review the different data locality methods and focus on local caching of global radiance values. We present the results of an implementation in the ray tracing program Radiance.

Full paper (pdf)
Bibtex entry