Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel 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 1,045 records · Page 58

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗

Parallel Distributed Hydrology Soil Vegetation Model (DHSVM) using global arrays

The Distributed Hydrology Soil Vegetation Model (DHSVM) code was parallelized for distributed memory computers using Global Arrays (GA). To analyze parallel performance, DHSVM was used to simulate two significantly sized river basins located in northwest continental United States and southwest Canada at 90~m resolution: (1) Clearwater (25,000~km2) and (2) Columbia (668,000~km2). Meteorological forcing applied to both basins was dynamically down-scaled from a global circulation model using the Weather Research and Forecasting (WRF) model and read into DHSVM as 2D maps each time step. We report parallel code speed up was significant. Run times for 1-year simulations were reduced by an order of magnitude for both test basins. A maximum speed up of 105 was attained with 480 processors while simulating the Columbia basin. Speed up was limited by input dominated tasks, particularly the input of meteorological forcing data.

54 ENVIRONMENTAL SCIENCES↗

Revisiting Parallel Cyclic Reduction and Parallel Prefix-Based Algorithms for Block Tridiagonal System of Equations

Simulations that require solutions of block tridiagonal systems of equations rely on fast parallel solvers for runtime efficiency. Leading parallel solvers that are highly effective for general systems of equations, dense or sparse, are limited in scalability when applied to block tridiagonal systems. This paper presents scalability results as well as detailed analyses of two parallel solvers that exploit the special structure of block tridiagonal matrices to deliver superior performance, often by orders of magnitude. A rigorous analysis of their relative parallel runtimes is shown to reveal the existence of a critical block size that separates the parameter space spanned by the number of block rows, the block size and the processor count, into distinct regions that favor one or the other of the two solvers. Dependence of this critical block size on the above parameters as well as on machine-specific constants is established. These formal insights are supported by empirical results on up to 2,048 cores of a Cray XT4 system. To the best of our knowledge, this is the highest reported scalability for parallel block tridiagonal solvers to date.

Seal, Sudip K↗

First-Principles Grand-Canonical Simulations of Water Adsorption in Proton-Exchanged Zeolites

Water appears by design or as impurities in many important reactive systems. For those catalyzed by porous solid acids, such as widely used zeolites, experimentally quantifying the amount or elucidating the structure of adsorbed water clusters at reaction conditions is challenging, while computational studies (e.g., first-principles molecular dynamics simulations) often need to assume the loading to examine solvation effects. Furthermore, we perform first-principles grand-canonical simulations to predict water adsorption to H-ZSM-5 zeolites under specified experimental conditions. Presampling with inexpensive force fields and a pool-based parallelization algorithm are used to improve simulation efficiency, while molecular dynamics is used to sample configurations involving hydronium species. We observe that H + exchange dramatically increases the hydrophilicity of zeolite MFI and an appreciable amount of water is present at very low relative humidities. At all conditions examined, the zeolitic protons are found to dissociate readily from the surface basic sites and become mobile by participating in the hydrogen-bonded chains of adsorbed water molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reinforcement Learning for Load-balanced Parallel Particle Tracing

We explore an online reinforcement learning (RL) paradigm to dynamically optimize parallel particle tracing performance in distributed-memory systems. Our method combines three novel components: (1) a work donation algorithm, (2) a high-order workload estimation model, and (3) a communication cost model. First, we design an RL-based work donation algorithm. Our algorithm monitors workloads of processes and creates RL agents to donate data blocks and particles from high-workload processes to low-workload processes to minimize program execution time. The agents learn the donation strategy on the fly based on reward and cost functions designed to consider processes' workload changes and data transfer costs of donation actions. Second, we propose a workload estimation model, helping RL agents estimate the workload distribution of processes in future computations. Third, we design a communication cost model that considers both block and particle data exchange costs, helping RL agents make effective decisions with minimized communication costs. We demonstrate that our algorithm adapts to different flow behaviors in large-scale fluid dynamics, ocean, and weather simulation data. Our algorithm improves parallel particle tracing performance in terms of parallel efficiency, load balance, and costs of I/O and communication for evaluations with up to 16,384 processors.

Distributed and parallel particle tracing↗

NUMERICAL SIMULATION OF THREE-DIMENSIONAL ASYMMETRIC RECONNECTION AND APPLICATION TO A PHYSICAL MECHANISM OF PENUMBRAL MICROJETS

