Search NASA⌕ Search

SEARCH · Search NASA

Results for “Large Scale Simulation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

Topanga: A kinetic ion plasma code for large-scale ionospheric simulations on magnetohydrodynamic timescales

Topanga is a kinetic ion code developed for simulating large-scale plasma phenomena in the Earth's ionosphere on magnetohydrodynamic timescales. It is a domain-decomposed parallel code that runs on high-performance computing platforms. Features of Topanga include spherical geometry for simplified boundary conditions and computational efficiency; a hybrid plasma model with inertia-less fluid electrons, kinetic ions, and an electric field specified via an Ohm's law; a Maxwell-FDTD (finite difference time domain) plasma model which retains the displacement current in Maxwell's equations and models electron currents in the ionosphere with a tensor conductivity; sponge-layer boundary conditions for absorption of electromagnetic and plasma waves incident on the domain boundaries; and a novel mixed-implicit algorithm for evolving the EM fields inside the Maxwell-FDTD region that is stable over many orders of magnitude in the electron–ion collision frequency. We verify the numerical methods used in Topanga on a pair of test problems. The first test involves modeling a three-dimensional collisionless shock using the hybrid set of equations. The second test involves modeling a spherical TEM mode in vacuum using the Maxwell-FDTD set of equations. Finally, we demonstrate how using the combined set of hybrid and Maxwell-FDTD equations to model the Starfish Prime high-altitude nuclear test recovers a “missing” EM signal on the ground that is not present when using only the hybrid set of equations. The magnitude of this signal in the simulation containing the Maxwell-FDTD region agrees well with the E3a portion of the magnetohydrodynamic electromagnetic pulse from Starfish Prime.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Opportunities for Breakthroughs in Large-Scale Computational Simulation and Design

Opportunities for breakthroughs in the large-scale computational simulation and design of aerospace vehicles are presented. Computational fluid dynamics tools to be used within multidisciplinary analysis and design methods are emphasized. The opportunities stem from speedups and robustness improvements in the underlying unit operations associated with simulation (geometry modeling, grid generation, physical modeling, analysis, etc.). Further, an improved programming environment can synergistically integrate these unit operations to leverage the gains. The speedups result from reducing the problem setup time through geometry modeling and grid generation operations, and reducing the solution time through the operation counts associated with solving the discretized equations to a sufficient accuracy. The opportunities are addressed only at a general level here, but an extensive list of references containing further details is included. The opportunities discussed are being addressed through the Fast Adaptive Aerospace Tools (FAAST) element of the Advanced Systems Concept to Test (ASCoT) and the third Generation Reusable Launch Vehicles (RLV) projects at NASA Langley Research Center. The overall goal is to enable greater inroads into the design process with large-scale simulations.

Alexandrov, Natalia↗

Parallel FETI‐DP algorithm for efficient simulation of large‐scale EM problems

Summary An efficient parallelization of the dual‐primal finite‐element tearing and interconnecting (FETI‐DP) algorithm is presented for large‐scale electromagnetic simulations. As a nonoverlapping domain decomposition method, the FETI‐DP algorithm formulates a global interface problem, whose iterative solution is accelerated with a solution of a global corner problem. To achieve a good load balance for parallel computation, the original computational domain is decomposed into subdomains with similar sizes and shapes. The subdomains are then distributed to processors based on their close proximity to minimize inter‐processor communication. The parallel generalized minimal residual method, enhanced with the iterative classical Gram‐Schmidt orthogonalization scheme to reduce global communication, is adopted to solve the global interface problem with a fast convergence rate. The global corner‐related coarse problem is solved iteratively with a parallel communication‐avoiding biconjugate gradient stabilized method to minimize global communication, and its convergence is accelerated by a diagonal preconditioner constructed from the coarse system matrix. To alleviate neighboring communication overhead, the non‐blocking communication approach is employed in both generalized minimal residual and communication‐avoiding biconjugate gradient stabilized iterative solutions. Three numerical examples are presented to demonstrate the accuracy, scalability, and capability of the proposed parallel FETI‐DP algorithm for electromagnetic modeling of general objects and antenna arrays. Copyright © 2016 John Wiley & Sons, Ltd.

Zhang, Kedi↗

In-Situ Feature Extraction of Large Scale Combustion Simulations Using Segmented Merge Trees, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

The ever increasing amount of data generated by scientific simulations coupled with system I/O constraints are fueling a need for in-situ analysis techniques. Of particular interest are approaches that produce reduced data representations while maintaining the ability to redefine, extract, and study features in a post-process to obtain scientific insights. This paper presents two variants of in-situ feature extraction techniques using segmented merge trees, which encode a wide range of threshold based features. The first approach is a fast, low communication cost technique that generates an exact solution but has limited scalability. The second is a scalable, local approximation that nevertheless is guaranteed to correctly extract all features up to a predefined size. We demonstrate both variants using some of the largest combustion simulations available on leadership class supercomputers. Our approach allows state-of-the-art, feature-based analysis to be performed in-situ at significantly higher frequency than currently possible and with negligible impact on the overall simulation runtime.

