File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

정원기

Jeong, Won-Ki
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Distributed terascale volume visualization using distributed shared virtual memory

Author(s)
Jeong, Won-KiBeyer, JohannaHadwiger, MarkusSchneider, JensPfister, Hanspeter
Issued Date
2011-10-23
DOI
10.1109/LDAV.2011.6092332
URI
https://scholarworks.unist.ac.kr/handle/201301/46809
Fulltext
https://ieeexplore.ieee.org/document/6092332
Citation
1st IEEE Symposium on Large-Scale Data Analysis and Visualization 2011, LDAV 2011, pp.127 - 128
Abstract
Table 1 illustrates the impact of different distribution unit sizes, different screen resolutions, and numbers of GPU nodes. We use two and four GPUs (NVIDIA Quadro 5000 with 2.5 GB memory) and a mouse cortex EM dataset (see Figure 2) of resolution 21,494 x 25,790 x 1,850 = 955GB. The size of the virtual distribution units significantly influences the data distribution between nodes. Small distribution units result in a high depth complexity for compositing. Large distribution units lead to a low utilization of GPUs, because in the worst case only a single distribution unit will be in view, which is rendered by only a single node. The choice of an optimal distribution unit size depends on three major factors: the output screen resolution, the block cache size on each node, and the number of nodes. Currently, we are working on optimizing the compositing step and network communication between nodes.
Publisher
1st IEEE Symposium on Large-Scale Data Analysis and Visualization 2011, LDAV 2011

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.