Three-dimensional (3D) component reconnection, where reconnecting field lines are not perfectly anti-parallel, is studied with a 3D magnetohydrodynamic simulation. In particular, we consider the asymmetry of the field strength of the reconnecting field lines. As the asymmetry increases, the generated reconnection jet tends to be parallel to stronger field lines. This is because weaker field lines have higher gas pressure in the initial equilibrium, and hence the gas pressure gradient along the reconnected field lines is generated, which accelerates the field-aligned plasma flow. This mechanism may explain penumbral microjets and other types of jets that are parallel to magnetic field lines.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A general CFD framework for fault-resilient simulations based on multi-resolution information fusion

We develop a general CFD framework for multi-resolution simulations to target multiscale problems but also resilience in exascale simulations, where faulty processors may lead to gappy, in space-time, simulated fields. We combine approximation theory and domain decomposition together with statistical learning techniques, e.g. coKriging, to estimate boundary conditions and minimize communications by performing independent parallel runs. To demonstrate this new simulation approach, we consider two benchmark problems. First, we solve the heat equation (a) on a small number of spatial “patches” distributed across the domain, simulated by finite differences at fine resolution and (b) on the entire domain simulated at very low resolution, thus fusing multi-resolution models to obtain the final answer. Second, we simulate the flow in a lid-driven cavity in an analogous fashion, by fusing finite difference solutions obtained with fine and low resolution assuming gappy data sets. We investigate the influence of various parameters for this framework, including the correlation kernel, the size of a buffer employed in estimating boundary conditions, the coarseness of the resolution of auxiliary data, and the communication frequency across different patches in fusing the information at different resolution levels. In addition to its robustness and resilience, the new framework can be employed to generalize previous multiscale approaches involving heterogeneous discretizations or even fundamentally different flow descriptions, e.g. in continuum-atomistic simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spatial decomposition of structured grids for nuclear reactor simulations

Spatial decomposition methods based on graph partitioning are developed and implemented in the high fidelity neutron transport code MPACT. These graph-based spatial decomposition methods are more general than previous decomposition methods and typically provide better load balance and reduced runtimes due to their improved parallel efficiency. Correlations are drawn between simulation runtime and the balance of the partition for 2D simulations. Comparisons are made using partition balance metrics for different decomposition schemes in 2D and 3D simulations. Finally, for typical ranges of subdomains, graph-based partitioning methods offer significant reductions to runtimes. However, for highly decomposed problems, these graph-based methods may decrease convergence rates, thus reducing parallel efficiency compared to older methods.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Mixed augmented variational formulation (MAVF) for lower hybrid full-wave calculations

In the continuation of the works led in cylindrical geometry, a full toroidal description for an arbitrary poloidal cross-section of the plasma has been developed. For simulation purpose a mixed augmented variational formulation (MAVF), which is particularly well suited for solving Maxwell equations, is considered. The discretization of the MAVF is carried out using Taylor-Hood P2-iso-P1 finite elements. This formulation provide a natural implementation for parallel processing, a particularly important aspect when simulations for plasmas of large size must be considered. Details on the specific application of the MAVF to the LH problem are presented, as well as the structure of the corresponding matrices. A first application to a realistic small tokamak configuration is considered.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

GPU simulation of nonlinear propagation of dual band ultrasound pulse complexes

In a new method of ultrasound imaging, called SURF imaging, dual band pulse complexes composed of overlapping low frequency (LF) and high frequency (HF) pulses are transmitted, where the frequency ratio LF:HF ∼ 1 : 20, and the relative bandwidth of both pulses are ∼ 50 − 70%. The LF pulse length is hence ∼ 20 times the HF pulse length. The LF pulse is used to nonlinearly manipulate the material elasticity observed by the co-propagating HF pulse. This produces nonlinear interaction effects that give more information on the propagation of the pulse complex. Due to the large difference in frequency and pulse length between the LF and the HF pulses, we have developed a dual level simulation where the LF pulse propagation is first simulated independent of the HF pulse, using a temporal sampling frequency matched to the LF pulse. A separate equation for the HF pulse is developed, where the the presimulated LF pulse modifies the propagation velocity. The equations are adapted to parallel processing in a GPU, where nonlinear simulations of a typical HF beam of 10 MHz down to 40 mm is done in ∼ 2 secs in a standard GPU. This simulation is hence very useful for studying the manipulation effect of the LF pulse on the HF pulse.

42 ENGINEERING↗

Reduced model simulations of the scrape-off-layer heat-flux width and comparison with experiment

