Cactus and Visapult: A case study of ultra-high performance distributed visualization using connectionless protocols

This past decade has seen rapid growth in the size, resolution, and complexity of Grand Challenge simulation codes. Many such problems still require interactive visualization tools to make sense of multi-terabyte data stores. Visapult is a parallel volume rendering tool that employs distributed components, latency tolerant algorithms, and high performance network I/O for effective remote visualization of massive datasets. In this paper we discuss using connectionless protocols to accelerate Visapult network I/O and interfacing Visapult to the Cactus General Relativity code to enable scalable remote monitoring and steering capabilities. With these modifications, network utilization has moved from 25 percent of line-rate using tuned multi-streamed TCP to sustaining 88 percent of line rate using the new UDP-based transport protocol.

[1]  Brian D. Noble,et al.  The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[2]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[3]  Craig Partridge,et al.  When the CRC and TCP checksum disagree , 2000, SIGCOMM 2000.

[4]  Van Jacobson,et al.  Traffic phase effects in packet-switched gateways , 1991, CCRV.

[5]  Jason Lee,et al.  Using High-Speed WANs and Network Data Caches to Enable Remote and Distributed Visualization , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[6]  Jason Lee,et al.  A network-aware distributed storage cache for data intensive environments , 1999, Proceedings. The Eighth International Symposium on High Performance Distributed Computing (Cat. No.99TH8469).

[7]  Wes Bethel.  Visapult: A Prototype Remote and Distributed Visualization Application and Framework , 2000, SIGGRAPH 2000.

[8]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[9]  Rich Seifert.  Gigabit Ethernet , 2001, LCN.

[10]  Robert L. Grossman,et al.  PSockets: The Case for Application-level Network Striping for Data Intensive Applications using High Speed Wide Area Networks , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[11]  John Shalf,et al.  Cactus Tools for Grid Applications , 2001, Cluster Computing.

[12]  Craig Partridge,et al.  When the CRC and TCP checksum disagree , 2000, SIGCOMM.

[13]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[14]  D. Norris.  Report to the National Science Foundation , 1980 .

[15]  Klaus Mueller,et al.  IBR-Assisted Volume Rendering , 1999 .

[16]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).