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

Purpose This paper aims to develop a parallel fast neighbor search method and communication strategy for particle-based methods with adaptive smoothing-length on distributed-memory computing systems. Design/methodology/approach With a multi-resolution-based hierarchical data structure, the parallel...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Engineering computations Jg. 36; H. 3; S. 899 - 929
Hauptverfasser: Fu, Lin, Ji, Zhe, Hu, Xiangyu Y, Adams, Nikolaus A
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Bradford Emerald Publishing Limited 08.05.2019
Emerald Group Publishing Limited
Schlagworte:
Adaptive systems
Algorithms
Buffers
Communication
Computational fluid dynamics
Computer simulation
Construction
Data exchange
Data structures
Distributed memory
Efficiency
Fluid dynamics
Fluid flow
Fluid mechanics
Graph coloring
Graph theory
Methods
Microprocessors
Nodes
Partitioning
Search methods
Smooth particle hydrodynamics
Smoothing
Structural hierarchy
Message passing interface
Smoothed particle hydrodynamics
Lagrange particle method
Parallel simulation
Edge coloring
Grid partitioning
ISSN:0264-4401, 1758-7077
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Purpose This paper aims to develop a parallel fast neighbor search method and communication strategy for particle-based methods with adaptive smoothing-length on distributed-memory computing systems. Design/methodology/approach With a multi-resolution-based hierarchical data structure, the parallel neighbor search method is developed to detect and construct ghost buffer particles, i.e. neighboring particles on remote processor nodes. To migrate ghost buffer particles among processor nodes, an undirected graph is established to characterize the sparse data communication relation and is dynamically recomposed. By the introduction of an edge coloring algorithm from graph theory, the complex sparse data exchange can be accomplished within optimized frequency. For each communication substep, only efficient nonblocking point-to-point communication is involved. Findings Two demonstration scenarios are considered: fluid dynamics based on smoothed-particle hydrodynamics with adaptive smoothing-length and a recently proposed physics-motivated partitioning method [Fu et al., JCP 341 (2017): 447-473]. Several new concepts are introduced to recast the partitioning method into a parallel version. A set of numerical experiments is conducted to demonstrate the performance and potential of the proposed parallel algorithms. Originality/value The proposed methods are simple to implement in large-scale parallel environment and can handle particle simulations with arbitrarily varying smoothing-lengths. The implemented smoothed-particle hydrodynamics solver has good parallel performance, suggesting the potential for other scientific applications.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0264-4401
1758-7077
DOI:10.1108/EC-05-2018-0226