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 271 records · Page 15

Thermoelectric properties of semiconductor nanowire networks

To examine the thermoelectric (TE) properties of a semiconductor nanowire (NW) network, we propose a theoretical approach mapping the TE network on a two-port network. In contrast to a conventional single-port (i.e., resistor)network model, our model allows for large scale calculations showing convergence of TE figure of merit, ZT, with an increasing number of junctions. Using this model, numerical simulations are performed for the Bi 2 Te 3 branched nanowire (BNW) and Cayley tree NW (CTNW) network. We find that the phonon scattering at the network junctions plays a dominant role in enhancing the network ZT. Specifically, disordered BNW and CTNW demonstrate an order of magnitude higher ZT enhancement compared to their ordered counterparts. Formation of preferential TE pathways in CTNW makes the network effectively behave as its BNW counterpart. In conclusion, we provide formalism for simulating large scale nanowire networks hinged upon experimentally measurable TE parameters of a single T-junction.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

PreDatA - Preparatory Data Analytics on Peta-Scale Machines

Peta-scale scientific applications running on High End Computing (HEC) platforms can generate large volumes of data. For high performance storage and in order to be useful to science end users, such data must be organized in its layout, indexed, sorted, and otherwise manipulated for subsequent data presentation, visualization, and detailed analysis. In addition, scientists desire to gain insights into selected data characteristics 'hidden' or 'latent' in the massive datasets while data is being produced by simulations. PreDatA, short for Preparatory Data Analytics, is an approach for preparing and characterizing data while it is being produced by the large scale simulations running on peta-scale machines. By dedicating additional compute nodes on the peta-scale machine as staging nodes and staging simulation's output data through these nodes, PreDatA can exploit their computational power to perform selected data manipulations with lower latency than attainable by first moving data into file systems and storage. Such in-transit manipulations are supported by the PreDatA middleware through RDMA-based data movement to reduce write latency, application-specific operations on streaming data that are able to discover latent data characteristics, and appropriate data reorganization and metadata annotation to speed up subsequent data access. As a result, PreDatA enhances the scalability and flexibility of current I/O stack on HEC platforms and is useful for data pre-processing, runtime data analysis and inspection, as well as for data exchange between concurrently running simulation models. Performance evaluations with several production peta-scale applications on Oak Ridge National Laboratory's Leadership Computing Facility demonstrate the feasibility and advantages of the PreDatA approach.

99 GENERAL AND MISCELLANEOUS↗

Reactive transport of uranium in fractured crystalline rock: Upscaling in time and distance

In this study, batch adsorption and breakthrough column experiments were conducted to evaluate uranium transport through altered material that fills fractures in a granite rock system at the Grimsel Test Site in Switzerland at pH 6.9 and 7.9. The role of adsorption and desorption kinetics was evaluated with reactive transport modeling by comparing one-, two-, and three-site models. Emphasis was placed on describing long desorption tails that are important for upscaling in time and distance. The effect of increasing pH in injection solutions was also evaluated. For pH 6.9, a three-site model with forward rate constants between 0.07 and 0.8 ml g –1 h –1 , reverse rate constants between 0.001 and 0.06 h –1 , and site densities of 1.3, 0.104, and 0.026 μmol g –1 for ‘weak/fast’, ‘strong/slow’, and ‘very strong/very slow’ sites provided the best fits. For pH 7.9, a three-site model with forward rate constants between 0.05 and 0.8 mL g –1 h –1 , reverse rate constants between 0.001 and 0.6 h –1 , and site densities of 1.3, 0.039, and 0.013 μmol g –1 for a ‘weak/fast’, ‘strong/slow’, and ‘very strong/very slow’ sites provided the best fits. Column retardation coefficients (R d ) were 80 for pH 6.9 and 10.3 for pH 7.9. Model parameters determined from the batch and column experiments were used in 50 year large-scale simulations for continuous and pulse injections and indicated that a three-site model is necessary at pH 6.9, although a K d -type equilibrium partition model with one-site was adequate for large scale predictions at pH 7.9. Batch experiments were useful for predicting early breakthrough times in the columns while column experiments helped differentiate the relative importance of sorption sites and desorption rate constants on transport.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Understanding dark matter with Fermi and the CLUES numerical simulation

