Share Email Print

Proceedings Paper

Parallel volume rendering on distributed-memory multiprocessor system
Author(s): Wenping Chen; Junhui Deng; Zesheng Tang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Several approaches have been proposed to visualize 3D volume data on multiprocessor systems in recent years. Most of these algorithms are tailored for special architectures and hard to immigrate to new architectures, such as Tsinghua High-Performance Cluster System (THPCS), a distributed-memory multiprocessor system. In this paper, a parallel volume rendering algorithm is presented for THPCS. To reduce the communication cost and the complexity of blending local intermediate images, a static subtask distribution strategy is proposed. Combined with the prediction for the subtask load and node performance, our strategy yields a good load balance. An asynchronous binary compositing method is adopted to provide flexibility for our algorithm. The experimental results demonstrate the efficiency and practicality of our algorithm. As a result, THPCS using our algorithm achieves performance ofrendering 512 x 512 color image for 128x 128x 197 volume within 1 second.

Paper Details

Date Published: 31 July 2002
PDF: 6 pages
Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); doi: 10.1117/12.477100
Show Author Affiliations
Wenping Chen, Tsinghua Univ. (China)
Junhui Deng, Tsinghua Univ. (China)
Zesheng Tang, Tsinghua Univ. (China)

Published in SPIE Proceedings Vol. 4875:
Second International Conference on Image and Graphics
Wei Sui, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?