Balancing conflicting requirements for grid and particle decomposition in continuum-Lagrangian solvers

Sitaraman, Hariswaran; Grout, Ray

doi:10.1016/j.parco.2015.10.010

Title: Balancing conflicting requirements for grid and particle decomposition in continuum-Lagrangian solvers

Full Record
Other Related Research

Authors:: Sitaraman, Hariswaran; Grout, Ray

Publication Date:: Mon Feb 01 00:00:00 EST 2016

Sponsoring Org.:: USDOE

OSTI Identifier:: 1397536

Grant/Contract Number:: AC02-05CH11231

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Parallel Computing

Additional Journal Information:: Journal Name: Parallel Computing Journal Volume: 52 Journal Issue: C; Journal ID: ISSN 0167-8191

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Sitaraman, Hariswaran, and Grout, Ray. Balancing conflicting requirements for grid and particle decomposition in continuum-Lagrangian solvers.  Netherlands: N. p., 2016. 
Web.  doi:10.1016/j.parco.2015.10.010.

Copy to clipboard


                    Sitaraman, Hariswaran, & Grout, Ray. Balancing conflicting requirements for grid and particle decomposition in continuum-Lagrangian solvers.  Netherlands.  https://doi.org/10.1016/j.parco.2015.10.010

Copy to clipboard


                    Sitaraman, Hariswaran, and Grout, Ray. Mon .  
"Balancing conflicting requirements for grid and particle decomposition in continuum-Lagrangian solvers".  Netherlands.  https://doi.org/10.1016/j.parco.2015.10.010.

Copy to clipboard


                    
@article{osti_1397536,

  title        = {Balancing conflicting requirements for grid and particle decomposition in continuum-Lagrangian solvers},

  author       = {Sitaraman, Hariswaran and Grout, Ray},

  abstractNote = {},

  doi          = {10.1016/j.parco.2015.10.010},

  journal      = {Parallel Computing},

  number       = C,

  volume       = 52,

  place        = {Netherlands},

  year         = {Mon Feb 01 00:00:00 EST 2016},

  month        = {Mon Feb 01 00:00:00 EST 2016}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.parco.2015.10.010

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 6 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Balancing Conflicting Requirements for Grid and Particle Decomposition in Continuum-Lagrangian Solvers

Journal Article Sitaraman, Hariswaran ; Grout, Ray - Parallel Computing

The load balancing strategies for hybrid solvers that involve grid based partial differential equation solution coupled with particle tracking are presented in this paper. A typical Message Passing Interface (MPI) based parallelization of grid based solves are done using a spatial domain decomposition while particle tracking is primarily done using either of the two techniques. One of the techniques is to distribute the particles to MPI ranks to whose grid they belong to while the other is to share the particles equally among all ranks, irrespective of their spatial location. The former technique provides spatial locality for field interpolation butmore »« less
https://doi.org/10.1016/j.parco.2015.10.010
Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes

Journal Article Schauer, Lucas ; Schmidt, Michael J. ; Engdahl, Nicholas B. ; ... - Geoscientific Model Development (Online)

Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any numbermore »« less
https://doi.org/10.5194/gmd-16-833-2023

Full Text Available
Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Conference Zhang, Jiang ; Guo, Hanqi ; Yuan, Xiaoru ; ...

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the newmore »« less
https://doi.org/10.1109/tvcg.2017.2744059
Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Journal Article Zhang, Jiang ; Guo, Hanqi ; Hong, Fan ; ... - IEEE Transactions on Visualization and Computer Graphics

Here, we propose a dynamically load-balanced algorithm for parallel particle tracing, which periodically attempts to evenly redistribute particles across processes based on k-d tree decomposition. Each process is assigned with (1) a statically partitioned, axis-aligned data block that partially overlaps with neighboring blocks in other processes and (2) a dynamically determined k-d tree leaf node that bounds the active particles for computation; the bounds of the k-d tree nodes are constrained by the geometries of data blocks. Given a certain degree of overlap between blocks, our method can balance the number of particles as much as possible. Compared with othermore »« less
Cited by 15
https://doi.org/10.1109/TVCG.2017.2744059

Full Text Available
A Fokker-Planck-Landau collision equation solver on two-dimensional velocity grid and its application to particle-in-cell simulation

Journal Article Yoon, E. S. ; Chang, C. S., E-mail: cschang@pppl.gov ; Korea Advanced Institute of Science and Technology, Yuseong-gu, DaeJeon 305-701 - Physics of Plasmas

An approximate two-dimensional solver of the nonlinear Fokker-Planck-Landau collision operator has been developed using the assumption that the particle probability distribution function is independent of gyroangle in the limit of strong magnetic field. The isotropic one-dimensional scheme developed for nonlinear Fokker-Planck-Landau equation by Buet and Cordier [J. Comput. Phys. 179, 43 (2002)] and for linear Fokker-Planck-Landau equation by Chang and Cooper [J. Comput. Phys. 6, 1 (1970)] have been modified and extended to two-dimensional nonlinear equation. In addition, a method is suggested to apply the new velocity-grid based collision solver to Lagrangian particle-in-cell simulation by adjusting the weights of markermore »« less
https://doi.org/10.1063/1.4867359

Similar Records