An improved binary-swap compositing for sort-last parallel rendering on distributed memory multiprocessors

Authors:
Akira Takeuchi;Fumihiko Ino;Kenichi Hagihara
Affiliations:
Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan;Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan;Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan
Venue:
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Year:
2003

Citing 19
Cited 14

Display of Surfaces from Volume Data

IEEE Computer Graphics and Applications
Footprint evaluation for volume rendering

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Segmented ray casting for data parallel volume rendering

PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Integrating volume data analysis and rendering on distributed memory architectures

PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Parallel volume-rendering algorithm performance on mesh-connected multicomputers

PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A Sorting Classification of Parallel Rendering

IEEE Computer Graphics and Applications
Fast volume rendering using a shear-warp factorization of the viewing transformation

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
An introduction to parallel rendering

Parallel Computing - Special issue on applications: parallel graphics and visualisation
The design and implementation of zero copy MPI using commodity hardware with a high performance network

ICS '98 Proceedings of the 12th international conference on Supercomputing
Efficient Compositing Methods for the Sort-Last-Sparse Parallel Volume Rendering System on Distributed Memory Multicomputers

The Journal of Supercomputing
Volume rendering

SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Sort-last parallel rendering for viewing extremely large data sets on tile displays

PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
High Performance Cluster Computing: Programming and Applications

High Performance Cluster Computing: Programming and Applications
Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers

IEEE Transactions on Visualization and Computer Graphics
PVR: High-Performance Volume Rendering

IEEE Computational Science & Engineering
Parallel Volume Rendering Using Binary-Swap Compositing

IEEE Computer Graphics and Applications
Scalable Rendering on PC Clusters

IEEE Computer Graphics and Applications
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
Implementation and Evaluation of the Parallel Mesa Library

ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems

Hybrid Hardware-Accelerated Image Composition for Sort-Last Parallel Rendering on Graphics Clusters with Commodity Image Compositor

VV '04 Proceedings of the 2004 IEEE Symposium on Volume Visualization and Graphics
A data distributed parallel algorithm for nonrigid image registration

Parallel Computing
Two-stage compression for fast volume rendering of time-varying scalar data

Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
NPU-Based Image Compositing in a Distributed Visualization System

IEEE Transactions on Visualization and Computer Graphics
Massively parallel volume rendering using 2-3 swap image compositing

Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Pipelining parallel image compositing and delivery for efficient remote visualization

Journal of Parallel and Distributed Computing
A configurable algorithm for parallel image-compositing applications

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Efficient pipelining parallel methods for image compositing in sort-last rendering

NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Parallel volume rendering with early ray termination for visualizing large-scale datasets

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
PerWiz: a what-if prediction tool for tuning message passing programs

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
Direct send compositing for parallel sort-last rendering

EG PGV'07 Proceedings of the 7th Eurographics conference on Parallel Graphics and Visualization
A decomposition approach for optimizing large-scale parallel image composition on multi-core MPP systems

EG PGV'09 Proceedings of the 9th Eurographics conference on Parallel Graphics and Visualization
Accelerating and benchmarking radix-k image compositing at large scale

EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
Fast compositing for cluster-parallel rendering

EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sort-last parallel rendering is a good rendering scheme on distributed memory multiprocessors. This paper presents an improvement on the binary-swap (BS) method, which is an efficient image compositing algorithm for sort-last parallel rendering. Our compositing method uses three acceleration techniques, compared to the original BS method: (1) the interleaved splitting, (2) multiple bounding rectangle, and (3) run-length encoding. Through the use of the three techniques, our method balances the compositing workload among processors, exploits more sparsity of the image, and reduces the cost of communication.We also show some experimental results on a PC cluster. The results show that our method completes the image compositing faster than the original BS method, and its speedup to the original increases with the number of processors.