A load-balancing strategy for sort-first distributed rendering

Abraham, Frederico; Celes, Waldemar; Cerqueira, Renato; Campos, João L. E.

doi:10.1109/sibgra.2004.1352973

Cited by 25 publications

(4 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One additional advantage of the ray-casting approach is that the rays are processed in parallel, being the appropriate choice for sort-first distributed visualization using clusters Proceedings of the XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05) of PCs [1]. We also believe that the ray-casting approaches will greatly benefit from the upcoming graphics card generations.…”

Section: Resultsmentioning

confidence: 99%

High-Quality Hardware-Based Ray-Casting Volume Rendering Using Partial Pre-Integration

Espinha

Celes

2005

XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)

Self Cite

View full text Add to dashboard Cite

In this paper, we address the problem of the interactive volume rendering of unstructured meshes and propose a new hardware-based ray-casting algorithm using partial pre-integration. The proposed algorithm makes use of modern programmable graphics card and achieves rendering rates competitive with full pre-integration approaches (up to 2M tet/sec). This algorithm allows the interactive modification of the transfer function and results in high-quality images, since no artifact due to under-sampling the full numerical pre-integration exists. We also compare our approach with implementations of cell-projection algorithm and demonstrate that ray-casting can perform better than cell projection, because it eliminates the high costs involved in ordering and transferring data.

show abstract

Section: Resultsmentioning

confidence: 99%

High-Quality Hardware-Based Ray-Casting Volume Rendering Using Partial Pre-Integration

Espinha

Celes

2005

XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)

Self Cite

View full text Add to dashboard Cite

show abstract

“…They have been concentrated on efficient and optimized implementations of volume rendering algorithms and data structures used to explore GPU features and to avoid clusters bottlenecks. The cluster-based works focused on solving: load balancing [7], [11], screen partition [12], [13], dataset division [6], [14], or image composition communication [5], [8]. The GPU-based works focused on: exploring the GPU hardware features [15], [1], dealing with the memory limitation problem [16], [3], and exploring GPU clusters [17], [4].…”

Section: A Speeding Up Volume Renderingmentioning

confidence: 99%

Irregular Grid Raycasting Implementation on the Cell Broadband Engine

Cox

Maximo

Bentes

et al. 2009

2009 21st International Symposium on Computer Architecture and High Performance Computing

View full text Add to dashboard Cite

Direct volume rendering has become a popular technique for visualizing volumetric data from sources such as scientific simulations, analytic functions, medical scanners, among others. Volume rendering algorithms, such as raycasting, can produce high-quality images, however, the use of raycasting has been limited due to its high demands on computational power and memory bandwidth. In this paper, we propose a new implementation of the raycasting algorithm that takes advantage of the highly parallel architecture of the Cell Broadband Engine processor, with 9 heterogeneous cores, in order to allow efficient raycasting of irregular datasets. All the computational power of the Cell BE processor, though, comes at the cost of a different programming model. Applications need to be rewritten, which requires using multithreading and vectorized code. In our approach, we tackle this problem by distributing ray computations using the visible faces, and vectorizing the lighting integral operations inside each core. Our experimental results show that we can obtain good speedups reducing the overall rendering time significantly.

show abstract

“…Some approaches have been proposed to solve this problem for sort-first parallel rendering such as partitioning one screen tile into some smaller subtiles by some heuristics and assigning the sub-tiles among cluster nodes 13 . These methods can alleviate the load-imbalance problem but they also introduce new problems.…”

Section: Sort-first Occlusion Cullingmentioning

confidence: 99%

Parallel strategies of occlusion culling on cluster of GPUs

Xiong

Peng²,

Qin³

et al. 2007

Computer Animation & Virtual

View full text Add to dashboard Cite

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

show abstract

A load-balancing strategy for sort-first distributed rendering

Cited by 25 publications

References 17 publications

High-Quality Hardware-Based Ray-Casting Volume Rendering Using Partial Pre-Integration

High-Quality Hardware-Based Ray-Casting Volume Rendering Using Partial Pre-Integration

Irregular Grid Raycasting Implementation on the Cell Broadband Engine

Parallel strategies of occlusion culling on cluster of GPUs

Contact Info

Product

Resources

About