Edge bundling is a promising graph visualization approach to simplifying the visual result of a graph drawing. Plenty of edge bundling methods have been developed to generate diverse graph layouts. However, it is difficult to defend an edge bundling method with its resulting layout against other edge bundling methods as a clear theoretic evaluation framework is absent in the literature. In this paper, we propose an information-theoretic framework to evaluate the visual results of edge bundling techniques. We first illustrate the advantage of edge bundling visualizations for large graphs, and pinpoint the ambiguity resulting from drawing results. Second, we define and quantify the amount of information delivered by edge bundling visualization from the underlying network using information theory. Third, we propose a new algorithm to evaluate the resulting layouts of edge bundling using the amount of the mutual information between a raw network dataset and its edge bundling visualization. Comparison examples based on the proposed framework between different edge bundling techniques are presented.
Hard Disk Drive (HDD) based storage systems in high performance computing (HPC), such as Lustre, are being confronted with great challenges from massive parallel data-intensive applications, and becomes one of the most critical factors that influence applications performance. In this paper, we analyze the performance of Lustre, and statistically examine the distribution of file sizes, I/O patterns for typical data-intensive applications, as well as the utilization of CPU and memory resources in TH-1A supercomputer from the last five years. We present masFS, a novel file system for HPC that exploits available memory and SSD resources on compute nodes with little interference to applications running on the nodes. The masFS supports POSIX interface with an unique namespace and provides comprehensive file service for applications. We design and implement masFS with memory and SSD, and have deployed and evaluated it on TH-1A. Experimental results show that masFS works as general storage system and can meet the requirement of variety of I/O loads. It can achieve a speedup of 14.5x for read and 8.8x for write respectively in running benchmarks, and an average 7.6x faster I/O time in a real-world data-intensive application compared to Lustre.
The performance of massively parallel program is often impacted by the cost of communication across computing nodes. Analysis of communication patterns is critical for understanding and optimizing massively parallel programs. Visualization can help identify potential communication bottlenecks by displaying message trace data. However, the visual clutter and temporal incoherence problems are typically incurred in existing visualization tools for a considerable number of processors. In this paper, we present a new tool, named CommGram, which supports visual analysis of communication patterns for massive parallel MPI programs. With the benefit of MPI trace library DUMPI of SST, our framework builds hierarchical clustering trees for computational community domain, and takes advantage of graphical user interface (GUI) to convey communication patterns at different levels of detail. The effectiveness of our tool is demonstrated using large-scale parallel applications.
1 February 2018 in Frontiers of Information Technology & Electronic Engineering
In the original version of this article, the abbreviation ‘OWDM’ was incorrectly defined. The phrase ‘orthogonal wavelength division multiplexing’ should all be changed to ‘one-way wave depth...