Issue No. 06 - November/December (2007 vol. 13)
This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet service provider) networks is presented.
computer graphics, graph theory, parallel programming,multi-level graph layout, directed graph layout, general multi-level scheme, spectral partitioning, data parallel programming model, naturally unstructured graph, multi-core architectures, Internet service provider, graph partitioning,Partitioning algorithms, Acceleration, Application software, Visualization, High performance computing, Parallel programming, Computer architecture, Quality management, Network topology, Web and internet services,Graph layout, GPU, graph partitioning.
"Multi-Level Graph Layout on the GPU", IEEE Transactions on Visualization & Computer Graphics, vol. 13, no. , pp. 1310-1319, November/December 2007, doi:10.1109/TVCG.2007.70580