A new graph representation for cable-membrane structures

In this paper, a new graph representation is proposed which is applicable to cable-membrane structures modelled using both one- and two-dimensional elements. The proposed graph representation is an engineering design approach and not based on a mathematically derived representation. The proposed graphs are partitioned using state-of-the-art tools, including METIS [METIS, a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices (1997); J Parallel Distribut Comput (1997)], and JOSTLE [Advances in computational mechanics with parallel and distributed processing (1997); Parallel dynamic graph-partitioning for unstructured meshes (1997); Int J High Perform Comput Appl 13 (1999) 334; Appl Math Model 25 (2000) 123]. The graph representation performs better than standard graph representations for those cases when the rules of geometric locality and uniform element distribution around nodes are violated. The relation of the proposed graph representation to the most advanced hypergraph representation [IEEE Trans Parallel Distribut Syst 10 (1999) 673; Parallel Comput 26 (2000) 673] is also discussed.

[1]  Peter Ivanyi,et al.  Parallel and distributed dynamic relaxation form-finding. , 1997 .

[2]  Ümit V. Çatalyürek,et al.  Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication , 1999, IEEE Trans. Parallel Distributed Syst..

[3]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

[4]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

[5]  Vipin Kumar,et al.  Multilevel k-way hypergraph partitioning , 1999, DAC '99.

[6]  Martin G. Everett,et al.  Mesh partitioning and load balancing for distributed memory parallel systems , 1997 .

[7]  Ralf Diekmann,et al.  Multilevel Mesh Partitioning for Optimizing Domain Shape , 1999, Int. J. High Perform. Comput. Appl..

[8]  Martin G. Everett,et al.  Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes , 1997, J. Parallel Distributed Comput..

[9]  Asad I. Khan,et al.  Parallel Finite Element Computations , 1999 .

[10]  Timothy J. Barth,et al.  A MIMD implementation of a parallel Euler solver for unstructured grids , 2004, The Journal of Supercomputing.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Chris Walshaw,et al.  Multiphase mesh partitioning , 2000 .

[13]  John F. Abel,et al.  Recursive spectral algorithms for automatic domain partitioning in parallel finite element analysis , 1995 .