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 capa-bility. However, image compositing, which requires inter-processor communication, is often the bottleneck stage for parallel rendering of large volume data sets. Existing im-age 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 participat-ing 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. 1.

Ähnliche Arbeiten