Locality preserving load balancing with provably small overhead

Garmann, Robert

doi:10.1007/bfb0018529

Cited by 5 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Link and element vertices are partitioned independent of each other. A dynamic SP can be implemented with a worst case upper bound on the runtime [10,11].…”

Section: Parallelism and Communication Structure Of The Hramentioning

confidence: 99%

On the partitionability of hierarchical radiosity

Garmann

1999

Proceedings of the 1999 IEEE Symposium on Parallel Visualization and Graphics - PVGS '99

Self Cite

View full text Add to dashboard Cite

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 HRA 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.

show abstract

“…Link and element vertices are partitioned independent of each other. A dynamic SP can be implemented with a worst case upper bound on the runtime [10,11].…”

Section: Parallelism and Communication Structure Of The Hramentioning

confidence: 99%