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

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.

[1]  Kenneth Moreland,et al.  Scalable Rendering on PC Clusters , 2000, IEEE Computer Graphics and Applications.

[2]  Cauligi S. Raghavendra,et al.  Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers , 1996, IEEE Trans. Vis. Comput. Graph..

[3]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[4]  Thomas W. Crockett,et al.  An Introduction to Parallel Rendering , 1997, Parallel Comput..

[5]  Henry Fuchs,et al.  A sorting classification of parallel rendering , 1994, IEEE Computer Graphics and Applications.

[6]  Ross N. Williams,et al.  An extremely fast Ziv-Lempel data compression algorithm , 1991, [1991] Proceedings. Data Compression Conference.

[7]  Kenneth Moreland,et al.  Sort-last parallel rendering for viewing extremely large data sets on tile displays , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[8]  Kwan-Liu Ma,et al.  Parallel volume rendering using binary-swap compositing , 1994, IEEE Computer Graphics and Applications.

[9]  M. Levoy,et al.  Fast volume rendering using a shear-warp factorization of the viewing transformation , 1994, SIGGRAPH.

[10]  Rajkumar Buyya,et al.  High Performance Cluster Computing , 1999 .

[11]  Ulrich Neumann.  Parallel volume-rendering algorithm performance on mesh-connected multicomputers , 1993 .

[12]  Arie E. Kaufman,et al.  PVR: high-performance volume rendering , 1996 .

[13]  Marc Levoy,et al.  Display of surfaces from volume data , 1988, IEEE Computer Graphics and Applications.

[14]  Tulika Mitra,et al.  Implementation and evaluation of the parallel Mesa library , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).

[15]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[16]  Lee Westover,et al.  Footprint evaluation for volume rendering , 1990, SIGGRAPH.

[17]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[18]  William M. Hsu.  Segmented ray casting for data parallel volume rendering , 1993 .

[19]  Tadao Nakamura,et al.  Parallel processing of the shear-warp factorization with the binary-swap method on a distributed-memory multiprocessor system , 1997, PRS '97.

[20]  Hiroshi Tezuka,et al.  The design and implementation of zero copy MPI using commodity hardware with a high performance network , 1998, ICS '98.

[21]  Emilio Camahort,et al.  Integrating volume data analysis and rendering on distributed memory architectures , 1993 .

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.