Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks
Department
Computer Science
Document Type
Article
Publication Title
IEEE Transactions on Computers
ISSN
0018-9340
Volume
57
Issue
1
DOI
10.1109/TC.2007.70777
First Page
55
Last Page
68
Publication Date
11-27-2007
Abstract
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.
Recommended Citation
Wu, Q.,
Gao, J.,
Zhu, M.,
Rao, N.,
Huang, J.,
&
Iyengar, S.
(2007).
Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks.
IEEE Transactions on Computers, 57(1), 55–68.
DOI: 10.1109/TC.2007.70777
https://scholarlycommons.pacific.edu/soecs-facarticles/68
