Scalable Parallel Cell-Projection Volume Rendering Algorithm for Three-Dimensional Unstructured Data

摘要

The goal of this research is to develop a fast, efficient parallel volumerendering algorithm for massively parallel distributed-memory supercomputers consisting of a large number of very powerful processors. We use cell-projection instead of ray-casting to provide maximum flexibility in the data distribution and rendering steps. Effective static load balancing is achieved with a round robin distribution of data cells among the processors. A spatial partitioning tree is used to guide the rendering, optimize the image compositing step, and reduce memory consumption. Communication cost is reduced by buffering messages and by overlapping communication with rendering calculatious as much as possible. Tests on the IBM SP2 demonstrate that these strategies provide high rendering rates and good scalability. For a dataset containing half a million tetrahedral cells, we achieve two frames per second for a 400x400-pixel image using 128 processors.