Reduced model simulations of turbulence in the edge and scrape-off-layer (SOL) region of a spherical torus or tokamak plasma are employed to address the physics of the scrape-off-layer heat flux width. The simulation model is an electrostatic two-dimensional fluid turbulence model, applied in the plane perpendicular to the magnetic field at the outboard midplane of the torus. The model contains curvature-driven-interchange modes, sheath losses, and both perpendicular turbulent diffusive and convective (blob) transport. These transport processes compete with classical parallel transport to set the SOL width. Midplane SOL profiles of density, temperature and parallel heat flux are obtained from the simulation and compared with experimental results from the National Spherical Torus Experiment (NSTX) to study the scaling of the heat flux width with power and plasma current. It is concluded that midplane turbulence is the main contributor to the SOL heat flux width for the low power H-mode discharges studied, while additional physics is required to explain the plasma current scaling of the SOL heat flux width observed experimentally in higher power discharges. Intermittent separatrix spanning convective cells are found to be the main mechanism that sets the near-SOL width in the simulations. The roles of sheared flows and blob trapping vs. emission are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Self-optimized construction of transition rate matrices from accelerated atomistic simulations with Bayesian uncertainty quantification

Here, a massively parallel method to build large transition rate matrices from temperature-accelerated molecular dynamics trajectories is presented. Bayesian Markov model analysis is used to estimate the expected residence time in the known state space, providing crucial uncertainty quantification for higher-scale simulation schemes such as kinetic Monte Carlo or cluster dynamics. The estimators are additionally used to optimize where exploration is performed and the degree of temperature acceleration on the fly, giving an autonomous, optimal procedure to explore the state space of complex systems. The method is tested against exactly solvable models and used to explore the dynamics of C15 interstitial defects in iron. Our uncertainty quantification scheme allows for accurate modeling of the evolution of these defects over timescales of several seconds.

36 MATERIALS SCIENCE↗

Verification and source-position error analysis of film reconstruction techniques used in the brachytherapy planning systems

A method was presented that employs standard linac QA tools to verify the accuracy of film reconstruction algorithms used in the brachytherapy planning system. Verification of reconstruction techniques is important as suggested in the ESTRO booklet 8: ''The institution should verify the full process of any reconstruction technique employed clinically.'' Error modeling was also performed to analyze seed-position errors. The ''isocentric beam checker'' device was used in this work. It has a two-dimensional array of steel balls embedded on its surface. The checker was placed on the simulator couch with its center ball coincident with the simulator isocenter, and one axis of its cross marks parallel to the axis of gantry rotation. The gantry of the simulator was rotated to make the checker behave like a three-dimensional array of balls. Three algorithms used in the ABACUS treatment planning system: orthogonal film, 2-films-with-variable-angle, and 3-films-with-variable-angle were tested. After exposing and digitizing the films, the position of each steel ball on the checker was reconstructed and compared to its true position, which can be accurately calculated. The results showed that the error is dependent on the object-isocenter distance, but not the magnification of the object. The averaged errors were less than 1 mm within the tolerance level defined by Roueet al. [''The EQUAL-ESTRO audit on geometric reconstruction techniques in brachytherapy,'' Radiother. Oncol. 78, 78-83 (2006)]. However, according to the error modeling, the theoretical error would be greater than 2 mm if the objects were located more than 20 cm away from the isocenter with a 0.5 deg. reading error of the gantry and collimator angles. Thus, in addition to carefully performing the QA of the gantry and collimator angle indicators, it is suggested that the patient, together with the applicators or seeds inside, should be placed close to the isocenter as much as possible. This method could be used to test the reconstruction techniques of any planning system, and the most suitable one can be chosen for clinical use.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Role of Reynolds stress and toroidal momentum transport in the dynamics of internal transport barriers

We study the interplay between intrinsic rotation and internal transport barrier (ITB) dynamics through the dynamic change of the parallel Reynolds stress. Global flux-driven gyrofluid simulations are used for this study. In particular, we investigate the role of parallel velocity gradient instability (PVGI) in the ITB formation and the back transition. It is found that the excitation of PVGI is followed by a change in the Reynolds stress which drives a momentum redistribution. This significantly influences E Multiplication-Sign B shear evolution and subsequent ITB dynamics. Nonlocal interactions among fluctuations are also observed during the PVGI excitation, resulting in turbulence suppression at the ITB.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discrete event performance prediction of speculatively parallel temperature-accelerated dynamics

