Histogram-Based I/O Optimization for Visualizing Large-Scale Data

TitleHistogram-Based I/O Optimization for Visualizing Large-Scale Data
Publication TypeConference Paper
Year of Publication2009
AuthorsHong, Y, Peterka, T, Shen, HW
Conference NameSuperComputing 2009 (SC 2009)
PublisherACM
Conference LocationPortland, OR
Other NumbersANL/MCS-P1698-1209
AbstractWe present an I/O optimization method for parallel volume rendering based on visibility and spatial locality. The combined met- ric is used to organize the file layout of the dataset on a parallel file system. This reduces the number of small, noncontiguous I/O operations and improves load balance among I/O servers. The net result is reduced I/O time. Since large-scale visualization is data-intensive, overall visualization performance improves using this method. This paper explains the preprocessing of data blocks to compute feature vectors and the storage organization based on them. Run-time performance is analyzed with a variety of transfer functions, view directions, system scales, and datasets. Our results show significant performance gains over file layouts based on space-filling curves.
URLhttp://dl.acm.org/citation.cfm?id=1838549
PDFhttp://www.mcs.anl.gov/papers/P1698.pdf