Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Application-controlled demand paging for out-of-core visualization
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
3D scan-conversion algorithms for voxel-based graphics
I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
The working set model for program behavior
Communications of the ACM
Compiler-based I/O prefetching for out-of-core applications
ACM Transactions on Computer Systems (TOCS)
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Global static indexing for real-time exploration of very large regular grids
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Out-Of-Core Rendering of Large, Unstructured Grids
IEEE Computer Graphics and Applications
Efficient Organization of Large Multidimensional Arrays
Proceedings of the Tenth International Conference on Data Engineering
Prefetching for Visual Data Exploration
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Optimizing Retrieval and Processing of Multi-Dimensional Scientific Datasets
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
ACM SIGGRAPH 2004 Course Notes
Iteration aware prefetching for large multidimensional datasets
SSDBM'2005 Proceedings of the 17th international conference on Scientific and statistical database management
Knowledge-based out-of-core algorithms for data management in visualization
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
Hi-index | 0.00 |
Given the size of today's data, out-of-core visualization techniques are increasingly important in many domains of scientific research. In earlier work a technique called dynamic chunking [1] was proposed that can provide significant performance improvements for an out-of-core, arbitrary direction slicer application. In this work we validate dynamic chunking for several common data access patterns used in volume visualization applications. We propose optimizations that take advantage of extra knowledge about how data is accessed or knowledge about the behavior of previous iterations and can significantly improve performance. We present experimental results that show that dynamic chunking has performance close to regular chunking but has the added advantage that no reorganization of data is required. Dynamic chunking with the proposed optimizations can be significantly faster on average than chunking for certain common data access patterns.