High performance visualization of time-varying volume data over a wide-area network

Kwan Liu Ma, David M. Camp

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Scopus citations


This paper presents an end-to-end, low-cost solution for visualizing time-varying volume data rendered on a parallel computer located at a remote site. Pipelining and careful grouping of processors are used to hide I/O time and to maximize processors utilization. Compression is used to significantly cut down the cost of transferring output images from the parallel computer to a display device through a wide-area network. This complete rendering pipeline makes possible highly efficient rendering and remote viewing of high resolution time-varying data sets in the absence of high-speed network and parallel I/O support. To study the performance of this rendering pipeline and to demonstrate high-performance remote visualization, tests were conducted on a PC cluster in Japan as well as an SGI Origin 2000 operated at the NASA Ames Research Center with the display located at UC Davis.

Original languageEnglish (US)
Title of host publicationSC 2000 - Proceedings of the 2000 ACM/IEEE Conference on Supercomputing
PublisherAssociation for Computing Machinery
ISBN (Electronic)0780398025
StatePublished - 2000
Event2000 ACM/IEEE Conference on Supercomputing, SC 2000 - Dallas, United States
Duration: Nov 4 2000Nov 10 2000

Publication series

NameProceedings of the International Conference on Supercomputing


Conference2000 ACM/IEEE Conference on Supercomputing, SC 2000
Country/TerritoryUnited States


  • High performance computing
  • Image compression
  • Parallel volume rendering
  • Pipelining
  • Remote visualization
  • Scientific visualization
  • Time-varying data
  • Wide-area network

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'High performance visualization of time-varying volume data over a wide-area network'. Together they form a unique fingerprint.

Cite this