On optimal mapping of visualization pipeline onto linear arrangement of network nodes

Michelle Zhu, Qishi Wu, Nageswara S.V. Rao, S. Sitharama Iyengar

Research output: Contribution to journalConference articleResearchpeer-review

Abstract

This paper discusses algorithmic and implementation aspects of optimally mapping a visualization pipeline onto a linear arrangement of wide-area network nodes to minimize the total delay. The first network node typically is a data source, the last node could be a display device ranging from a personal computer to a powerwall, and each intermediate node could be a workstation or computational cluster. This mapping scheme appropriately distributes the filtering, geometry generation, rendering, and display modules of the visualization pipeline onto the linear arrangement of network nodes to make an efficient use of the computing resources at end nodes and network bandwidths between them. Regression-based network daemons are developed to measure the available bandwidth between the network nodes. We present an analytical formulation of this problem by taking into account the computational power of nodes, bandwidths between them, and sizes of messages exchanged between visualization modules. We propose a polynomial-time optimal algorithm that uses the dynamic programming method to compute the mapping with a minimum total delay. An OpenGL-based remote visualization system is implemented and deployed at three geographically distributed nodes for preliminary experiments.

Original languageEnglish
Article number02
Pages (from-to)1-11
Number of pages11
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume5669
DOIs
StatePublished - 20 Jul 2005
EventProceedings of SPIE-IS and T Electronic Imaging - Visualization and Data Analysis 2005 - San Jose, CA, United States
Duration: 17 Jan 200518 Jan 2005

Fingerprint

Arrangement
Visualization
Pipelines
Vertex of a graph
Bandwidth
bandwidth
Display devices
modules
Wide area networks
wide area networks
dynamic programming
Dynamic programming
Personal computers
workstations
personal computers
display devices
messages
Display
Polynomials
regression analysis

Keywords

  • Bandwidth measurement
  • Network mapping
  • Remote visualization
  • Visualization pipeline

Cite this

@article{50d4be41d2df4487b2c3d40da4bdda97,
title = "On optimal mapping of visualization pipeline onto linear arrangement of network nodes",
abstract = "This paper discusses algorithmic and implementation aspects of optimally mapping a visualization pipeline onto a linear arrangement of wide-area network nodes to minimize the total delay. The first network node typically is a data source, the last node could be a display device ranging from a personal computer to a powerwall, and each intermediate node could be a workstation or computational cluster. This mapping scheme appropriately distributes the filtering, geometry generation, rendering, and display modules of the visualization pipeline onto the linear arrangement of network nodes to make an efficient use of the computing resources at end nodes and network bandwidths between them. Regression-based network daemons are developed to measure the available bandwidth between the network nodes. We present an analytical formulation of this problem by taking into account the computational power of nodes, bandwidths between them, and sizes of messages exchanged between visualization modules. We propose a polynomial-time optimal algorithm that uses the dynamic programming method to compute the mapping with a minimum total delay. An OpenGL-based remote visualization system is implemented and deployed at three geographically distributed nodes for preliminary experiments.",
keywords = "Bandwidth measurement, Network mapping, Remote visualization, Visualization pipeline",
author = "Michelle Zhu and Qishi Wu and Rao, {Nageswara S.V.} and Iyengar, {S. Sitharama}",
year = "2005",
month = "7",
day = "20",
doi = "10.1117/12.587964",
language = "English",
volume = "5669",
pages = "1--11",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

On optimal mapping of visualization pipeline onto linear arrangement of network nodes. / Zhu, Michelle; Wu, Qishi; Rao, Nageswara S.V.; Iyengar, S. Sitharama.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 5669, 02, 20.07.2005, p. 1-11.

Research output: Contribution to journalConference articleResearchpeer-review

TY - JOUR

T1 - On optimal mapping of visualization pipeline onto linear arrangement of network nodes

AU - Zhu, Michelle

AU - Wu, Qishi

AU - Rao, Nageswara S.V.

AU - Iyengar, S. Sitharama

PY - 2005/7/20

Y1 - 2005/7/20

N2 - This paper discusses algorithmic and implementation aspects of optimally mapping a visualization pipeline onto a linear arrangement of wide-area network nodes to minimize the total delay. The first network node typically is a data source, the last node could be a display device ranging from a personal computer to a powerwall, and each intermediate node could be a workstation or computational cluster. This mapping scheme appropriately distributes the filtering, geometry generation, rendering, and display modules of the visualization pipeline onto the linear arrangement of network nodes to make an efficient use of the computing resources at end nodes and network bandwidths between them. Regression-based network daemons are developed to measure the available bandwidth between the network nodes. We present an analytical formulation of this problem by taking into account the computational power of nodes, bandwidths between them, and sizes of messages exchanged between visualization modules. We propose a polynomial-time optimal algorithm that uses the dynamic programming method to compute the mapping with a minimum total delay. An OpenGL-based remote visualization system is implemented and deployed at three geographically distributed nodes for preliminary experiments.

AB - This paper discusses algorithmic and implementation aspects of optimally mapping a visualization pipeline onto a linear arrangement of wide-area network nodes to minimize the total delay. The first network node typically is a data source, the last node could be a display device ranging from a personal computer to a powerwall, and each intermediate node could be a workstation or computational cluster. This mapping scheme appropriately distributes the filtering, geometry generation, rendering, and display modules of the visualization pipeline onto the linear arrangement of network nodes to make an efficient use of the computing resources at end nodes and network bandwidths between them. Regression-based network daemons are developed to measure the available bandwidth between the network nodes. We present an analytical formulation of this problem by taking into account the computational power of nodes, bandwidths between them, and sizes of messages exchanged between visualization modules. We propose a polynomial-time optimal algorithm that uses the dynamic programming method to compute the mapping with a minimum total delay. An OpenGL-based remote visualization system is implemented and deployed at three geographically distributed nodes for preliminary experiments.

KW - Bandwidth measurement

KW - Network mapping

KW - Remote visualization

KW - Visualization pipeline

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

U2 - 10.1117/12.587964

DO - 10.1117/12.587964

M3 - Conference article

VL - 5669

SP - 1

EP - 11

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

M1 - 02

ER -