Computer Science↗

Large-scale atomistic simulations of low-energy helium implantation into tungsten single crystals

Large-scale molecular dynamics simulations of post-implantation helium behavior in plasma-facing tungsten single crystals reveal orientation-dependent depth profiles, surface evolution patterns, and other crystallographic and diffusion-related characteristics of helium behavior in tungsten during the first microsecond. Here, the flux of implanted helium atoms studied, Γ ≈ 4 × 10 25 m -2 s -1 , is about one order of magnitude larger than that expected in ITER, the experimental fusion reactor currently being constructed in France. With simulation times on the order of 1 μs, these results serve to discover the mechanisms involved in surface evolution as well as to serve as benchmarks for coarse-grained simulations such as kinetic Monte Carlo and continuum-scale drift–reaction–diffusion cluster dynamics simulations. The findings of our large-scale simulations are significant due to diminished finite-size effects and the longer times reached (corresponding to higher fluences). Specifically, our findings are drastically different from findings published previously in the literature for (001) surfaces under a helium flux of Γ ~ 10 28 m -2 s -1 , which is typical of smaller size and shorter time atomistic simulations. In particular, this study highlights the atomic-scale materials processes relevant to helium entrapment and transport in metals, which have implications not only for nuclear fusion–relevant processes, but also helium-induced embrittlement in irradiated materials such as hospital equipment and fission reactor materials.

36 MATERIALS SCIENCE↗

Parallel continuous simulated tempering and its applications in large-scale molecular simulations

In this paper, we introduce a parallel continuous simulated tempering (PCST) method for enhanced sampling in studying large complex systems. It mainly inherits the continuous simulated tempering (CST) method in our previous studies [C. Zhang and J. Ma, J. Chem. Phys. 130, 194112 (2009); C. Zhang and J. Ma, J. Chem. Phys. 132, 244101 (2010)], while adopts the spirit of parallel tempering (PT), or replica exchange method, by employing multiple copies with different temperature distributions. Differing from conventional PT methods, despite the large stride of total temperature range, the PCST method requires very few copies of simulations, typically 2–3 copies, yet it is still capable of maintaining a high rate of exchange between neighboring copies. Furthermore, in PCST method, the size of the system does not dramatically affect the number of copy needed because the exchange rate is independent of total potential energy, thus providing an enormous advantage over conventional PT methods in studying very large systems. The sampling efficiency of PCST was tested in two-dimensional Ising model, Lennard-Jones liquid and all-atom folding simulation of a small globular protein trp-cage in explicit solvent. The results demonstrate that the PCST method significantly improves sampling efficiency compared with other methods and it is particularly effective in simulating systems with long relaxation time or correlation time. We expect the PCST method to be a good alternative to parallel tempering methods in simulating large systems such as phase transition and dynamics of macromolecules in explicit solvent.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

GenASiS Basics: Object-oriented utilitarian functionality for large-scale physics simulations

