Parallel static and dynamic multi‐constraint graph partitioning

From MaRDI portal
Revision as of 10:10, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (27)

Unnamed ItemExtreme-Scale Block-Structured Adaptive Mesh RefinementMassively parallel grid generation on HPC systemsOn using moving windows in finite element time domain simulation for long accelerator structuresImprovements in the reliability and element quality of parallel tetrahedral mesh generationAlgorithms for recalculating alpha and eigenvector centrality measures using graph partitioning techniquesHeterogeneous 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 AdjacenciesParallel multilevel algorithms for hypergraph partitioningAn irregularly portioned Lagrangian Monte Carlo method for turbulent flow simulationNonintrusive Uncertainty Analysis of Fluid-Structure Interaction with Spatially Adaptive Sparse Grids and Polynomial Chaos ExpansionPUMI\textsc{waLBerla}: a block-structured high-performance framework for multiphysics simulationsAn exact approach for the multi-constraint graph partitioning problemModeling the growth and interaction of multiple dendrites in solidification using a level set methodNumerical solution of Navier-Stokes-Korteweg systems by local discontinuous Galerkin methods in multiple space dimensionsAdaptive full domain covering meshes for parallel finite element computationsSubdomain cluster generation for domain decomposition methods using graph partitioning optimizationNew challenges in dynamic load balancingComputationally efficient solution to the Cahn-Hilliard equation: Adaptive implicit time schemes, mesh sensitivity analysis and the 3D isoperimetric problemValidating and scaling the MicroGrid: A scientific instrument for grid dynamicsLoad balancing fictions, falsehoods and fallaciesUnnamed ItemMonolithic Overlapping Schwarz Domain Decomposition Methods with GDSW Coarse Spaces for Incompressible Fluid Flow ProblemsComplex Network Partitioning Using Label PropagationParallel technology for numerical modeling of fluid dynamics problems by high-accuracy algorithms


Uses Software



Cites Work




This page was built for publication: Parallel static and dynamic multi‐constraint graph partitioning