Massively parallel volume rendering using 2-3 swap image compositing

Hongfeng Yu, Chaoli Wang, Kwan Liu Ma

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations


The ever-increasing amounts of simulation data produced by scientists demand high-end parallel visualization capability. However, image compositing, which requires inter- processor communication, is often the bottleneck stage for parallel rendering of large volume data sets. Existing image compositing solutions either incur a large number of messages exchanged among processors (such as the direct send method), or limit the number of processors that can be effectively utilized (such as the binary swap method). We introduce a new image compositing algorithm, called 2-3 swap, which combines the flexibility of the direct send method and the optimality of the binary swap method. The 2-3 swap algorithm allows an arbitrary number of processors to be used for compositing, and fully utilizes all participating processors throughout the course of the compositing. We experiment with this image compositing solution on a super computer with thousands of processors, and demonstrate its great flexibility as well as scalability.

Original languageEnglish (US)
StatePublished - 2008
EventACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08 - Singapore, Singapore
Duration: Dec 10 2008Dec 13 2008


OtherACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Human-Computer Interaction
  • Media Technology


Dive into the research topics of 'Massively parallel volume rendering using 2-3 swap image compositing'. Together they form a unique fingerprint.

Cite this