Skip to main content

Parallelization of a Discrete Radiosity Method

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4128)

Abstract

In this paper we present three different parallelizations of a discrete radiosity method achieved on a cluster of workstations. This radiosity method has lower complexity when compared with most of the radiosity algorithms and is based on the discretization of surfaces into voxels and not into patches. The first two parallelizations distribute the tasks. They present good performance in time but they did not distribute the data. The third parallelization distributes voxels and required the transmission of small part of the voxels between machines. It improved time while distributing data.

Keywords

  • Load Balance
  • Lexicographic Order
  • Sequential Algorithm
  • Dynamic Load Balance
  • Shared Memory System

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Chatelier, P., Malgouyres, R.: A Low Complexity Discrete Radiosity Method. Discrete Geometry for Computer Imagery 3429, 392–403 (2005)

    CrossRef  MathSciNet  Google Scholar 

  2. Arnaldi, B., Priol, T., Renambot, L., Pueyo, X.: Visibility Masks for solving Complex Radiosity Computations on Mutliprocessors. Parallel Computing 23(7), 887–897 (1988)

    CrossRef  Google Scholar 

  3. Renambot, L., Arnaldi, B., Priol, T., Pueyo, X.: Towards Efficient Parallel Radiosity for DSM-based Parallel Computers Using Virtual Interfaces. In: Proceedings of the IEEE symposium on Parallel rendering, pp. 76–86 (1993)

    Google Scholar 

  4. Funkhouser, T.A.: Coarse-grained parallelism for hierarchical radiosity using group iterative methods. In: Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, pp. 343–352 (1996)

    Google Scholar 

  5. Feschet, F., Miguet, S., Perroton, L.: Parlist: a parallel data structure for dynamic load balancing. Journal of Parallel and Distributed Computing 51, 114–135 (1998)

    MATH  CrossRef  Google Scholar 

  6. Malgouyres, R.: A Discrete Radiosity Method. Discrete Geometry for Computer Imagery 2301, 428–438 (2002)

    CrossRef  MathSciNet  Google Scholar 

  7. Smith, B., Arvo, J., Donald, G.: A clustering algorithm for radiosity in complex environments. In: Proceedings of the 21st annual conference on Computer graphics and interactive techniques, vol. 28, pp. 435–442 (1994)

    Google Scholar 

  8. Podehl, A., Rauber, T., Runger, G.: A Shared-Memory Implementation of the Hierarchical Radiosity Method. Theoretical Computer Science 196, 215–240 (1998)

    MATH  CrossRef  Google Scholar 

  9. Bouatouch, K., Mebard, D., Priol, T.: Parallel Radiosity Using a Shared Virtual Memory. In: Proceedings of Advanced Techniques in Animation, Rendering and Visualization, pp. 71–83 (1993)

    Google Scholar 

  10. Sturzlinger, W., Wild, C.: Parallel Visibility Calculations for Radiosity. In: Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing, pp. 405–413 (1994)

    Google Scholar 

  11. Yu, Y., Oscar, H., Yang, T.: Parallel progressive radiosity with adaptive meshing. Journal of Parallel and Distributed Computing 42(1), 30–41 (1997)

    CrossRef  Google Scholar 

  12. BarLev, A., Itzkovitz, A., Raviv, A., Schuster, A.: Parallel Vertex-To-Vertex Radiosity on a Distributed Shared Memory System. Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel. J. Diff. Eq. 1457, 238–250 (1998)

    CrossRef  Google Scholar 

  13. Sillion, F., Hasenfratz, J.M.: Efficient Parallel Refinement for Hierarchial Radiosity on a DSM Computer. In: Third Eurographics Workshop on Parallel Graphics and Visualisation, pp. 61–74 (2000)

    Google Scholar 

  14. Guitton, P., Roman, J., Subrenat, G.: Implementation Results and Analysis of a Parallel Progressive Radiosity. In: Proceedings of the IEEE symposium on Parallel rendering, pp. 31–38 (1995)

    Google Scholar 

  15. Cohen, M.F., Greenberg, D.F.: The hemi-cube: a radiosity solution for complex environments. In: SIGGRAPH 1985: Proceedings of the 12th annual conference on Computer graphics and interactive techniques, vol. 19(3), pp. 31–40 (1985)

    Google Scholar 

  16. Martínez, R., Sbert, M., Szirmay-Kalosv, L.: Parallel Multipath with Bundles of Lines. In: Third Eurographics Workshop on Parallel Graphics and Visualisation (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zrour, R., Chatelier, P., Feschet, F., Malgouyres, R. (2006). Parallelization of a Discrete Radiosity Method. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds) Euro-Par 2006 Parallel Processing. Euro-Par 2006. Lecture Notes in Computer Science, vol 4128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11823285_77

Download citation

  • DOI: https://doi.org/10.1007/11823285_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37783-2

  • Online ISBN: 978-3-540-37784-9

  • eBook Packages: Computer ScienceComputer Science (R0)