Paper
31 July 2002 Parallel volume rendering on distributed-memory multiprocessor system
Wenping Chen, Junhui Deng, Zesheng Tang
Author Affiliations +
Proceedings Volume 4875, Second International Conference on Image and Graphics; (2002) https://doi.org/10.1117/12.477100
Event: Second International Conference on Image and Graphics, 2002, Hefei, China
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wenping Chen, Junhui Deng, and Zesheng Tang "Parallel volume rendering on distributed-memory multiprocessor system", Proc. SPIE 4875, Second International Conference on Image and Graphics, (31 July 2002); https://doi.org/10.1117/12.477100
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Volume rendering

Binary data

Data communications

Image processing

Computing systems

Head

Telecommunications

RELATED CONTENT


Back to Top