Coarse-grained parallelism for hierarchical radiosity using group iterative methods

This paper describes algorithms that allow multiple hierarchical radiosity solvers to work on the same radiosity solution in parallel. We have developed a system based on a group iterative approach that repeatedly: 1) partitions patches into groups, 2) distributes a copy of each group to a slave processor which updates radiosities for all patches in that group, and 3) merges the updates back into a master solution. The primary advantage of this approach is that separate instantiations of a hierarchical radiosity solver can gather radiosity to patches in separate groups in parallel with very little contention or communication overhead. This feature, along with automatic partitioning and dynamic load balancing algorithms, enables our implemented system to achieve significant speedups running on moderate numbers of workstations connected by a local area network. This system has been used to compute the radiosity solution for a very large model representing a five floor building with furniture. CR

[1]  François X. Sillion,et al.  A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters , 1995, IEEE Trans. Vis. Comput. Graph..

[2]  Gary L. Miller,et al.  On the performance of spectral graph partitioning methods , 1995, SODA '95.

[3]  Marc Levoy,et al.  Parallel visualization algorithms: performance and architectural implications , 1994, Computer.

[4]  James Arvo,et al.  A clustering algorithm for radiosity in complex environments , 1994, SIGGRAPH.

[5]  George Drettakis,et al.  Tightly-Coupled Multiprocessing for a Global Illumination Algorithm , 1990, Eurographics.

[6]  Werner Purgathofer,et al.  Progressive Refinement Radiosity on a Transputer Network , 1994 .

[7]  Donald P. Greenberg,et al.  Modeling the interaction of light between diffuse surfaces , 1984, SIGGRAPH.

[8]  Seth J. Teller,et al.  Global visibility algorithms for illumination computations , 1993, SIGGRAPH.

[9]  Louis A. Hageman,et al.  Iterative Solution of Large Linear Systems. , 1971 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  GuptaAnoop,et al.  Parallel Visualization Algorithms , 1994 .

[12]  John R. Wallace,et al.  A Ray tracing algorithm for progressive radiosity , 1989, SIGGRAPH '89.

[13]  Seth Teller,et al.  Visibility Computations in Densely Occluded Polyhedral Environments , 1992 .

[14]  Donald P. Greenberg,et al.  Acceleration techniques for progressive refinement radiosity , 1990, I3D '90.

[15]  Derek J. Paddon,et al.  Parallel processing of the radiosity method , 1994, Comput. Aided Des..

[16]  Pat Hanrahan,et al.  A rapid hierarchical radiosity algorithm , 1991, SIGGRAPH.

[17]  Donald P. Greenberg,et al.  An Efficient Radiosity Approach for Realistic Image Synthesis , 1986, IEEE Computer Graphics and Applications.

[18]  Peter Shirley,et al.  Efficient parallel global illumination using density estimation , 1995, PRS.

[19]  Murray Hill.  Constructing Good Partitioning Trees , 1996 .

[20]  Daniel R. Baum,et al.  Real time radiosity through parallel processing and hardware acceleration , 1990, I3D '90.

[21]  Jean Roman,et al.  Implementation results and analysis of a parallel progressive radiosity , 1995 .

[22]  Derek J. Paddon,et al.  Parallel Processing of Progressive Refinement Radiosity Methods , 1994 .

[23]  Donald P. Greenberg,et al.  A progressive refinement approach to fast radiosity image generation , 1988, SIGGRAPH.

[24]  Pat Hanrahan,et al.  Wavelet radiosity , 1993, SIGGRAPH.

[25]  Steven M. Drucker,et al.  Fast Radiosity Using a Data Parallel Architecture , 1992 .

[26]  Seth J. Teller,et al.  Partitioning and ordering large radiosity computations , 1994, SIGGRAPH.

[27]  Donald P. Greenberg,et al.  Modeling the interaction of light between diffuse surfaces , 1998 .

[28]  Thierry Priol,et al.  Data management scheme for parallel radiosity , 1994, Comput. Aided Des..