Design and evaluation of a compiler algorithm for prefetching
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Lossless compression of volume data
VVS '94 Proceedings of the 1994 symposium on Volume visualization
A study of integrated prefetching and caching strategies
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Informed prefetching and caching
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Proceedings of the 7th conference on Visualization '96
Application-controlled demand paging for out-of-core visualization
VIS '97 Proceedings of the 8th conference on Visualization '97
Integrated volume compression and visualization
VIS '97 Proceedings of the 8th conference on Visualization '97
Practical prefetching techniques for parallel file systems
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Out-of-Core Streamline Visualization on Large Unstructured Meshes
IEEE Transactions on Visualization and Computer Graphics
A Decoupled Architecture for Application-Specific File Prefetching
Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
OpenVL: the open volume library
VG '03 Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume graphics
Cosy: develop in user-land, run in kernel-mode
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
I/O-conscious data preparation for large-scale web search engines
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Hi-index | 0.00 |
Most existing volume rendering algorithms assume that data sets are memory-resident and thus ignore the performance overhead of disk I/O. While this assumption may be true for high-performance graphics machines, it does not hold for most desktop personal workstations. To minimize the end-to-end volume rendering time, this work re-examines implementation strategies of the ray casting algorithm, taking into account both computation and I/O overheads. Specifically, we developed a data-driven execution model for ray casting that achieves the maximum overlap between rendering computation and disk I/O. Together with other performance optimizations, on a 300-MHz Pentium-II machine, without directional shading, our implementation is able to render a 128x128 greyscale image from a 128x128x128 data set with an average end-to-end delay of 1 second, which is very close to the memory-resident rendering time. With a little modification, this work can also be extended to do out-of-core visualization as well.