Two-constraint domain decomposition with space filling curves

DOI10.1016/j.parco.2011.03.002zbMath1216.68317OpenAlexW2030061221MaRDI QIDQ551212

Christian Konrad

Publication date: 14 July 2011

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2011.03.002

zbMATH Keywords

space filling curvestwo-constraint domain decomposition

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• SFCGen
• METIS

Cites Work

• Unnamed Item
• Parallel multigrid in an adaptive PDE solver based on hashing and space-filling curves
• Fast optimal load balancing algorithms for 1D partitioning
• Parallel discontinuous Galerkin unstructured mesh solvers for the calculation of three-dimen\-sion\-al wave propagation problems
• Parallel DSMC method using dynamic domain decomposition
• Efficient array partitioning
• SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion
• Combinatorial Scientific Computing: The Enabling Power of Discrete Algorithms in Computational Science
• Alternative Algorithm for Hilbert's Space-Filling Curve
• Multiphase mesh partitioning

This page was built for publication: Two-constraint domain decomposition with space filling curves