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

Qishi Wu, Jinzhu Gao, Michelle Zhu, Nageswara S.V. Rao, Jian Huang, S. Sitharama Iyengar

Research output: Contribution to journalArticle

20 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)55-68
Number of pages14
JournalIEEE Transactions on Computers
Volume57
Issue number1
DOIs
StatePublished - 1 Jan 2008

Fingerprint

Wide area networks
Visualization
Pipelines
Configuration
Decompose
Surjection
End-to-end Delay
Computing
Vertex of a graph
Networking
Grouping
Polynomial-time Algorithm
Latency
Computer Simulation
Polynomials
Decomposition
Minimise
Module
Communication
Computer simulation

Keywords

  • Distributed systems
  • Remote systems
  • Visualization systems and software

Cite this

Wu, Qishi ; Gao, Jinzhu ; Zhu, Michelle ; Rao, Nageswara S.V. ; Huang, Jian ; Iyengar, S. Sitharama. / Self-adaptive configuration of visualization pipeline over wide-area networks. In: IEEE Transactions on Computers. 2008 ; Vol. 57, No. 1. pp. 55-68.
@article{2d4cf16c3930448a807e5ebbc3cae03b,
title = "Self-adaptive configuration of visualization pipeline over wide-area networks",
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.",
keywords = "Distributed systems, Remote systems, Visualization systems and software",
author = "Qishi Wu and Jinzhu Gao and Michelle Zhu and Rao, {Nageswara S.V.} and Jian Huang and Iyengar, {S. Sitharama}",
year = "2008",
month = "1",
day = "1",
doi = "10.1109/TC.2007.70777",
language = "English",
volume = "57",
pages = "55--68",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "1",

}

Self-adaptive configuration of visualization pipeline over wide-area networks. / Wu, Qishi; Gao, Jinzhu; Zhu, Michelle; Rao, Nageswara S.V.; Huang, Jian; Iyengar, S. Sitharama.

In: IEEE Transactions on Computers, Vol. 57, No. 1, 01.01.2008, p. 55-68.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Wu, Qishi

AU - Gao, Jinzhu

AU - Zhu, Michelle

AU - Rao, Nageswara S.V.

AU - Huang, Jian

AU - Iyengar, S. Sitharama

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - Distributed systems

KW - Remote systems

KW - Visualization systems and software

UR - http://www.scopus.com/inward/record.url?scp=36849013494&partnerID=8YFLogxK

U2 - 10.1109/TC.2007.70777

DO - 10.1109/TC.2007.70777

M3 - Article

AN - SCOPUS:36849013494

VL - 57

SP - 55

EP - 68

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 1

ER -