Due to its unrivaled ability to predict the dynamical evolution of interacting atoms, molecular dynamics (MD) is a widely used computational method in theoretical chemistry, physics, biology, and engineering. Despite its success, MD is only capable of modeling time scales within several orders of magnitude of thermal vibrations, leaving out many important phenomena that occur at slower rates. The Temperature Accelerated Dynamics (TAD) method overcomes this limitation by thermally accelerating the state-to-state evolution captured by MD. Due to the algorithmically complex nature of the serial TAD procedure, implementations have yet to improve performance by parallelizing the concurrent exploration of multiple states. Here we utilize a discrete event-based application simulator to introduce and explore a new Speculatively Parallel TAD (SpecTAD) method. We investigate the SpecTAD algorithm, without a full-scale implementation, by constructing an application simulator proxy (SpecTADSim). Finally, following this method, we discover that a nontrivial relationship exists between the optimal SpecTAD parameter set and the number of CPU cores available at run-time. Furthermore, we find that a majority of the available SpecTAD boost can be achieved within an existing TAD application using relatively simple algorithm modifications.

97 MATHEMATICS AND COMPUTING↗

Proper orthogonal decomposition analysis of parallel twin jets measured using particle image velocimetry - 18685

The mixing of turbulent jets has been found in several locations of High Temperature Gas-cooled Reactors (HTGRs) including upper and lower plenums, where jets impinge into open space from coolant channels. In the present work, a parallel twin jets experimental facility was used to generate velocity field of mixing jets by means of Particle Image Velocimetry (PIV), which can be eventually used for validation of Computational Fluid Dynamics (CFD) simulations. The facility has two fixed parallel rectangular jet nozzles (5.8 mm in width, 87.8 mm in length) submerged in the middle of the water tank, which allows an assumption of free jet mixing. In order to compare the experimental data produced to existing data, Re = 4000 {approx} 5000 at the jet outlet was selected. In the past, several statistically meaningful data have been reported using Laser Doppler Velocimetry (LDV) and Hot Wire Anemometer (HWA), which can support Reynolds Averaged Navier-Stokes turbulent models. However, recent CFD simulations using Large Eddy Simulation (LES) require high resolution experimental data in time and space. Thus, in this study, in addition to statistically enough number of data sets for RANS models validation, high temporal and spatial resolution data were collected for the validation of LES calculations. In order to study the turbulent structure Reynolds decomposition and Proper Orthogonal Decomposition (POD) were applied to the data obtained. These decomposition analyses visualized multi-scale vortices and the transportation of eddies. In terms of twin jets structure, the present experimental data showed good agreement with other techniques for the important characteristic parameters including the length of the converging region and the location of the merging point. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Calibration of the E3SM Land Model Using Surrogate‐Based Global Optimization

Abstract Calibration of the Energy Exascale Earth System Model (E3SM), land model (ELMv0) is challenging because of its model complexity, strong model nonlinearity, and significant computational requirements. Therefore, only a limited number of simulations can be allowed in any attempt to find a near‐optimal solution within an affordable time. The goal of this study is to calibrate some of the ELMv0 parameters to improve model projection of carbon fluxes. We propose a computationally efficient global optimization procedure using sparse‐grid based surrogates. We first use advanced sparse grid (SG) interpolation to construct a surrogate system of the ELMv0, and then calibrate the surrogate model in the optimization process. As the surrogate model is a polynomial whose evaluation is fast, it can be efficiently evaluated a sufficiently large number of times in the optimization, which facilitates the global search. We calibrate eight parameters against five years of net ecosystem exchange, total leaf area index, and latent heat flux data from the U.S. Missouri Ozark flux tower. The calibrated model is then used for predicting the three variables in the following 4 years. The results indicate that an accurate surrogate model can be created for the ELMv0 with a relatively small number of SG points, i.e., a few ELMv0 simulations that can be fully parallel. And, the application of the optimized parameters leads to a better model performance and a higher predictive capability than the default parameter values in the ELMv0.

54 ENVIRONMENTAL SCIENCES↗

Incompact3d: A powerful tool to tackle turbulence problems with up to O(105) computational cores

Understanding the nature of complex turbulent flows remains one of the most challenging problems in classical physics. Significant progress has been made recently using high performance computing, and computational fluid dynamics is now a credible alternative to experiments and theories in order to understand the rich physics of turbulence. In this paper, we present an efficient numerical tool called Incompact3d that can be coupled with massive parallel platforms in order to simulate turbulence problems with as much complexity as possible, using up to O(105) computational cores by means of direct numerical simulation (DNS). DNS is the simplest approach conceptually to investigate turbulence, featuring the highest temporal and spatial accuracy and it requires extraordinary powerful resources. This paper is an extension of Laizet et al.(Comput. Fluids 2010; 39(3):471–484) where the authors proposed a strategy to run DNS with up to 1024 computational cores. Copyright © 2010 John Wiley & Sons, Ltd.

Computer Science↗