N body numerical simulations of the Universe are a fundamental tool for the study of dark matter. Starting from a large scale simulation, we have performed two resimulations of a Local Group-like region with a higher resolution. In one of them, baryons have been included. This allows us to qualitatively and quantitatively study the effect of baryons in the distribution of dark matter. In this work, we present some results of our analysis of these simulations, which is aimed in particular to determine the effect of baryons on dark matter detectability by the Fermi Gamma Ray Telescope (FGST).

79 ASTRONOMY AND ASTROPHYSICS↗

Petascale Application of a Coupled CPU-GPU Algorithm for Simulation and Analysis of Multiphase Flow Solutions in Porous Medium Systems, In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium

Large-scale simulation can provide a wide range of information needed to develop and validate theoretical models for multiphase flow in porous medium systems. In this paper, we consider a coupled solution in which a multiphase flow simulator is coupled to an analysis approach used to extract the interfacial geometries as the flow evolves. This has been implemented using MPI to target heterogeneous nodes equipped with GPUs. The GPUs evolve the multiphase flow solution using the lattice Boltzmann method while the CPUs compute up scaled measures of the morphology and topology of the phase distributions and their rate of evolution. Our approach is demonstrated to scale to 4,096 GPUs and 65,536 CPU cores to achieve a maximum performance of 244,754 million-lattice-node updates per second (MLUPS) in double precision execution on Titan. In turn, this approach increases the size of systems that can be considered by an order of magnitude compared with previous work and enables detailed in situ tracking of averaged flow quantities at temporal resolutions that were previously impossible. Furthermore, it virtually eliminates the need for post-processing and intensive I/O and mitigates the potential loss of data associated with node failures.

Computer Science↗

Interface tracking simulations of bubbly flows in PWR relevant geometries

[en] Highlights: • Simulations were performed for turbulent bubbly flows in PWR subchannel geometry. • Liquid turbulence is fully resolved by direct numerical simulation approach. • Bubble behavior is captured using level-set interface tracking method. • Time-averaged single- and two-phase turbulent flow statistical quantities are obtained. - Abstract: The advances in high performance computing (HPC) have allowed direct numerical simulation (DNS) approach coupled with interface tracking methods (ITM) to perform high fidelity simulations of turbulent bubbly flows in various complex geometries. In this work, we have chosen the geometry of the pressurized water reactor (PWR) core subchannel to perform a set of interface tracking simulations (ITS) with fully resolved liquid turbulence. The presented research utilizes a massively parallel finite-element based code, PHASTA, for the subchannel geometry simulations of bubbly flow turbulence. The main objective for this research is to demonstrate the ITS capabilities in gaining new insight into bubble/turbulence interactions and assisting the development of improved closure laws for multiphase computational fluid dynamics (M-CFD). Both single- and two-phase turbulent flows were studied within a single PWR subchannel. The analysis of numerical results includes the mean gas and liquid velocity profiles, void fraction distribution and turbulent kinetic energy profiles. Two sets of flow rates and bubble sizes were used in the simulations. The chosen flow rates corresponded to the Reynolds numbers of 29,079 and 80,775 based on channel hydraulic diameter (D_h) and mean velocity. The finite element unstructured grids utilized for these simulations include 53.8 million and 1.11 billion elements, respectively. This has allowed to fully resolve all the turbulence scales and the deformable interfaces of individual bubbles. For the two-phase flow simulations, a 1% bubble volume fraction was used which resulted in 17 bubbles in the smaller case and 262 bubbles in the larger case. In the larger simulation case the size of the resolved bubbles is 0.65 mm in diameter, and the bulk mesh cell size is about 30 microns. Those large-scale simulations provide new level of details previously unavailable and were enabled by the excellent scaling performance of our two-phase flow solver and access to the state-of-the-art supercomputing resources. The presented simulations used up to 256 thousand processing threads on the IBM BG/Q supercomputer “Mira” (Argonne National Laboratory).

Nuclear Science & Technology↗

A Practical Framework for Simulating Time-Resolved Spectroscopy Based on a Real-Time Dyson Expansion

