Parallel fast-neighbor-searching and communication strategy for particle-based methods

Keyphrases

• Search Strategy 100%
• Communication Strategies 100%
• Neighborhood Search 100%
• Particle Method 100%
• Smoothing Length 100%
• Sparse Data 66%
• Search Methods 66%
• Ghosts 66%
• Partitioning Method 66%
• Smoothed Particle Hydrodynamics 66%
• Adaptive Smoothing 66%
• Numerical Experiments 33%
• Design Methodology 33%
• Optimized Frequency 33%
• Multi-resolution 33%
• Point-to-point Communication 33%
• Parallel Version 33%
• Computing Systems 33%
• Data Exchange 33%
• Data Communication 33%
• Undirected Graph 33%
• Graph Theory 33%
• Hierarchical Representation 33%
• Fluid Dynamics 33%
• Particle Simulation 33%
• Parallel Performance 33%
• Non-blocking 33%
• Coloring Algorithm 33%
• Parallel Environment 33%
• Large-scale Parallel 33%
• Scientific Applications 33%
• Edge Coloring 33%
• Distributed Memory Computing 33%
• Dynamic Base 33%
• Parallel Algorithm 33%

Computer Science

• Neighbour Search 100%
• Partitioning Method 100%
• Communication Strategies 100%
• Adaptive Smoothing 100%
• Data Structure 50%
• Directed Graphs 50%
• Point-to-Point Communication 50%
• Data Communication 50%
• Distributed Memory 50%
• Particle Simulation 50%
• Scientific Application 50%
• Neighbouring Particle 50%
• Nonblocking Point 50%
• Graph Theory 50%
• Parallel Version 50%
• Parallel Algorithm 50%

Engineering

• Smoothing Length 100%
• Nodes 66%
• Search Method 66%
• Hydrodynamics 66%
• Adaptive Smoothing 66%
• Numerical Experiment 33%
• Fluid Dynamics 33%
• Parallel Version 33%