Hierarchical Visualization and Compression of Large Volume Datasets Using GPU Clusters
Institute of Visualization and Interactive Systems, University of Stuttgart, Germany
Eurographics Symposium on Parallel Graphics and Visualization (2004)
@article{strengert2004hierarchical,
title={Hierarchical visualization and compression of large volume datasets using GPU clusters},
author={Strengert, M. and Magall{‘o}n, M. and Weiskopf, D. and Guthe, S. and Ertl, T.},
journal={Parallel Graphics and Visualization},
year={2004},
publisher={Citeseer}
}
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object space, and the intermediate images are combined to a final picture in a sort-last approach. Hierarchical wavelet compression is applied to increase the effective size of volumes that can be handled. An adaptive rendering mechanism takes into account the viewing parameters and properties of the data set to adjust the texture resolution and number of slices. We discuss the specific issues of this adaptive and hierarchical approach in the context of a distributed memory architecture and present solutions for these problems. Furthermore, our compositing scheme takes into account the footprints of volume bricks to minimize the costs for reading from framebuffer, network communication, and blending. A detailed performance analysis is provided and scaling characteristics of the parallel system are discussed. For example, our tests on a 16-node PC cluster show a rendering speed of 5 frames per second for a 204810241878 data set on a 1024 viewport.
December 28, 2010 by hgpu
