Massively parallel volume rendering using 2-3 swap image compositing

Hongfeng Yu, Chaoli Wang, Kwan Liu Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

48 Citations (Scopus)

Abstract

The ever-increasing amounts of simulation data produced by scientists demand high-end parallel visualization capability. However, image compositing, which requires interprocessor 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 supercomputer with thousands of processors, and demonstrate its great flexibility as well as scalability.

Original languageEnglish (US)
Title of host publication2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008
DOIs
StatePublished - Dec 1 2008
Event2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008 - Austin, TX, United States
Duration: Nov 15 2008Nov 21 2008

Publication series

Name2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008

Other

Other2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008
CountryUnited States
CityAustin, TX
Period11/15/0811/21/08

Fingerprint

Volume rendering
Supercomputers
Scalability
Visualization
Communication
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Yu, H., Wang, C., & Ma, K. L. (2008). Massively parallel volume rendering using 2-3 swap image compositing. In 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008 [5219060] (2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008). https://doi.org/10.1109/SC.2008.5219060

Massively parallel volume rendering using 2-3 swap image compositing. / Yu, Hongfeng; Wang, Chaoli; Ma, Kwan Liu.

2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008. 2008. 5219060 (2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, H, Wang, C & Ma, KL 2008, Massively parallel volume rendering using 2-3 swap image compositing. in 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008., 5219060, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008, Austin, TX, United States, 11/15/08. https://doi.org/10.1109/SC.2008.5219060
Yu H, Wang C, Ma KL. Massively parallel volume rendering using 2-3 swap image compositing. In 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008. 2008. 5219060. (2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008). https://doi.org/10.1109/SC.2008.5219060
Yu, Hongfeng ; Wang, Chaoli ; Ma, Kwan Liu. / Massively parallel volume rendering using 2-3 swap image compositing. 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008. 2008. (2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008).
@inproceedings{88613ee85edd4756a76d7fe199abf6f9,
title = "Massively parallel volume rendering using 2-3 swap image compositing",
abstract = "The ever-increasing amounts of simulation data produced by scientists demand high-end parallel visualization capability. However, image compositing, which requires interprocessor 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 supercomputer with thousands of processors, and demonstrate its great flexibility as well as scalability.",
author = "Hongfeng Yu and Chaoli Wang and Ma, {Kwan Liu}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/SC.2008.5219060",
language = "English (US)",
isbn = "9781424428359",
series = "2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008",
booktitle = "2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008",

}

TY - GEN

T1 - Massively parallel volume rendering using 2-3 swap image compositing

AU - Yu, Hongfeng

AU - Wang, Chaoli

AU - Ma, Kwan Liu

PY - 2008/12/1

Y1 - 2008/12/1

N2 - The ever-increasing amounts of simulation data produced by scientists demand high-end parallel visualization capability. However, image compositing, which requires interprocessor 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 supercomputer with thousands of processors, and demonstrate its great flexibility as well as scalability.

AB - The ever-increasing amounts of simulation data produced by scientists demand high-end parallel visualization capability. However, image compositing, which requires interprocessor 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 supercomputer with thousands of processors, and demonstrate its great flexibility as well as scalability.

UR - http://www.scopus.com/inward/record.url?scp=70350752445&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350752445&partnerID=8YFLogxK

U2 - 10.1109/SC.2008.5219060

DO - 10.1109/SC.2008.5219060

M3 - Conference contribution

AN - SCOPUS:70350752445

SN - 9781424428359

T3 - 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008

BT - 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008

ER -