Massively parallel volume rendering using 2-3 swap image compositing

Hongfeng Yu, Chaoli Wang, Kwan Liu Ma

Research output: Contribution to conferencePaper

4 Citations (Scopus)

Abstract

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)
DOIs
StatePublished - Dec 1 2008
EventACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08 - Singapore, Singapore
Duration: Dec 10 2008Dec 13 2008

Other

OtherACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08
CountrySingapore
CitySingapore
Period12/10/0812/13/08

Fingerprint

Volume rendering
Scalability
Visualization
Communication
Experiments

ASJC Scopus subject areas

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

Cite this

Yu, H., Wang, C., & Ma, K. L. (2008). Massively parallel volume rendering using 2-3 swap image compositing. Paper presented at ACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08, Singapore, Singapore. https://doi.org/10.1145/1508044.1508084

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

2008. Paper presented at ACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08, Singapore, Singapore.

Research output: Contribution to conferencePaper

Yu, H, Wang, C & Ma, KL 2008, 'Massively parallel volume rendering using 2-3 swap image compositing' Paper presented at ACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08, Singapore, Singapore, 12/10/08 - 12/13/08, . https://doi.org/10.1145/1508044.1508084
Yu H, Wang C, Ma KL. Massively parallel volume rendering using 2-3 swap image compositing. 2008. Paper presented at ACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08, Singapore, Singapore. https://doi.org/10.1145/1508044.1508084
Yu, Hongfeng ; Wang, Chaoli ; Ma, Kwan Liu. / Massively parallel volume rendering using 2-3 swap image compositing. Paper presented at ACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08, Singapore, Singapore.
@conference{8ce802afa9674d6892511c37ef22dcc1,
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 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.",
author = "Hongfeng Yu and Chaoli Wang and Ma, {Kwan Liu}",
year = "2008",
month = "12",
day = "1",
doi = "10.1145/1508044.1508084",
language = "English (US)",
note = "ACM SIGGRAPH ASIA 2008 Courses, SIGGRAPH Asia'08 ; Conference date: 10-12-2008 Through 13-12-2008",

}

TY - CONF

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

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

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

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

U2 - 10.1145/1508044.1508084

DO - 10.1145/1508044.1508084

M3 - Paper

AN - SCOPUS:67649887327

ER -