scholarly journals Overset Grid Assembler and Flow Solver with Adaptive Spatial Load Balancing

2021 ◽  
Vol 11 (11) ◽  
pp. 5132
Author(s):  
Orxan Shibliyev ◽  
Ibrahim Sezai

An overset mesh approach is useful for unsteady flow problems which involve components moving relative to each other. Since the generation of a single mesh around all components is prone to mesh stretching due to the relative motion of bodies, using the overset grid methodology, an individual mesh can be generated for each component. In this study, a parallel overset grid assembler was developed to establish connectivity across component meshes. Connectivity information was transferred to the developed parallel flow solver. The assembler uses multiple methods such as alternating digital tree and stencil walking to reduce the time spent on domain connectivity. Both the assembler and solver were partitioned spatially so that overlapping mesh blocks reside in the same partitions. Spatial partitioning was performed using a 3D space partitioning structure, namely octree, to which mesh blocks are registered. The octree was refined adaptively until bins of octree could be evenly distributed to processors. The assembler and solver were tested on a generic helicopter configuration in terms of load balance, scalability, and memory usage.

Author(s):  
David Boger ◽  
Ralph Noack ◽  
Adam Amar ◽  
Benjamin Kirk ◽  
Randolph Lillard ◽  
...  

2018 ◽  
Vol 13 ◽  
pp. 174830181879706 ◽  
Author(s):  
Wenpeng Ma ◽  
Xiaodong Hu ◽  
Xiazhen Liu

In this paper we investigate parallel implementations of multibody separation simulation using a hybrid of message passing interface and OpenMP. We propose a mesh block-based overset communication optimization algorithm. After presenting details of local data structures, we present our strategy for parallelizing both the overset mesh assembler and the flow solver by employing message passing interface and OpenMP. Experimental results show that the mesh block-based overset communication optimization algorithm has an advantage in real elapsed time when compared to a process-based implementation. The hybrid version shows that it is suitable for improving the load balance if a large number of CPU cores are used. We report results for a standard multibody separation case.


2019 ◽  
Vol 1 (2) ◽  
pp. Manuscript
Author(s):  
Jean-Marc Laurens ◽  
Margot Remaud ◽  
Pierre-Michel Guilcher

In this paper, a preliminary parameter characterization for the numerical optimisation of ducted propellers was performed. The ENSTA Bretagne in-house solver used is based on the potential flow theory. Although the potential flow solver is able to solve unsteady problems, in this preliminary study only steady state flow problems are considered. Different parameters were analysed, such as the gap between the propeller tip and the inner duct surface as well as the propeller location in the duct tube. The analyses were carried out on a standard advance coefficient range. A quick study showed that a neutral NACA profile for the duct section could provide higher performance predictions than the classical accelerating Kort nozzle 19A.


2007 ◽  
Vol 196 (9-12) ◽  
pp. 1701-1715 ◽  
Author(s):  
Wei Liao ◽  
Jinsheng Cai ◽  
Her Mann Tsai

2004 ◽  
Vol 03 (02) ◽  
pp. 143-154
Author(s):  
Chin-Chen Chang ◽  
Chih-Yang Lin ◽  
Pei-Yu Lin

Parallel association rules mining is a noticeable problem in data mining. However, little work has been proposed to deal with three important issues: (1) less memory usage; (2) less communication, among the involved computers, over the network; and (3) load balance among computers. In this paper, we present a graph-based scheme to solve the parallel mining problem by applying independent groups (clusters of maximal cliques). To bring the three issues to a close, the purpose of the independent groups aims at dividing a database into several independent sub-databases, so each sub-database can be employed independently to perform mining algorithms. To emphasis the effectiveness of the graph-based scheme, we adopt the independent groups not only for maximal large itemsets mining but also for general large itemsets mining. The experimental results show that our scheme can improve the efficiency for parallel mining when the independent groups are well-organized and designed.


Sign in / Sign up

Export Citation Format

Share Document