On the partitionability of hierarchical radiosity

@article{Garmann1999OnTP,
  title={On the partitionability of hierarchical radiosity},
  author={Robert Garmann},
  journal={Proceedings 1999 IEEE Parallel Visualization and Graphics Symposium (Cat. No.99EX381)},
  year={1999},
  pages={69-78}
}
The Hierarchical Radiosity Algorithm (HRA) is one of the most efficient sequential algorithms for physically based rendering. Unfortunately, it is hard to implement in parallel. There exist fairly efficient shared-memory implementations but things get worst in a distributed memory (DM) environment. In this paper we examine the structure of the IIRA in a graph partitioning setting. Various measurements performed on the task access graph of the HRA indicate the existance of several bottlenecks in… CONTINUE READING
6 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Carter.Parallel Hierarchical Radiosity Rendering

  • M B.
  • PhD thesis,
  • 1993
Highly Influential
11 Excerpts

Singh.Parallel Hierarchical N-Body Methods And Their Implications For Multiprocessors

  • J P.
  • PhD thesis,
  • 1993
Highly Influential
7 Excerpts

Parallel Decomposition Of View-Indepen dent Global Illumination Algorithms

  • D. M. Zareski
  • 1996
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…