Parallel static and dynamic multi‐constraint graph partitioning
From MaRDI portal
Publication:4539938
DOI10.1002/cpe.605zbMath1012.68146OpenAlexW1970652797MaRDI QIDQ4539938
Vipin Kumar, Kirk Schloegel, George Karypis
Publication date: 11 July 2002
Published in: Concurrency and Computation: Practice and Experience (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpe.605
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (27)
Unnamed Item ⋮ Extreme-Scale Block-Structured Adaptive Mesh Refinement ⋮ Massively parallel grid generation on HPC systems ⋮ On using moving windows in finite element time domain simulation for long accelerator structures ⋮ Improvements in the reliability and element quality of parallel tetrahedral mesh generation ⋮ Algorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniques ⋮ Heterogeneous CPU+GPU parallelization for high-accuracy scale-resolving simulations of compressible turbulent flows on hybrid supercomputers ⋮ Сравнение алгоритмов декомпозиции области в задаче прямого моделирования течения жидкости в поровом пространстве образцов горных пород ⋮ Improving Unstructured Mesh Partitions for Multiple Criteria Using Mesh Adjacencies ⋮ Parallel multilevel algorithms for hypergraph partitioning ⋮ An irregularly portioned Lagrangian Monte Carlo method for turbulent flow simulation ⋮ Nonintrusive Uncertainty Analysis of Fluid-Structure Interaction with Spatially Adaptive Sparse Grids and Polynomial Chaos Expansion ⋮ PUMI ⋮ \textsc{waLBerla}: a block-structured high-performance framework for multiphysics simulations ⋮ An exact approach for the multi-constraint graph partitioning problem ⋮ Modeling the growth and interaction of multiple dendrites in solidification using a level set method ⋮ Numerical solution of Navier-Stokes-Korteweg systems by local discontinuous Galerkin methods in multiple space dimensions ⋮ Adaptive full domain covering meshes for parallel finite element computations ⋮ Subdomain cluster generation for domain decomposition methods using graph partitioning optimization ⋮ New challenges in dynamic load balancing ⋮ Computationally efficient solution to the Cahn-Hilliard equation: Adaptive implicit time schemes, mesh sensitivity analysis and the 3D isoperimetric problem ⋮ Validating and scaling the MicroGrid: A scientific instrument for grid dynamics ⋮ Load balancing fictions, falsehoods and fallacies ⋮ Unnamed Item ⋮ Monolithic Overlapping Schwarz Domain Decomposition Methods with GDSW Coarse Spaces for Incompressible Fluid Flow Problems ⋮ Complex Network Partitioning Using Label Propagation ⋮ Parallel technology for numerical modeling of fluid dynamics problems by high-accuracy algorithms
Uses Software
Cites Work
- Unnamed Item
- PLUM: Parallel load balancing for adaptive unstructured meshes
- Parallel optimisation algorithms for multilevel mesh partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Multiphase mesh partitioning
This page was built for publication: Parallel static and dynamic multi‐constraint graph partitioning