HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Partitioning and Scheduling Large Radiosity Computations in Parallel

Xavier Cavin 1 Jean-Claude Paul 1 Laurent Alonso 1
1 ISA - Models, algorithms and geometry for computer graphics and vision
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We show, in this paper, how it is feasible to efficiently perform large radiosity computations on a conventional (distributed) shared memory multiprocessor machine. Hierarchical radiosity algorithms, although computationally expensive, are an efficient view-independent way to compute the global illumination which gives the visual ambiance to a scene. Their effective parallelization is made challenging, however, by their non-uniform, dynamically changing characteristics, and their need for long-range communication. To address this need, we have developed appropriate partitioning and scheduling techniques, that deliver an optimal load balancing, while still exhibiting excellent data locality. We provide the detailed implementation of these techniques and present results of experiments showing very good acceleration and scalability performances. The accurate radiosity solutions required to render high quality images of an extremely large model are computed in a reasonable time. The rendering capabilities of modern graphics hardware are then used to visualize this virtual pre-lit environment in real-time.
Document type :
Journal articles
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:50:52 AM
Last modification on : Friday, February 4, 2022 - 3:30:49 AM


  • HAL Id : inria-00099086, version 1



Xavier Cavin, Jean-Claude Paul, Laurent Alonso. Partitioning and Scheduling Large Radiosity Computations in Parallel. Scalable Computing : Practice and Experience, West University of Timisoara, 2000, 3 (3), 12 p. ⟨inria-00099086⟩



Record views