Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1997)
Aizu-Wakamatsu, Fukushima, JAPAN
Mar. 17, 1997 to Mar. 21, 1997
Charles Hansen , Los Alamos National Laboratory
Michael Krogh , Los Alamos National Laboratory
James Painter , Los Alamos National Laboratory
As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory and parallelism of Massively Parallel Processors (MPPs) are becoming increasingly important. For large applications rendering on the MPP tends to be preferable to rendering on a graphics workstationdue to the MPP? s abundant resources: memory, disk, and numerous processors. The challenge becomes developing algorithms that can exploit these resources while minimizing overhead, typically communication costs. This paper will describe recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume render use a MIMD approach. Implementations for these algorithms are presented for the Thinking Machines Corporation CM-5 and the Cray Research Inc T3D.
Charles Hansen, Michael Krogh, James Painter, "Parallel Rendering Techniques for Massively Parallel Visualization", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 276, 1997, doi:10.1109/AISPAS.1997.581676