Efficient Parallel Refinement for Hierarchical Radiosity on a DSM computer

François X. Sillion 1 Jean-Marc Hasenfratz 1
1 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes
Abstract : We introduce a simple, yet efficient extension to the hierarchical radiosity algorithm for the simulation of global illumination, taking advantage of a distributed shared memory (DSM) parallel architecture. Our task definition is based on a very fine grain decompo-sition of the refinement process at the level of individual pairs of hierarchical elements, therefore allowing a very simple implementation from an existing code with minimal mod-ifications. We describe a generic refinement scheme based on a scheduler, allowing both easy parallelization and reordering of refinement tasks, which is useful for interactive and user-driven applications. We show that a very simple task grouping mechanism suffices to avoid excessive time waste in synchronization. Results obtained on an SGI Origin computer with 64 processors validate the approach, with excellent speedups using the full capacity of the machine.
Keywords : hierarchical radiosity
Document type :
Conference papers
Complete list of metadatas


https://hal.inria.fr/inria-00426144
Contributor : Jean-Marc Hasenfratz <>
Submitted on : Friday, October 23, 2009 - 5:14:33 PM
Last modification on : Wednesday, April 11, 2018 - 1:51:59 AM
Long-term archiving on : Thursday, June 17, 2010 - 5:45:47 PM

Files

Identifiers

  • HAL Id : inria-00426144, version 1

Collections

INRIA | UGA | IMAG

Citation

François X. Sillion, Jean-Marc Hasenfratz. Efficient Parallel Refinement for Hierarchical Radiosity on a DSM computer. Third Eurographics Workshop on Parallel Graphics and Visualisation, Sep 2000, Girona, Spain. pp.61--74. ⟨inria-00426144⟩

Share

Metrics

Record views

240

Files downloads

1118