A tight-coupling scheme sharing minimum information across a spatial interface between gyrokinetic turbulence codes

J. Dominski; S. Ku; C. S. Chang; J. Choi; E. Suchyta; S. Parker; S. Klasky; A. Bhattacharjee

doi:10.1063/1.5044707

A tight-coupling scheme sharing minimum information across a spatial interface between gyrokinetic turbulence codes

J. Dominski, S. Ku, C. S. Chang, J. Choi, E. Suchyta, S. Parker, S. Klasky, A. Bhattacharjee

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

A new scheme that tightly couples kinetic turbulence codes across a spatial interface is introduced. This scheme evolves from considerations of competing strategies and down-selection. It is found that the use of a composite kinetic distribution function and fields with global boundary conditions as if the coupled code were one makes the coupling problem tractable. In contrast, coupling the two solutions from each code across the overlap region is found to be more difficult due to numerical dephasing of the turbulent solutions between two solvers. Another advantage of the new scheme is that the data movement can be limited to the 3D fluid quantities, instead of higher dimensional kinetic information, which is computationally more efficient for large scale simulations on leadership class computers.

Original language	English
Article number	072308
Journal	Physics of Plasmas
Volume	25
Issue number	7
DOIs	https://doi.org/10.1063/1.5044707
State	Published - Jul 1 2018

Funding

This manuscript is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Fusion Energy Sciences, and has been authored by Princeton University under Contract No. DE-AC02-09CH11466 with the U.S. Department of Energy. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory (ORNL) and resources of the National Energy Research Scientific Computing Center (NERSC), which are supported by the Office of Science of the U.S. Department of Energy under Contract Nos. DE-AC05-00OR22725 and DE-AC02-05CH11231, respectively.

Funders	Funder number
U.S. Department of Energy
Office of Science
Fusion Energy Sciences
Oak Ridge National Laboratory
Princeton University

Access to Document

10.1063/1.5044707

Cite this

@article{cd27bd9e300a4b848a8c9fa3cc78c0d0,

title = "A tight-coupling scheme sharing minimum information across a spatial interface between gyrokinetic turbulence codes",

abstract = "A new scheme that tightly couples kinetic turbulence codes across a spatial interface is introduced. This scheme evolves from considerations of competing strategies and down-selection. It is found that the use of a composite kinetic distribution function and fields with global boundary conditions as if the coupled code were one makes the coupling problem tractable. In contrast, coupling the two solutions from each code across the overlap region is found to be more difficult due to numerical dephasing of the turbulent solutions between two solvers. Another advantage of the new scheme is that the data movement can be limited to the 3D fluid quantities, instead of higher dimensional kinetic information, which is computationally more efficient for large scale simulations on leadership class computers.",

author = "J. Dominski and S. Ku and Chang, {C. S.} and J. Choi and E. Suchyta and S. Parker and S. Klasky and A. Bhattacharjee",

note = "Publisher Copyright: {\textcopyright} 2018 Author(s).",

year = "2018",

month = jul,

day = "1",

doi = "10.1063/1.5044707",

language = "English",

volume = "25",

journal = "Physics of Plasmas",

issn = "1070-664X",

publisher = "American Institute of Physics",

number = "7",

}

TY - JOUR

T1 - A tight-coupling scheme sharing minimum information across a spatial interface between gyrokinetic turbulence codes

AU - Dominski, J.

AU - Ku, S.

AU - Chang, C. S.

AU - Choi, J.

AU - Suchyta, E.

AU - Parker, S.

AU - Klasky, S.

AU - Bhattacharjee, A.

PY - 2018/7/1

Y1 - 2018/7/1

N2 - A new scheme that tightly couples kinetic turbulence codes across a spatial interface is introduced. This scheme evolves from considerations of competing strategies and down-selection. It is found that the use of a composite kinetic distribution function and fields with global boundary conditions as if the coupled code were one makes the coupling problem tractable. In contrast, coupling the two solutions from each code across the overlap region is found to be more difficult due to numerical dephasing of the turbulent solutions between two solvers. Another advantage of the new scheme is that the data movement can be limited to the 3D fluid quantities, instead of higher dimensional kinetic information, which is computationally more efficient for large scale simulations on leadership class computers.

AB - A new scheme that tightly couples kinetic turbulence codes across a spatial interface is introduced. This scheme evolves from considerations of competing strategies and down-selection. It is found that the use of a composite kinetic distribution function and fields with global boundary conditions as if the coupled code were one makes the coupling problem tractable. In contrast, coupling the two solutions from each code across the overlap region is found to be more difficult due to numerical dephasing of the turbulent solutions between two solvers. Another advantage of the new scheme is that the data movement can be limited to the 3D fluid quantities, instead of higher dimensional kinetic information, which is computationally more efficient for large scale simulations on leadership class computers.

UR - http://www.scopus.com/inward/record.url?scp=85050809858&partnerID=8YFLogxK

U2 - 10.1063/1.5044707

DO - 10.1063/1.5044707

M3 - Article

AN - SCOPUS:85050809858

SN - 1070-664X

VL - 25

JO - Physics of Plasmas

JF - Physics of Plasmas

IS - 7

M1 - 072308

ER -

A tight-coupling scheme sharing minimum information across a spatial interface between gyrokinetic turbulence codes

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this