Parallel rendering techniques for massively parallel visualization

Conference · Sat Jul 01 04:00:00 EDT 1995

OSTI ID:106430

Hansen, C; Krogh, M; Painter, J

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 workstation due 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 Ma.chines Corporation CM-5 MPP.

• Research Organization: Los Alamos National Lab., NM (United States)
• Sponsoring Organization: USDOE, Washington, DC (United States)
• DOE Contract Number: W-7405-ENG-36
• OSTI ID: 106430
• Report Number(s): LA-UR--95-1766; CONF-9507166--1; ON: DE95015317
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
ARRAY PROCESSORS
COMPUTER GRAPHICS
COMPUTERIZED SIMULATION
PARALLEL PROCESSING