Aside from numerical algorithms and problem setup, large-scale physics simulations on distributed-memory supercomputers require more basic utilitarian functionality, such as physical units and constants; display to the screen or standard output device; message passing; I/O to disk; and runtime parameter management and usage statistics. Here we describe and make available Fortran 2003 classes furnishing extensible object-oriented implementations of this sort of rudimentary functionality, along with individual `unit test' programs and larger example problems demonstrating their use. Lastly, these classes compose the Basics division of our developing astrophysics simulation code GenASiS (General Astrophysical Simulation System), but their fundamental nature makes them useful for physics simulations in many fields.

97 MATHEMATICS AND COMPUTING↗

The Artificial Scientist: in-Transit Machine Learning of Plasma Simulations

Large-scale simulations or scientific experiments produce petabytes of data per run. This poses massive challenges for I/O and storage when scientific analysis workflows are run manually offline. Unsupervised deep learning-based techniques to extract patterns and non-linear relations from these large amounts of data provide a way to build scientific understanding from raw data, reducing the need for manual pre-selection of analysis steps, but require exascale compute and memory to process the full dataset available. In this paper, we demonstrate a heterogeneous streaming workflow in which plasma simulation data is streamed directly to a Machine Learning (ML) application training a model on the simulation data in-transit, completely circumventing the capacity-constrained filesystem bottleneck. This workflow employs openPMD to provide a high level interface to describe scientific data and also uses ADIOS2, to transfer volumes of data that exceed the capabilities of the filesystem. We employ experience replay to avoid catastrophic forgetting in learning from this non-steady state process in a continual manner and adapt it to improve model convergence while learning in-transit. As a proof-of-concept, we approach the ill-posed inverse problem of predicting particle dynamics from radiation in a particle-incell (PIConGPU) simulation of the Kelvin-Helmholtz instability (KHI). We detail hardware-software co-design challenges as we scale PIConGPU to full Frontier, the Top-1 system as of June 2024 Top500 list.

Kelling, Jeffrey [Helmholtz-Zentrum Dresden Rossen↗

Multi-GPU immersed boundary method hemodynamics simulations

Large-scale simulations of blood flow that resolve the 3D deformation of each comprising cell are increasingly popular owing to algorithmic developments in conjunction with advances in compute capability. Among different approaches for modeling cell-resolved hemodynamics, fluid structure interaction (FSI) algorithms based on the immersed boundary method are frequently employed for coupling separate solvers for the background fluid and the cells within one framework. GPUs can accelerate these simulations; however, both current pre-exascale and future exascale CPU-GPU heterogeneous systems face communication challenges critical to performance and scalability. In this paper, we describe, to our knowledge, the largest distributed GPU-accelerated FSI simulations of high hematocrit cell-resolved flows with over 17 million red blood cells. We compare scaling on a fat node system with six GPUs per node and on a system with a single GPU per node. Through comparison between the CPU- and GPU-based implementations, we identify the costs of data movement in multiscale multi-grid FSI simulations on heterogeneous systems and show it to be the greatest performance bottleneck on the GPU.

97 MATHEMATICS AND COMPUTING↗

Physics-aware adaptive checkpointing with shadow systems for nonlinear PDE simulations

Large-scale simulations of nonlinear partial differential equations (PDEs) that exhibit strongly transient behavior and pattern-forming dynamics produce enormous amounts of data, which, even with modern storage systems, cannot be stored for later curation. Current I/O strategies either write dense time series of snapshots, which is often prohibitive in I/O and storage, or store a few checkpoints that enable restart but incur expensive recomputation cost and provide no control over post-restart error growth, especially when lossy compression is used. Moreover, most, if not all, existing strategies take no account of the actual physical state of the system. Here, we present a simple physics-aware I/O framework in which a low-cost shadow system adaptively triggers lossy checkpoints when the shadow system deviates from the fine-scale simulation. The shadow system can be a coarsened replica of the fine-scale simulation that evolves concurrently. This means that checkpoints are taken based on the physical state of the system: fewer checkpoints are triggered when the system is quiescent while more are taken when the system undergoes a rapid change. This type of behavior is observed in many systems such as Brusselator and FitzHugh–Nagumo. We illustrate that our framework maintains stable restarts, keeps fine-scale restart errors bounded by shadow errors, and reconstructs the time history with significantly lower error and storage than interpolating fixed-interval snapshots, with low-cost shadow replay and modest online synchronization overhead.

Gong, Qian [ORNL] (ORCID:0000000235704142)↗

Development of Comprehensive Reduced Kinetic Models for Supersonic Reacting Shear Layer Simulations

Large-scale simulations of multi-dimensional unsteady turbulent reacting flows with detailed chemistry and transport can be computationally extremely intensive even on distributed computing architectures. With the development of suitable reduced chemical kinetic models, the number of scalar variables to be integrated can be decreased, leading to a significant reduction in the computational time required for the simulation with limited loss of accuracy in the results. A general MATLAB-based automated mechanism reduction procedure is presented to reduce any complex starting mechanism (detailed or skeletal) with minimal human intervention. Based on the application of the quasi steady-state (QSS) approximation for certain chemical species and on the elimination of the fast reaction rates in the mechanism, several comprehensive reduced models, capable of handling different fuels such as C2H4, CH4 and H2, have been developed and thoroughly tested for several combustion problems (ignition, propagation and extinction) and physical conditions (reactant compositions, temperatures, and pressures). A key feature of the present reduction procedure is the explicit solution of the concentrations of the QSS species, needed for the evaluation of the elementary reaction rates. In contrast, previous approaches relied on an implicit solution due to the strong coupling between QSS species, requiring computationally expensive inner iterations. A novel algorithm, based on the definition of a QSS species coupling matrix, is presented to (i) introduce appropriate truncations to the QSS algebraic relations and (ii) identify the optimal sequence for the explicit solution of the concentration of the QSS species. With the automatic generation of the relevant source code, the resulting reduced models can be readily implemented into numerical codes.

Zambon, A. C.↗

Probing Selected Morphological Models of Hydrated Nafion Using Large-Scale Molecular Dynamics Simulations

Atomistic molecular dynamics simulations were performed to study hydrated Nafion systems large enough (approximately 2 million atoms, approximately 30 nm box length) to directly observe several hydrophilic domains at the molecular level. These systems consisted of six of the most significant and relevant morphological models of Nafion to-date: (1) the cluster-channel model, (2) the parallel cylinder model, (3) the local order model, (4) the lamellar model, (5) the rod network model, and (6) a "random" model that does not directly assume any particular geometry, distribution, or morphology. Each system was initially built to closely approximate the proposed hydrophilic cluster structure in a given model. Molecular dynamics simulations were then used to observe resulting changes from and behavior of the assumed initial configurations. These simulations revealed fast intercluster "bridge" formation and network percolation in all models. Sulfonate groups were found inside these bridges and played a significant role in percolation. Sulfonates also strongly aggregated around and inside clusters. Cluster surfaces were analyzed to study the hydrophilic-hydrophobic interface. Interfacial area and cluster volume significantly increased during the simulations, and radial distribution functions and structure factors were also calculated. All nonrandom models clearly exhibited the characteristic experimental scattering peak, underscoring the insensitivity of this measurement to hydrophilic domain structure and highlighting the need for future work to clearly distinguish morphological models of Nafion.

Knox, Craig K.↗

CNES Large Scale SWOT Simulator: User's Tutorial for Terrestrial Surface Water Applications

The CNES Large Scale SWOT Hydrology Simulator creates proxy SWOT water surface elevations (WSE). A large portion of the effort required to run the CNES simulator is upfront in creating the simulator input. This tutorial describes the steps to create the simulator input and then run the CNES simulator. Since many applications will utilize a time series of proxy SWOT WSE, a short description of that process is included in the Appendix for advanced users.

Hydrology↗

Computationally efficient modeling and simulation of large scale systems

A method of simulating operation of a VLSI interconnect structure having capacitive and inductive coupling between nodes thereof. A matrix X and a matrix Y containing different combinations of passive circuit element values for the interconnect structure are obtained where the element values for each matrix include inductance L and inverse capacitance P. An adjacency matrix A associated with the interconnect structure is obtained. Numerical integration is used to solve first and second equations, each including as a factor the product of the inverse matrix X.sup.1 and at least one other matrix, with first equation including X.sup.1Y, X.sup.1A, and X.sup.1P, and the second equation including X.sup.1A and X.sup.1P.

Jain, Jitesh↗

Computationally efficient modeling and simulation of large scale systems

A method of simulating operation of a VLSI interconnect structure having capacitive and inductive coupling between nodes thereof. A matrix X and a matrix Y containing different combinations of passive circuit element values for the interconnect structure are obtained where the element values for each matrix include inductance L and inverse capacitance P. An adjacency matrix A associated with the interconnect structure is obtained. Numerical integration is used to solve first and second equations, each including as a factor the product of the inverse matrix X.sup.-1 and at least one other matrix, with first equation including X.sup.-1Y, X.sup.-1A, and X.sup.-1P, and the second equation including X.sup.-1A and X.sup.-1P.

Jain, Jitesh↗

Computationally Efficient Modeling and Simulation of Large Scale Systems

A system for simulating operation of a VLSI interconnect structure having capacitive and inductive coupling between nodes thereof, including a processor, and a memory, the processor configured to perform obtaining a matrix X and a matrix Y containing different combinations of passive circuit element values for the interconnect structure, the element values for each matrix including inductance L and inverse capacitance P, obtaining an adjacency matrix A associated with the interconnect structure, storing the matrices X, Y, and A in the memory, and performing numerical integration to solve first and second equations.

Jain, Jitesh↗

In-situ sampling of a large-scale particle simulation for interactive visualization and analysis

We propose storing a random sampling of data from large scale particle simulations, such as the Roadrunner Universe MC{sup 3} cosmological simulation, to be used for interactive post-analysis and visualization. Simulation data generation rates will continue to be far greater than storage bandwidth rates and other limiting technologies by many orders of magnitude. This implies that only a very small fraction of data generated by the simulation can ever be stored and subsequently post-analyzed. The limiting technology in this situation is analogous to the problem in many population surveys: there aren't enough human resources to query a large population. To cope with the lack of resources, statistical sampling techniques are used to create a representative data set of a large population. Mirroring that situation, we propose to store a simulation-time random sampling of the particle data to cope with the bOlllenecks and support interactive, exploratory post-analysis. The particle samples are immediately stored in a level-ol-detail format for post-visualization and analysis, which amortizes the cost of post-processing for interactive visualization. Additionally, we incorporate a system for recording and visualizing sample approximation error information for confidence and importance highlighting.

97 MATHEMATICS AND COMPUTING↗