Self-adaptive configuration of visualization pipeline over wide-area networks

作     者：Wu, Qishi Gao, Jinzhu Zhu, Mengxia Rao, Nageswara S. V. Huang, Jian Iyengar, S. Sitharama 

作者机构：Univ Memphis Dept Comp Sci Memphis TN 38152 USA Univ Minnesota Div Sci & Math Morris MN 56267 USA So Illinois Univ Dept Comp Sci Carbondale IL 62901 USA Oak Ridge Natl Lab Comp Sci & Math Div Oak Ridge TN 37831 USA Univ Tennessee Dept Comp Sci Knoxville TN 37996 USA Louisiana State Univ Dept Comp Sci Baton Rouge LA 70802 USA 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：2008年第57卷第1期

页      面：55-68页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation, NSF, (ANI-0229969, ANI-0335185) National Science Foundation, NSF U.S. Department of Energy, USDOE, (DE-AC05-00OR22725) U.S. Department of Energy, USDOE Office of Science, SC 

主　　题：distributed computing remote visualization visualization pipeline bandwidth measurement network mapping 

摘      要：Next-generation scientific applications require the capability to visualize large archival data sets 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 data sets from three application domains.