Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Radiosity and realistic image synthesis
Radiosity and realistic image synthesis
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Parallel hierarchical radiosity rendering
Parallel hierarchical radiosity rendering
Parallel hierarchical N-body methods and their implications for multiprocessors
Parallel hierarchical N-body methods and their implications for multiprocessors
Coarse-grained parallelism for hierarchical radiosity using group iterative methods
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Maintaining dynamic geometric objects on parallel processors
PRS '97 Proceedings of the IEEE symposium on Parallel rendering
Radiosity and Global Illumination
Radiosity and Global Illumination
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Locality Preserving Load Balancing with Provably Small Overhead
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Parallel ray tracing on a chip
Practical parallel rendering
PHR: A Parallel Hierarchical Radiosity System with Dynamic Load Balancing
The Journal of Supercomputing
| Hi-index | 0.00 |
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 a potential DM implementation. We compare “optimal” partitioning results obtained by the partitioning software Metis with a trivial and a spatial partitioning algorithm, and show that the spatial partitioning copes with most of the bottlenecks well.