The Community for Technology Leaders
Visualization Symposium, IEEE Pacific (2012)
Songdo, Korea (South)
Feb. 28, 2012 to Mar. 2, 2012
ISBN: 978-1-4673-0863-2
pp: 145-152
Chun-Ming Chen , The Ohio State University, USA
Lijie Xu , The Ohio State University, USA
Teng-Yok Lee , The Ohio State University, USA
Han-Wei Shen , The Ohio State University, USA
We present a file layout algorithm for flow fields to improve runtime I/O efficiency for out-of-core streamline computation. Because of the increasing discrepancy between the speed of processors and storage devices, the cost of I/O becomes a major bottleneck for out-of-core computation. To reduce the I/O cost, loading data with better spatial locality has proved to be effective. It is also known that sequential file access is more efficient. To facilitate efficient streamline computation, we propose to reorganize the data blocks in a file following the data access pattern so that more efficient I/O and effective prefetching can be accomplished. To achieve the goal, we divide the domain into small spatial blocks and order the blocks into a linear layout based on the underlying flow directions. The ordering is done using a weighted directed graph model which can be formulated as a linear graph arrangement problem. Our goal is to arrange the file in a way consistent with the data access pattern during streamline computation. This allows us to prefetch a contiguous segment of data at a time from disk and minimize the memory cache miss rate. We use a recursive partitioning method to approximate the optimal layout. Our experimental results show that the resulting file layout reduces I/O cost and hence enables more efficient out-of-core streamline computation.

C. Chen, L. Xu, H. Shen and T. Lee, "A flow-guided file layout for out-of-core streamline computation," Visualization Symposium, IEEE Pacific(PACIFICVIS), Songdo, Korea (South), 2012, pp. 145-152.
152 ms
(Ver 3.3 (11022016))