Parallel strategies of occlusion culling on cluster of GPUs

Abstract

AbstractParallel rendering, visibility culling and level‐of‐detail are key techniques to improve the rendering performance for large geometric data sets. Although each of these techniques has been researched extensively and some systems have been developed to combine them together. However, parallel occlusion culling, that is distributing the computation of occlusion culling to multiple computing nodes such as a CPUs cluster or a GPUs cluster, has rarely been touched. This is because most existing occlusion culling algorithms are difficult to parallelize or do not scale well when parallelized. We first introduce a novel occlusion culling algorithm that uses the occlusion query functionality provided by current GPU. We employ a visibility prediction technique based on temporal coherence to reduce the times of occlusion query. Furthermore, different strategies of parallelizing the occlusion culling algorithm on a GPUs cluster are proposed including data parallelism strategies and functionality parallelism strategies. Data parallelism strategies decompose the data sets for occlusion query into disjoint parts and map these queries on different cluster nodes for parallel execution while functionality parallelism strategies assemble an occlusion culling pipeline with multiple cluster nodes which outputs image stream steadily. We propose a number of solutions to some special issues on parallelizing this occlusion culling algorithm, such as the transferring of data dependency and the load‐balancing of occlusion culling pipeline. Experimental results demonstrate the efficiency of the proposed parallelism strategies of the occlusion culling algorithm based on the visibility predictor. Copyright © 2007 John Wiley & Sons, Ltd.