By Topic

Parallel rendering techniques for massively parallel visualization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
C. Hansen ; Adv. Comput. Lab., Los Alamos Nat. Lab., NM, USA ; M. Krogh ; J. Painter

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 an 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 is developing algorithms that can exploit these resources while minimizing overheads, typically communication costs. This paper describes recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. It presents rendering algorithms, developed for MPPs, for polygonal, spherical and volumetric data. The polygon algorithm uses a data-parallel approach, whereas the sphere and volume rendering use a MIMD approach. Implementations for these algorithms are presented for a Thinking Machines Corp. CM-5 and a Cray Research Inc. T3D

Published in:

Parallel Algorithms/Architecture Synthesis, 1997. Proceedings., Second Aizu International Symposium

Date of Conference:

17-21 Mar 1997