Time-resolved spectroscopy is a powerful tool for probing electron dynamics in molecules and solids, revealing transient phenomena on subfemtosecond time scales. The interpretation of experimental results is often enhanced by parallel numerical studies, which can provide insight and validation for experimental hypotheses. However, developing a theoretical framework for simulating time-resolved spectra remains a significant challenge. The most suitable approach involves the many-body nonequilibrium Green's function formalism, which accounts for crucial dynamical many-body correlations during time evolution. While these dynamical correlations are essential for observing emergent behavior in time-resolved spectra, they also render the formalism prohibitively expensive for large-scale simulations. Substantial effort has been devoted to reducing this computational cost─through approximations and numerical techniques─while preserving the key dynamical correlations. The ultimate goal is to enable first-principles simulations of time-dependent systems ranging from small molecules to large, periodic, multidimensional solids. Here, in this perspective, we outline key challenges in developing practical simulations for time-resolved spectroscopy, with a particular focus on Green's function methodologies. We highlight a recent advancement toward a scalable framework: the real-time Dyson expansion (RT-DE) [Phys. Rev. Lett. 2024, 133, 226902]. We introduce the theoretical foundation of RT-DE and discuss strategies for improving scalability, which have already enabled simulations of system sizes beyond the reach of previous fully dynamical approaches. We conclude with an outlook on future directions for extending RT-DE to first-principles studies of dynamically correlated, nonequilibrium systems.

