I/O-Conscious Volume Rendering

  • Chuan-Kai Yang
  • Tzi-cker Chiueh
Part of the Eurographics book series (EUROGRAPH)


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 overhead-s. 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 grey-scale 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.


Disk Access Performance Overhead Rendering Time Integer Arithmetic Work Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Cao, E. W. Feiten, A. Karlin, and K. Li. A study of integrated prefetching and caching strategies. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, May 1995.Google Scholar
  2. 2.
    Tzi-Cker Chiueh, Chuan-Kai Yang, Taosong He, H. Pfister, and A. Kaufman. Integrated volume compression and visualization. Visualization’ 97, pages 329–336, October 1997.Google Scholar
  3. 3.
    M. Cox. Managing big data for scientific visualization. ACM SIGGRAPH’ 98 Course, August 1997.Google Scholar
  4. 4.
    M. Cox and D. Ellsworth. Application-controlled demand paging for out-of-core visualization. Visualization’ 97, pages 235–244, October 1997.Google Scholar
  5. 5.
    J. Fowler and R. Yagel. Lossless compression of volume data. In Proceedings of Visualization’ 94, pages 43–50, October 1994.Google Scholar
  6. 6.
    D. Kotz and Carla Schlattr Ellis. Practical prefetching techniques for parallel file systems. First International Conference on Parallel and Distributed Information Systems, December 1991.Google Scholar
  7. 7.
    Tlilika Mitra, Chuan-Kai Yang, and Tzi-Cker Chiueh. Application-specific file prefetching for multimedia programs. In IEEE Multimedia 2000, July 2000.Google Scholar
  8. 8.
    Todd C. Mowry, Monica S. Lam, and Anoop Gupta. Design and evaluation of a compiler algorithm for prefetching. The Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 62–73, October 1992.Google Scholar
  9. 9.
    R. H. Patterson, G. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka. Informed prefetching and caching. 15th ACM Symposium on Operating System Principle, December 1995.Google Scholar
  10. 10.
    A. Trott, R. Moorhead, and J. McGinley. Wavelets applied to lossless compression and progressive transmission of floating point data in 3-d curvilinear grids. Visualization’ 96, pages 385–388, October 1996.Google Scholar
  11. 11.
    S. K. Ueng, K. Siborski, and K. L. Ma. Out-of-core streamline visualization on large unstructured meshes. ICASE Report, April 1997.Google Scholar

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Chuan-Kai Yang
    • 1
  • Tzi-cker Chiueh
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Personalised recommendations