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 language | English (US) |
---|---|
Title of host publication | 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008 |
DOIs | |
State | Published - Dec 1 2008 |
Event | 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008 - Austin, TX, United States Duration: Nov 15 2008 → Nov 21 2008 |
Other
Other | 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008 |
---|---|
Country | United States |
City | Austin, TX |
Period | 11/15/08 → 11/21/08 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Software