The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2008 vol.57)
pp: 55-68
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
Jinzhu Gao, Mengxia Zhu, Nageswara S.V. Rao, Jian Huang, Sitharama Iyengar, Qishi Wu, "Self-Adaptive Configuration of Visualization Pipeline Over Wide-Area Networks", IEEE Transactions on Computers, vol.57, no. 1, pp. 55-68, January 2008, doi:10.1109/TC.2007.70777
REFERENCES
[1] A. Mezzacappa, “Scidac 2005: Scientific Discovery through Advanced Computing,” J. Physics: Conf. Series, vol. 16, http://stacks.iop.org/1742_6596/16/i=1a=E01 , 2005.
[2] Scientific Visualization: The Visual Extraction of Knowledge from Data, G.P. Bonneau, T. Ertl, and G.M. Nielson, eds. Springer, 2005.
[3] K.-L. Ma and D.M. Camp, “High Performance Visualization of Time-Varying Volume Data over a Wide-Area Network,” Proc. Supercomputing, 2000.
[4] J. Ding, J. Huang, M. Beck, S. Liu, T. Moore, and S. Soltesz, “Remote Visualization by Browsing Image Based Databases with Logistical Networking,” Proc. Supercomputing, 2003.
[5] W. Bethel, B. Tierney, J. Lee, D. Gunter, and S. Lau, “Using High-Speed Wans and Network Data Caches to Enable Remote and Distributed Visualization,” Proc. Supercomputing, 2000.
[6] A. Neeman, P. Sulatycke, and K. Ghose, “Fast Remote Isosurface Visualization with Chessboarding,” Proc. Parallel Graphics and Visualization, pp. 75-82, 2004.
[7] “Vis5d+,” http:/vis5d.sourceforge.net/, 2007.
[8] “Paraview,” http://www.paraview.org/HTMLIndex.html, 2007.
[9] “Aspect,” http:/www.aspect-sdm.org/, 2007.
[10] “Computational Engineering International,” http://www.ceintl. com/productsensight.html , 2007.
[11] Y. Livnat and C. Hansen, “View Dependent Isosurface Extraction,” Proc. IEEE Visualization, pp. 175-180, 1998.
[12] Z. Liu, A. Finkelstein, and K. Li, “Progressive View-Dependent Isosurface Propagation,” Proc. EG/IEEE TCVG Symp. Visualization, 2001.
[13] S. Stegmaier, M. Magallon, and T. Ertl, “A Generic Solution for Hardware-Accelerated Remote Visualization,” Proc. Data Visualization, pp. 87-95, 2002.
[14] I. Foster, J. Insley, G. von Laszewski, C. Kesselman, and M. Thiebaux, “Distance Visualization: Data Exploration on the Grid,” Computer, vol. 32, no. 12, pp. 36-43, Dec. 1999.
[15] I.T. Foster, C. Kesselman, and S. Tuecke, “The Anatomy of the Grid—Enabling Scalable Virtual Organizations,” CoRR, vol. cs.AR/0103025, 2001.
[16] I.T. Foster, “Globus Toolkit Version 4: Software for Service-Oriented Systems,” Proc. Int'l Conf. Network and Parallel Computing, pp. 2-13, 2005.
[17] D. Kranzlmuller, G. Kurka, P. Heinzlreiter, and J. Volkert, “Optimizations in the Grid Visualization Kernel,” Proc. Int'l Parallel and Distributed Processing Symp., pp. 129-135, 2002.
[18] P. Heinzlreiter, D. Kranzlmuller, and J. Volkert, “Network Transportation and Optimization for Grid-Enabled Visualization Techniques,” Neural, Parallel, and Scientific Computations, vol. 12, no. 3, pp. 307-328, 2004.
[19] J. Shalf and E.W. Bethel, “The Grid and Future Visualization System Architectures,” IEEE Computer Graphics and Applications, vol. 23, no. 2, pp. 6-9, Mar./Apr. 2003.
[20] I.J. Grimstead, N.J. Avis, and D.W. Walker, “Automatic Distribution of Rendering Workloads in a Grid Enabled Collaborative Visualization Environment,” Proc. ACM/IEEE Conf. Supercomputing, p. 1, 2004.
[21] K. Engel, O. Sommer, and T. Ertl, “An Interactive Hardware Accelerated Remote 3D-Visualization Framework,” Proc. Data Visualization, pp. 167-177, 2000.
[22] K. Brodlie, D. Duce, J. Gallop, M. Sagar, J. Walton, and J. Wood, “Visualization in Grid Computing Environments,” Proc. IEEE Visualization, pp. 155-162, 2004.
[23] M.D. Beynon, A. Sussman, T. Kurc, and J. Saltz, “Optimizing Execution of Component-Based Applications Using Group Instances,” Proc. IEEE Int'l Symp. Cluster Computing and the Grid (CCGrid '01), pp. 56-65, 2001.
[24] J. Ahrens, K. Brislawn, K. Martin, B. Geveci, C.C. Law, and M. Papka, “Large-Scale Data Visualization Using Parallel Data Streaming,” IEEE Computer Graphics and Applications, vol. 21, no. 4, pp. 34-41, July/Aug. 2001.
[25] E.J. Luke and C.D. Hansen, “Semotus Visum: A Flexible Remote Visualization Framework,” Proc. IEEE Visualization, pp. 61-68, 2002.
[26] I.M. Boier-Martin, “Adaptive Graphics,” IEEE Computer Graphics and Applications, vol. 23, no. 1, pp. 6-10, Jan./Feb. 2003.
[27] I. Bowman, J. Shalf, K.-L. Ma, and W. Bethel, “Performance Modeling for 3D Visualization in a Heterogeneous Computing Environment,” Technical Report 2005-3, Dept. of Computer Science, Univ. of California Davis, 2005.
[28] W. Schroeder, K. Martin, and B. Lorensen, The Visualization Toolkit, second ed. Prentice Hall PTR, 1998.
[29] “Common Data Format,” http:/cdf.gsfc.nasa.gov/, 2007.
[30] “Hierarchical Data Format,” http:/hdf.ncsa.uiuc.edu, 2007.
[31] “Network Common Data Form,” http://my.unidata.ucar.edu/content/software netcdf, 2007.
[32] M. Zhu, Q. Wu, N. Rao, and S. Iyengar, “Adaptive Visualization Pipeline Decomposition and Mapping onto Computer Networks,” Proc. IEEE Int'l Conf. Image and Graphics, pp. 402-405, Dec. 2004.
[33] W.E. Lorensen and H.E. Cline, “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics, vol. 21, no. 4, pp. 163-169, July 1987.
[34] M. Levoy, “Efficient Ray Tracing of Volume Data,” ACM Trans. Graphics, vol. 9, no. 3, pp. 245-261, 1990.
[35] J. Gao, J. Huang, H.-W. Shen, and J.A. Kohl, “Visibility Culling Using Plenoptic Opacity Functions for Large Data Visualization,” Proc. IEEE Visualization, pp. 341-348, 2003.
[36] “Network Weather Service,” http:/nws.cs.ucsb.edu, 2007.
[37] Q. Wu, N. Rao, and S. Iyengar, “On Transport Daemons for Small Collaborative Applications over Wide-Area Networks,” Proc. 24th IEEE Int'l Performance Computing and Comm. Conf., Apr. 2005.
[38] “Terascale Supernova Initiative,” http://www.phy.ornl.govtsi, 2007.
[39] “Visible Human Project,” http://www.nlm.nih.gov/researchvisible/, 2007.
[40] N.S.V. Rao, W.R. Wing, S.M. Carter, and Q. Wu, “Ultrascience Net: Network Testbed for Large-Scale Science Applications,” IEEE Comm. Magazine, vol. 43, no. 11, pp. s12-s17, 2005.
[41] X. Zheng, M. Veeraraghavan, N.S.V. Rao, Q. Wu, and M. Zhu, “CHEETAH: Circuit-Switched High-Speed End-to-End Transport Architecture Testbed,” IEEE Comm. Magazine, vol. 43, no. 11, pp.s11-s17, 2005.
[42] M. Hassan and R. Jain, High Performance TCP/IP Networking: Concepts, Issues, and Solutions. Prentice Hall, 2004.
[43] N. Rao, Q. Wu, S. Carter, and W. Wing, “High-Speed Dedicated Channels and Experimental Results with Hurricane Protocol,” Annals of Telecomm., vol. 61, nos. 1-2, pp. 21-45, 2006.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool