Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
DOI10.1137/S1064827595288942zbMATH Open0907.68219OpenAlexW1996639891MaRDI QIDQ4389263FDOQ4389263
Authors: Shang-Hua Teng 
Publication date: 12 May 1998
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827595288942
Recommendations
- \(K\)-means clustering for optimal partitioning and dynamic load balancing of parallel hierarchical \(N\)-body simulations
- scientific article; zbMATH DE number 1222823
- \(N\)-body simulations of massively parallel architectures
- Parallel implementation of an adaptive and parameter-free \(N\)-body integrator
- Analysis and parallel implementation of a forced \(N\)-body problem
- Publication:4860175
scientific computingload balancingparallel processingpartitioning\(N\)-body simulationadaptive computinghierarchical methodstree-codesthe fast multipole method
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- A fast algorithm for particle simulations
- An analysis of the finite element method for natural convection problems
- Title not available (Why is that?)
- Separators for sphere-packings and nearest neighbor graphs
- How Good is Recursive Bisection?
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- Title not available (Why is that?)
- An Implementation of the Fast Multipole Method without Multipoles
- Title not available (Why is that?)
- An O(n log n) algorithm for the all-nearest-neighbors problem
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- The Parallel Multipole Method on the Connection Machine
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Geometric Separators for Finite-Element Meshes
- Geometric Mesh Partitioning: Implementation and Experiments
- The order of Appel's algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (19)
- Revision of DASHMM: dynamic adaptive system for hierarchical multipole methods
- A parallel tree code for large \(N\)-body simulation: Dynamic load balance and data distribution on a CRAY T3D system
- DistDLB: improving cosmology SAMR simulations on distributed computing systems through hierarchical load balancing
- Communications overlapping in fast multipole particle dynamics methods
- Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
- Fast multipole methods on graphics processors
- Spectral partitioning works: planar graphs and finite element meshes
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- Title not available (Why is that?)
- A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal
- Optimal cache-oblivious mesh layouts
- The fast multipole method: Numerical implementation
- Min-max-boundary domain decomposition
- Fast electrostatic force calculation on parallel computer clusters
- An exact algorithm for graph partitioning
- Parallel accelerated Stokesian dynamics with Brownian motion
- PetFMM -- a dynamically load-balancing parallel fast multipole library
- A parallel hierarchical-element method for contour dynamics simulations
- \(K\)-means clustering for optimal partitioning and dynamic load balancing of parallel hierarchical \(N\)-body simulations
Uses Software
This page was built for publication: Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389263)