Reeves, Cian C. [Univ. of California, Santa Barbar↗

Performance analysis of a 3D unstructured mesh hydrodynamics code on multi‐core and many‐core architectures

SUMMARY Several next generation high performance computing platforms are or will be based on the so‐called many‐core architectures, which represent a significant departure from commodity multi‐core architectures. A key issue in transitioning large‐scale simulation codes from multi‐core to many‐core systems is closing the serial performance gap, that is, overcoming the large difference in single‐core performance between multi‐core and many‐core systems. In this paper, we discuss how this problem was addressed for a 3D unstructured mesh hydrodynamics code, describe how Amdahl's law can be used to estimate performance targets and guide optimization efforts, and present timing studies performed on multi‐core and many‐core platforms. Published 2014. This article is a U.S. Government work and is in the public domain in the USA.

Waltz, J.↗

Machine Learning–Based Reduce Order Crystal Plasticity Modeling for ICME Applications

Abstract Crystal plasticity simulation is a widely used technique for studying the deformation processing of polycrystalline materials. However, inclusion of crystal plasticity simulation into design paradigms such as integrated computational materials engineering (ICME) is hindered by the computational cost of large-scale simulations. In this work, we present a machine learning (ML) framework using the material information platform, Open Citrination, to develop and calibrate a reduced order crystal plasticity model for face-centered cubic (FCC) polycrystalline materials, which can be both rapidly exercised and easily inverted. The reduced order model takes crystallographic texture, constitutive model parameters, and loading condition as inputs and returns the stress-strain curve and final texture. The model can also be inverted and take a stress-strain curve, loading condition, and final texture as inputs and return the initial texture and constitutive model parameters as outputs. Principal component analysis (PCA) is used to develop an efficient description of the crystallographic texture. A viscoplastic self-consistent (VPSC) crystal plasticity solver is used to create the training data by modeling the stress-strain behavior and evolution of texture during deformation processing.

Yuan, Mengfei↗

Modeling the dynamic response of rock masses with multiple compliant fluid saturated joint sets—Part I: Mesoscale simulations

Recently a mesoscale model was developed that includes thermomechanically consistent constitutive equations with dissipation due to porous compaction, inelastic distortional deformation rate, and slipping on persistent dry joint surfaces. In this Part I of a two-part paper, we describe enhancements of the mesoscale model which include: normal compliance with hysteresis, non-persistent joints with finite area, joint sets with angular deviation, and the weakening effect of fluid pressure in the joints. Examples study the influences of these effects on average strength. These computationally expensive simulations are used to inspire functional forms in a continuum model, described in Part II, which is needed for large scale simulations of real applications.

42 ENGINEERING↗

Explicit spatial scattering for load balancing in conservatively synchronized parallel discrete-event simulations

We re-examine the problem of load balancing in conservatively synchronized parallel, discrete-event simulations executed on high-performance computing clusters, focusing on simulations where computational and messaging load tend to be spatially clustered. Such domains are frequently characterized by the presence of geographic 'hot-spots' - regions that generate significantly more simulation events than others. Examples of such domains include simulation of urban regions, transportation networks and networks where interaction between entities is often constrained by physical proximity. Noting that in conservatively synchronized parallel simulations, the speed of execution of the simulation is determined by the slowest (i.e most heavily loaded) simulation process, we study different partitioning strategies in achieving equitable processor-load distribution in domains with spatially clustered load. In particular, we study the effectiveness of partitioning via spatial scattering to achieve optimal load balance. In this partitioning technique, nearby entities are explicitly assigned to different processors, thereby scattering the load across the cluster. This is motivated by two observations, namely, (i) since load is spatially clustered, spatial scattering should, intuitively, spread the load across the compute cluster, and (ii) in parallel simulations, equitable distribution of CPU load is a greater determinant of execution speed than message passing overhead. Through large-scale simulation experiments - both of abstracted and real simulation models - we observe that scatter partitioning, even with its greatly increased messaging overhead, significantly outperforms more conventional spatial partitioning techniques that seek to reduce messaging overhead. Further, even if hot-spots change over the course of the simulation, if the underlying feature of spatial clustering is retained, load continues to be balanced with spatial scattering leading us to the observation that spatial scattering can often obviate the need for dynamic load balancing.

97 MATHEMATICS AND COMPUTING↗

Estimating computational noise.

Computational noise in deterministic simulations is as ill-defined a concept as can be found in scientific computing. When coupled with adaptive strategies, the effects of finite precision destroy smoothness of the simulation output and complicate subsequent analysis. Following the work of Hamming on roundoff errors, we present a new algorithm, ECnoise, for quantifying the noise level of a computed function. Our theoretical framework is based on stochastic noise but does not assume a specific distribution for the noise. For the deterministic simulations considered, ECnoise produces reliable results in a few function evaluations and offers new insights into building blocks of large scale simulations.

99 GENERAL AND MISCELLANEOUS↗

Decentralized Signal Processing and Distributed Control of Collaborative Autonomous Networks (17-ERD-101 LDRD Final Report)

Intelligent autonomous sensor networks, often comprised of large numbers of sensors, must be capable of jointly exploiting data collected at each agent in the network, and using that data to optimize their future actions towards multiple mission objectives. Centralized signal processing and optimization solutions process all data and determine all future actions at a single agent, and the resulting information and commands are disseminated back to the network. The communications bandwidth this requires and the single point of failure the central agent represents often make these solutions untenable for national security applications. In this project, several fundamental algorithms for solving both the decentralized signal processing and network optimization were developed, as well as simulation software to validate the results of these algorithms at scale. Specifically, novel algorithms for Bayesian decentralized estimation and decentralized detection and optimization based on the alternating direction method of multipliers (ADMM) were developed for autonomous sensor networks and published in the literature. The first large scale simulation of autonomous sensor networks (1000 agents) was conducted on this project, validating the performance of the developed algorithms. These algorithms and simulation tools are critical components of any decentralized autonomous network and have current and future national security applications, including distributed sensor networks for detection, estimation, and tracking problems, and large decentralized cyber-physical infrastructure such as the power grid.

42 ENGINEERING↗

THE EFFECT OF ABSORPTION SYSTEMS ON COSMIC REIONIZATION

We use large-scale simulations to investigate the morphology of reionization during the final, overlap phase. Our method uses an efficient three-dimensional smoothing technique that takes into account the finite mean free path due to absorption systems, {lambda}{sub abs}, by only smoothing over scales R{sub s} < {lambda}{sub abs}. The large dynamic range of our calculations is necessary to resolve the neutral patches left at the end of reionization within a representative volume; we find that simulation volumes exceeding several hundred Mpc on a side are necessary in order to properly model reionization when the neutral fraction is {approx_equal} 0.01-0.3. Our results indicate a strong dependence of percolation morphology on a large and uncertain region of model parameter space. The single most important parameter is the mean free path to absorption systems, which serve as opaque barriers to ionizing radiation. If these absorption systems were as abundant as some realistic estimates indicate, the spatial structure of the overlap phase is considerably more complex than previously predicted. In view of the lack of constraints on the mean free path at the highest redshifts, current theories that do not include absorption by Lyman-limit systems, and in particular three-dimensional simulations, may underestimate the abundance of neutral clouds at the end of reionization. This affects predictions for the 21 cm signal associated with reionization, interpretation of absorption features in quasar spectra at z {approx} 5-6, the connection between reionization and the local universe, and constraints on the patchiness and duration of reionization from temperature fluctuations measured in the cosmic microwave background arising from the kinetic Sunyaev-Zel'dovich effect.

79 ASTRONOMY AND ASTROPHYSICS↗

High Fidelity Simulations of Large-Scale Wireless Networks

The worldwide proliferation of wireless connected devices continues to accelerate. There are 10s of billions of wireless links across the planet with an additional explosion of new wireless usage anticipated as the Internet of Things develops. Wireless technologies do not only provide convenience for mobile applications, but are also extremely cost-effective to deploy. Thus, this trend towards wireless connectivity will only continue and Sandia must develop the necessary simulation technology to proactively analyze the associated emerging vulnerabilities. Wireless networks are marked by mobility and proximity-based connectivity. The de facto standard for exploratory studies of wireless networks is discrete event simulations (DES). However, the simulation of large-scale wireless networks is extremely difficult due to prohibitively large turnaround time. A path forward is to expedite simulations with parallel discrete event simulation (PDES) techniques. The mobility and distance-based connectivity associated with wireless simulations, however, typically doom PDES and fail to scale (e.g., OPNET and ns-3 simulators). We propose a PDES-based tool aimed at reducing the communication overhead between processors. The proposed solution will use light-weight processes to dynamically distribute computation workload while mitigating communication overhead associated with synchronizations. This work is vital to the analytics and validation capabilities of simulation and emulation at Sandia. We have years of experience in Sandia’s simulation and emulation projects (e.g., MINIMEGA and FIREWHEEL). Sandia’s current highly-regarded capabilities in large-scale emulations have focused on wired networks, where two assumptions prevent scalable wireless studies: (a) the connections between objects are mostly static and (b) the nodes have fixed locations.

Onunkwo, Uzoma↗

NAMD - The Engine for Large-Scale Classical MD Simulations of Biomolecular Systems Based on a Polarizable Force Field (ALCF-2 Early Science Program Technical Report)

Large-scale Molecular dynamics (MD) simulation based on atomic models provide a powerful tool to understand the structure-dynamics-function relationships of important biological systems. Recent advances in computing power, especially in supercomputer, make MD simulation more and more popular in modern scientific community. However, the power of classical MD simulation has been limited mainly by the accuracy of the potential energy function and the efficiency of the dynamic algorithm enabling the adequate configurational sampling. This Early Science Project is aimed to make MD simulation method go beyond current limit using the leadership supercomputer Blue Gene/Q Mira. To address the issue of potential energy accuracy, classical Drude oscillator is developed to take into account the electronic polarizability in molecular systems. In order to develop and test the Drude polarizable force field for biomolecules, extensive MD simulations of typical polypeptides, lipids are needed. This requires efficient dynamic sampling algorithm that allows fast sampling. The sampling issue can be addressed by using advanced strategies based on multiple copies in order to enhance the sampling efficiency of brute-force MD. One such method is called replica-exchange MD (REMD).

Roux, Benoit↗

Upscaling Methods Applied to a Fine-Scale Reservoir Model

This study was conducted as part of the Southwest Regional Partnership on Carbon Sequestration (SWP) project to evaluate how upscaling fine-scale simulation models to coarse-scale simulation models impacted the results. The focus was on the Farnsworth Unit (FWU) and its Morrow' B' Sandstone reservoir, specifically the west half of the field. Due to data limitations and the geologic characteristics of the surrounding area, the upscaling was limited to the west half of the FWU rather than a broader basinscale model. The primary aim was to explore how upscaling impacts numerical simulation models, particularly regarding CO 2 -enhanced oil recovery (EOR) and storage capacity predictions. Upscaling was necessary to reduce computational demands when transitioning from high-resolution geological models to coarser grids, as large-scale simulations with finer grids can be computationally prohibitive. This study expands on previous work by the SWP to understand how additional upscaling, applied to already fine-scale numerical simulation models, affects reservoir performance simulations (Ampomah, Balch, & Grigg, 2015). This is key to understanding how loss of resolution can affect coarsescale model results that may be used for large sensitivity analyses, uncertainty quantifications, and training data for machine learning applications.

02 PETROLEUM↗