Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

A co-located partitions strategy for parallel CFD-DEM couplings Pozzetti, Gabriele ; Besseron, Xavier ; Rousset, Alban et al E-print/Working paper (in press) In this work, a new partition-collocation strategy for the parallel execution of CFD–DEM couplings is investigated. Having a good parallel performance is a key issue for an Eulerian-Lagrangian software ... [more ▼] In this work, a new partition-collocation strategy for the parallel execution of CFD–DEM couplings is investigated. Having a good parallel performance is a key issue for an Eulerian-Lagrangian software that aims to be applied to solve industrially significant problems, as the computational cost of these couplings is one of their main drawback. The approach presented here consists in co-locating the overlapping parts of the simulation domain of each software on the same MPI process, in order to reduce the cost of the data exchanges. It is shown how this strategy allows reducing memory consumption and inter-process communication between CFD and DEM to a minimum and therefore to overcome an important parallelization bottleneck identified in the literature. Three benchmarks are proposed to assess the consistency and scalability of this approach. A coupled execution on 280 cores shows that less than 0.1% of the time is used to perform inter-physics data exchange. [less ▲] Detailed reference viewed: 24 (1 UL)A PARALLEL MULTISCALE DEM-VOF METHOD FOR LARGE-SCALE SIMULATIONS OF THREE-PHASE FLOWS Pozzetti, Gabriele ; Besseron, Xavier ; Rousset, Alban et al in Proceedings of ECCM-ECFD 2018 (2018) A parallel dual-grid multiscale DEM-VOF coupling is here investigated. Dual- grid multiscale couplings have been recently used to address different engineering problems involving the interaction between ... [more ▼] A parallel dual-grid multiscale DEM-VOF coupling is here investigated. Dual- grid multiscale couplings have been recently used to address different engineering problems involving the interaction between granular phases and complex fluid flows. Nevertheless, previous studies did not focus on the parallel performance of such a coupling and were, therefore, limited to relatively small applications. In this contribution, we propose an insight into the performance of the dual-grid multiscale DEM-VOF method for three- phase flows when operated in parallel. In particular,we focus on a famous benchmark case for three-phase flows and assess the influence of the partitioning algorithm on the scalability of the dual-grid algorithm. [less ▲] Detailed reference viewed: 20 (9 UL)A parallel dual-grid multiscale approach to CFD-DEM couplings Pozzetti, Gabriele ; ; Besseron, Xavier et al E-print/Working paper (2018) In this work, a new parallel dual-grid multiscale approach for CFD-DEM couplings is investigated. Dual- grid multiscale CFD-DEM couplings have been recently developed and successfully adopted in different ... [more ▼] In this work, a new parallel dual-grid multiscale approach for CFD-DEM couplings is investigated. Dual- grid multiscale CFD-DEM couplings have been recently developed and successfully adopted in different applications still, an efficient parallelization for such a numerical method represents an open issue. Despite its ability to provide grid convergent solutions and more accurate results than standard CFD-DEM couplings, this young numerical method requires good parallel performances in order to be applied to large-scale problems and, therefore, extend its range of application. The parallelization strategy here proposed aims to take advantage of the enhanced complexity of a dual-grid coupling to gain more flexibility in the domain partitioning while keeping a low inter-process communication cost. In particular, it allows avoiding inter- process communication between CFD and DEM software and still allows adopting complex partitioning strategies thanks to an optimized grid-based communication. It is shown how the parallelized multiscale coupling holds all its natural advantages over a mono-scale coupling and can also have better parallel performance. Three benchmark cases are presented to assess the accuracy and performance of the strategy. It is shown how the proposed method allows maintaining good parallel performance when operated over 1000 processes. [less ▲] Detailed reference viewed: 6 (0 UL)Nested Graphs: a model to efficiently distribute multi-agent systems on HPC clusters Rousset, Alban ; ; et al in Concurrency & Computation : Practice & Experience (2017), 30(7), 22 Computational simulation is becoming increasingly important in numerous research fields. Depending on the modeled system, several methods such as differential equations or Monte-Carlo simulations may be ... [more ▼] Computational simulation is becoming increasingly important in numerous research fields. Depending on the modeled system, several methods such as differential equations or Monte-Carlo simulations may be used to represent the system behavior. The amount of computation and memory needed to run a simulation depends on its size and precision and large simulations usually lead to long runs thus requiring to adapt the model to a parallel system. Complex systems are often simulated using Multi-agent systems (MAS). While linear system based models benefit from a large set of tools to take advantage of parallel resources, multi-agent systems suffer from a lack of platforms that ease the use of such resources. In this paper, we propose the use of Nested Graphs for a new modeling approach that allows the design of large, complex and multi-scale multi-agent models which can efficiently be distributed on parallel resources. Nested Graphs are formally defined and are illustrated on the well-known predator-prey model. We also introduce PDMAS (Parallel and Distributed Multi-Agent System) a platform that implements the Nested Graph modeling approach to ease the distribution of multi-agent models on High Performance Computing clusters. Performance results are presented to validate the efficiency of the resulting models. [less ▲] Detailed reference viewed: 8 (1 UL)Comparing Broad-Phase Interaction Detection Algorithms for Multiphysics DEM Applications Rousset, Alban ; Mainassara Chekaraou, Abdoul Wahid ; Liao, Yu-Chung et al in AIP Conference Proceedings ICNAAM 2017 (2017, September) Collision detection is an ongoing source of research and optimization in many fields including video-games and numerical simulations [6, 7, 8]. The goal of collision detection is to report a geometric ... [more ▼] Collision detection is an ongoing source of research and optimization in many fields including video-games and numerical simulations [6, 7, 8]. The goal of collision detection is to report a geometric contact when it is about to occur or has actually occurred. Unfortunately, detailed and exact collision detection for large amounts of objects represent an immense amount of computations, naively n 2 operation with n being the number of objects [9]. To avoid and reduce these expensive computations, the collision detection is decomposed in two phases as it shown on Figure 1: the Broad-Phase and the Narrow-Phase. In this paper, we focus on Broad-Phase algorithm in a large dynamic three-dimensional environment. We studied two kinds of Broad-Phase algorithms: spatial partitioning and spatial sorting. Spatial partitioning techniques operate by dividing space into a number of regions that can be quickly tested against each object. Two types of spatial partitioning will be considered: grids and trees. The grid-based algorithms consist of a spatial partitioning processing by dividing space into regions and testing if objects overlap the same region of space. And this reduces the number of pairwise to test. The tree-based algorithms use a tree structure where each node spans a particular space area. This reduces the pairwise checking cost because only tree leaves are checked. The spatial sorting based algorithm consists of a sorted spatial ordering of objects. Axis-Aligned Bounding Boxes (AABBs) are projected onto x, y and z axes and put into sorted lists. By sorting projection onto axes, two objects collide if and only if they collide on the three axes. This axis sorting reduces the number of pairwise to tested by reducing the number of tests to perform to only pairs which collide on at least one axis. For this study, ten different Broad-Phase collision detection algorithms or framework have been considered. The Bullet [6], CGAL [10, 11] frameworks have been used. Concerning the implemented algorithms most of them come from papers or given implementation. [less ▲] Detailed reference viewed: 130 (37 UL)On the performance of an overlapping-domain parallelization strategy for Eulerian-Lagrangian Multiphysics software Pozzetti, Gabriele ; Besseron, Xavier ; Rousset, Alban et al in AIP Conference Proceedings ICNAAM 2017 (2017, September) In this work, a strategy for the parallelization of a two-way CFD-DEM coupling is investigated. It consists on adopting balanced overlapping partitions for the CFD and the DEM domains, that aims to reduce ... [more ▼] In this work, a strategy for the parallelization of a two-way CFD-DEM coupling is investigated. It consists on adopting balanced overlapping partitions for the CFD and the DEM domains, that aims to reduce the memory consumption and inter-process communication between CFD and DEM. Two benchmarks are proposed to assess the consistency and scalability of this approach, coupled execution on 252 cores shows that less than 1\% of time is used to perform inter-physics data exchange. [less ▲] Detailed reference viewed: 133 (51 UL)Parallelizing XDEM: Load-balancing policies and efficiency, a study Rousset, Alban ; Besseron, Xavier ; Peters, Bernhard Scientific Conference (2017, September) In XDEM, the simulation domain is geometrically decomposed in regular fixed-size cells that are used to distribute the workload between the processes. The role of the partitioning algorithm is to ... [more ▼] In XDEM, the simulation domain is geometrically decomposed in regular fixed-size cells that are used to distribute the workload between the processes. The role of the partitioning algorithm is to distribute the cells among all the processes in order to balance the workload. To accomplish this task, the partitioning algorithm relies on a computing/communication cost that has been estimated for each cell. A proper estimation of these costs is fundamental to obtain pertinent results during this phase. The study in the work is twofold. First, we integrate five partitioning algorithms (ORB, RCB, RIB, kway and PhG) in the XDEM framework [1]. Most of these algorithms are implemented within the Zoltan library [2], a parallel framework for partitioning and ordering problems. Secondly, we propose different policies to estimate the computing cost and communication cost of the different cells composing the simulation domain. Then, we present an experimental evaluation and a performance comparison of these partitioning algorithms and cost-estimation policies on a large scale parallel execution of XDEM running on the HPC platform of the University of Luxembourg. Finally, after explaining the pros and cons of each partitioning algorithms and cost-estimation policies, we discuss on the best choices to adopt depending on the simulation case. [less ▲] Detailed reference viewed: 57 (15 UL) |
||