Geometric mesh partitioning: implementation and experiments

Authors:
John R. Gilbert;Gary L. Miller;Shang-Hua Teng
Affiliations:
-;-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 14

Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning

IEEE Transactions on Computers
Tree-Based Parallel Load-Balancing Methods for Solution-Adaptive Finite Element Graphs on Distributed Memory Multicomputers

IEEE Transactions on Parallel and Distributed Systems
A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers

The Journal of Supercomputing
A Dynamic Diffusion Optimization Method for Irregular Finite Element Graph Partitioning

The Journal of Supercomputing
An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems

IEEE Transactions on Parallel and Distributed Systems
A Mixed Heuristic for Circuit Partitioning

Computational Optimization and Applications
A Web-Based Parallel PDE Solver Generation System for Distributed Memory Computing Environments

COMPSAC '00 24th International Computer Software and Applications Conference
References

Sourcebook of parallel computing
A PROBE-Based Heuristic for Graph Partitioning

IEEE Transactions on Computers
Architecture Aware Partitioning Algorithms

ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Multilevel heuristic algorithm for graph partitioning

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Addressing scalability in a laboratory-based multihop wireless testbed

Mobile Networks and Applications
Peer-to-peer data structures for cooperative traffic information systems

Pervasive and Mobile Computing
Scalable parallel graph partitioning

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of "well-shaped" finite element meshes have good separators. The geometric method is quite simple to implement: we describe a Matlab code for it in some detail. The method is also quite efficient and effective: we compare it with some other methods, including spectral bisection.