The Community for Technology Leaders
Green Image
ABSTRACT
Next-generation scientific applications require the capabilities to visualize large archival datasets or on-going computer simulations of physical and other phenomena over wide-area network connections. To minimize the latency in interactive visualizations across wide-area networks, we propose an approach that adaptively decomposes and maps the visualization pipeline onto a set of strategically selected network nodes. This scheme is realized by grouping the modules that implement visualization and networking subtasks, and mapping them onto computing nodes with possibly disparate computing capabilities and network connections. Using estimates for communication and processing times of subtasks, we present a polynomial-time algorithm to compute a decomposition and mapping to achieve minimum end-to-end delay of the visualization pipeline. We present experimental results using geographically distributed deployments to demonstrate the effectiveness of this method in visualizing datasets from three application domains.
INDEX TERMS
Visualization systems and software, Distributed systems, Remote systems
CITATION
Nageswara S.V. Rao, Sitharama Iyengar, Jinzhu Gao, Qishi Wu, Jian Huang, Mengxia Zhu, Qishi Wu, "Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks", IEEE Transactions on Computers, vol. 57, no. , pp. 55-68, January 2008, doi:10.1109/TC.2007.70777
182 ms
(Ver 3.1 (10032016))