Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
From MaRDI portal
(Redirected from Publication:4389263)
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
Cites work
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A fast algorithm for particle simulations
- An analysis of the finite element method for natural convection problems
- An Implementation of the Fast Multipole Method without Multipoles
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Geometric Mesh Partitioning: Implementation and Experiments
- Geometric Separators for Finite-Element Meshes
- How Good is Recursive Bisection?
- scientific article; zbMATH DE number 554764 (Why is no real title available?)
- scientific article; zbMATH DE number 741113 (Why is no real title available?)
- scientific article; zbMATH DE number 833680 (Why is no real title available?)
- scientific article; zbMATH DE number 833688 (Why is no real title available?)
- scientific article; zbMATH DE number 833690 (Why is no real title available?)
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
- Separators for sphere-packings and nearest neighbor graphs
- The order of Appel's algorithm
- The Parallel Multipole Method on the Connection Machine
Cited in
(20)- Scalable parallel formulations of the Barnes--Hut method for n-body simulations
- Communications overlapping in fast multipole particle dynamics methods
- \(K\)-means clustering for optimal partitioning and dynamic load balancing of parallel hierarchical \(N\)-body simulations
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
- An exact algorithm for graph partitioning
- A parallel tree code for large \(N\)-body simulation: Dynamic load balance and data distribution on a CRAY T3D system
- The fast multipole method: Numerical implementation
- Parallel accelerated Stokesian dynamics with Brownian motion
- DistDLB: improving cosmology SAMR simulations on distributed computing systems through hierarchical load balancing
- A parallel hierarchical-element method for contour dynamics simulations
- PetFMM -- a dynamically load-balancing parallel fast multipole library
- scientific article; zbMATH DE number 833690 (Why is no real title available?)
- Revision of DASHMM: dynamic adaptive system for hierarchical multipole methods
- Min-max-boundary domain decomposition
- A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal
- Optimal cache-oblivious mesh layouts
- Spectral partitioning works: planar graphs and finite element meshes
- Fast multipole methods on graphics processors
- Fast electrostatic force calculation on parallel computer clusters
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)
