Heuristic Algorithms for Automatic Graph Partitioning
暂无分享,去创建一个
[1] Joseph W. H. Liu,et al. A graph partitioning algorithm by node separators , 1989, TOMS.
[2] P. Sadayappan,et al. Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes , 1987, IEEE Transactions on Computers.
[3] Elias N. Houstis,et al. DOMAIN DECOMPOSER: A Software Tool for Mapping PDE Computations to Parallel Architectures , 1990 .
[4] Barry W. Peyton,et al. Toward a Parallel Recursive Spectral Bisection Mapping Tool , 1993, PPSC.
[5] Shahid H. Bokhari,et al. A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.
[6] Alex Pothen,et al. PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .
[7] Charbel Farhat,et al. Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics , 1993 .
[8] John R. Rice,et al. Mapping Algorithms and Software Environment for Data Parallel PDE Iterative Solvers , 1994, J. Parallel Distributed Comput..
[9] Horst D. Simon,et al. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..
[10] S. Ranka,et al. Mapping finite element graphs on hypercubes , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.