How Good is Recursive Bisection?
From MaRDI portal
Publication:4376226
DOI10.1137/S1064827593255135zbMath0886.68104MaRDI QIDQ4376226
Shang-Hua Teng, Horst D. Simon
Publication date: 10 February 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
parallel processing; load balancing; mesh partitioning; recursive bisection; communication cost; scalable parallel algorithms; data and computation mapping on parallel machines; well-shaped finite-element and finite-difference meshes
68R10: Graph theory (including graph drawing) in computer science
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation, COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗, Min-max-boundary domain decomposition, Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic, Optimal block-tridiagonalization of matrices for coherent charge transport, \(K\)-means clustering for optimal partitioning and dynamic load balancing of parallel hierarchical \(N\)-body simulations, An efficient approach for large scale graph partitioning, Node adaptive domain decomposition method by radial basis functions