Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network 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 109 records · Page 6

Topology-Aware Performance Optimization and Modeling of Adaptive Mesh Refinement Codes for Exascale

Here, we introduce a topology-aware performance optimization and modeling workflow for AMR simulation that includes two new modeling tools, ProgrAMR and Mota Mapper, which interface with the BoxLib AMR framework and the SSTmacro network simulator. ProgrAMR allows us to generate and model the execution of task dependency graphs from high-level specifications of AMR-based applications, which we demonstrate by analyzing two example AMR-based multigrid solvers with varying degrees of asynchrony. Mota Mapper generates multiobjective, network topology-aware box mappings, which we apply to optimize the data layout for the example multigrid solvers. While the sensitivity of these solvers to layout and execution strategy appears to be modest for balanced scenarios, the impact of better mapping algorithms can be significant when performance is highly constrained by network hop latency. Furthermore, we show that network latency in the multigrid bottom solve is the main contributing factor preventing good scaling on exascale-class machines.

97 MATHEMATICS AND COMPUTING↗

High Fidelity Simulations of Large-scale Wireless Networks (Part II - FY2017)

The ability to simulate wireless networks at large-scale for meaningful amount of time is considerably lacking in today's network simulators. For this reason, many published work in this area often limit their simulation studies to less than a 1,000 nodes and either over-simplify channel characteristics or perform studies over time scales much less than a day. In this report, we show that one can overcome these limitations and study problems of high practical consequence. This work presents two key contributions to high fidelity simulation of large-scale wireless networks: (a) wireless simulations can be sped up by more than 100X in runtime using ideas from spatial indexing algorithms and clipping of negligible signals and (b) clustering and task-oriented programming paradigm can be used to reduce inter- process communication in a parallel discrete event simulation resulting in a better scaling efficiency.

97 MATHEMATICS AND COMPUTING↗

Self-consistent core-pedestal transport simulations with neural network accelerated models

Fusion whole device modeling simulations require comprehensive models that are simultaneously physically accurate, fast, robust, and predictive. In this paper we describe the development of two neural-network (NN) based models as a means to perform a snon-linear multivariate regression of theory-based models for the core turbulent transport fluxes, and the pedestal structure. Specifically, we find that a NN-based approach can be used to consistently reproduce the results of the TGLF and EPED1 theory-based models over a broad range of plasma regimes, and with a computational speedup of several orders of magnitudes. These models are then integrated into a predictive workflow that allows prediction with self-consistent core-pedestal coupling of the kinetic profiles within the last closed flux surface of the plasma. Finally, the NN paradigm is capable of breaking the speed-accuracy trade-off that is expected of traditional numerical physics models, and can provide the missing link towards self-consistent coupled core-pedestal whole device modeling simulations that are physically accurate and yet take only seconds to run.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Trans-oceanic Remote Power Hardware-in-the-Loop: Multi-site Hardware, Integrated Controller, and Electric Network Co-simulation

Electric system operators are increasingly concerned with the potential system-wide impacts of the large-scale integration of distributed energy resources (DERs) including voltage control, protection coordination, and equipment wear. This prompts a need for new simulation techniques that can simultaneously capture all the components of these large integrated smart grid systems. This paper describes a novel platform that combines three emerging research areas: power systems co-simulation, power hardware in the loop (PHIL) simulation, and lab-lab links. The platform is distributed, real-time capable, allows for easy internet-based connection from geographically-dispersed participants, and is software platform agnostic. We demonstrate its utility by studying real-time PHIL co-simulation of coordinated solar PV firming control of two inverters connected in multiple electric distribution network models, prototypical of U.S. and Australian systems. Here, the novel trans-pacific closed-loop system simulation was conducted in real-time using a power network simulator and physical PV/battery inverter at power at the National Renewable Energy Laboratory in Golden, CO, USA and a physical PV inverter at power at the Commonwealth Scientific and Industrial Research Organisation's Energy Centre in Newcastle, NSW, Australia. This capability enables smart grid researchers throughout the world to leverage their unique simulation capabilities for multi-site collaborations that can effectively simulate and validate emerging smart grid technology solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Nuclear fission reaction simulations in compact stars

Type-Ia supernovas are powerful stellar explosions that provide important distance indicators in cosmology. Recently, we proposed a new Type-Ia supernova mechanism that involves a nuclear fission chain-reaction in an isolated white dwarf [Phys. Rev. Lett. 126, 131101 (2021)]. Here, in this work, we perform novel reaction network simulations of the actinide-rich first solids in a cooling white dwarf. The network includes neutron-capture and fission reactions on a range of U and Th isotopes with various possible values for 235 U enrichment. We find, for modest 235 U enrichments, neutron capture on 238 U and 232 Th can breed additional fissile nuclei so that a significant fraction of all U and Th nuclei may fission during the chain reaction. Finally, we compute the energy release from the fission chain reaction for various uranium enrichments; a novel result that is a necessary input for thermal diffusion simulations of carbon ignition.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Spread Spectrum Time Domain Reflectometry (SSTDR) Digital Twin Simulation of Photovoltaic Systems for Fault Detection and Location

Utilizing spread spectrum time domain reflectometry (SSTDR) to detect, locate, and characterize faults in photovoltaic (PV) systems is examined in this paper. We present a method to obtain the model parameters that are needed to produce digital twin SSTDR responses for PV systems. The digital twin SSTDR responses could be used to predict faults within the PV systems. Here, the model parameters are the reflection and transmission coefficients at each impedance discontinuity in the PV system along with the propagation coefficients across each PV cable segment. We obtain model parameter by applying inverse modeling techniques to experimental SSTDR data associated with PV systems. Our model parameters can be used in any digital twin simulation method for modeling reflectometry in frequency-dependent and complex loads. For validation, we used the model parameters in a graph network simulation engine and adapted it to be used for SSTDR digital twin simulations in PV systems. We produced simulations for 0 to 10 PV modules connected in series. We also simulated SSTDR responses for open circuit disconnections in a PV setup containing 10 PV modules in series. Results show that all but one simulated disconnect locations match experimental disconnection locations of the same setup with an error of less than 5%.

14 SOLAR ENERGY↗

CEEP (Cyber-Energy Emulation Platform) [SWR-20-102]

NREL's Cyber-Energy Emulation Platform (CEEP) provides the capability to realize cyber-energy security and resilience through automation and orchestration of virtualized systems and software defined networks for the electric grid. CEEP enables testing and validation of grid-security and -control methodologies as the grid evolves to include smart technologies/systems, such as virtualization and containerization of grid components, software defined networking, simulation and co-simulation frameworks, and hardware in the loop. CEEP is a modular system that can be distributed and deployed across different hardware infrastructure sizes and network architectures. For example, CEEP can visualize, emulate, and/or coordinate the Smart-Grid Network Visualization, Intrusion Detection, and Network Healing system. Using CEEP, intrusion-detection and network-self-healing solutions can be deployed at grid control centers, within secure private clouds, and in cyber-energy appliances.

Vaughan, Evan↗

Cyber Energy Emulation Platform (CEEP) [SWR-20-102]

NREL's Cyber-Energy Emulation Platform (CEEP) provides the capability to realize cyber-energy security and resilience through automation and orchestration of virtualized systems and software defined networks for the electric grid. CEEP enables testing and validation of grid-security and -control methodologies as the grid evolves to include smart technologies/systems, such as virtualization and containerization of grid components, software defined networking, simulation and co-simulation frameworks, and hardware in the loop. CEEP is a modular system that can be distributed and deployed across different hardware infrastructure sizes and network architectures. For example, CEEP can visualize, emulate, and/or coordinate the Smart-Grid Network Visualization, Intrusion Detection, and Network Healing system. Using CEEP, intrusion-detection and network-self-healing solutions can be deployed at grid control centers, within secure private clouds, and in cyber-energy appliances.

Rivera, Joshua↗

Quantitative Assessment of Transportation Network Vulnerability with Dynamic Traffic Simulation Methods

Transportation networks are critical to the social and economic function of nations. Given the continuing increase in the populations of cities throughout the world, the criticality of transportation infrastructure is expected to increase. Thus, it is ever more important to mitigate congestion as well as to assess the impact disruptions would have on individuals who depend on transportation for their work and livelihood. Moreover, several government organizations are responsible for ensuring transportation networks are available despite the constant threat of natural disasters and terrorist activities. Most of the previous transportation network vulnerability research has been performed in the context of static traffic models, many of which are formulated as traditional optimization problems. However, transportation networks are dynamic because their usage varies over time. Thus, more appropriate methods to characterize the vulnerability of transportation networks should consider their dynamic properties. This paper presents a quantitative approach to assess the vulnerability of a transportation network to disruptions with methods from traffic simulation. Our approach can prioritize the critical links over time and is generalizable to the case where both link and node disruptions are of concern. We illustrate the approach through a series of examples. Our results demonstrate that the approach provides quantitative insight into the time varying criticality of links. Such an approach could be used as the objective function of less traditional optimization methods that use simulation and other techniques to evaluate the relative utility of a particular network defense to reduce vulnerability and increase resilience.

Shekar, Venkateswaran↗

Active sampling for neural network potentials: Accelerated simulations of shear-induced deformation in Cu–Ni multilayers

Neural network potentials (NNPs) can greatly accelerate atomistic simulations relative to ab initio methods, allowing one to sample a broader range of structural outcomes and transformation pathways. In this work, we demonstrate an active sampling algorithm that trains an NNP that is able to produce microstructural evolutions with accuracy comparable to those obtained by density functional theory, exemplified during structure optimizations for a model Cu–Ni multilayer system. We then use the NNP, in conjunction with a perturbation scheme, to stochastically sample structural and energetic changes caused by shear-induced deformation, demonstrating the range of possible intermixing and vacancy migration pathways that can be obtained as a result of the speedups provided by the NNP. The code to implement our active learning strategy and NNP-driven stochastic shear simulations is openly available at https://github.com/pnnl/Active-Sampling-for-Atomistic-Potentials .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The bond rupture force for sulfur chains calculated from quantum chemistry simulations and its relevance to the tensile strength of vulcanized rubber

From quantum chemistry simulations using density functional theory, we obtain the total electronic energy of an eight-atom sulfur chain as its end-to-end distance is extended until S–S bond rupture occurs. We find that a sulfur chain can be extended by about 40% beyond its nominally straight conformation, where it experiences rupture at an end-to-end tension of about 1.5 nN. Using this rupture force as the chain failure limit in an explicit polymer network simulation model (EPnet), we predict the tensile failure stress for sulfur crosslinked (vulcanized) natural rubber. Furthermore, quantitative agreement with published experimental data for the failure stress is obtained in these simulations if we assume that only about 30% of the sulfur chains produce viable network crosslinks. Surprisingly, we also find that the failure stress of a rubber network does not scale linearly with the chain failure force limit.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Improved pore network models to simulate single-phase flow in porous media by coupling with lattice Boltzmann method

In this paper, different pore network models to simulate single-phase flow in porous media are built and their accuracy is evaluated. In addition to the conventional pore network model (CPNM) which consists of regular pore bodies and throat bonds, three improved pore network models (IPNMs) are developed allowing to better describing the real pore and throat geometry. The first improved pore network model (IPNM1) replaces the regular throat bond with a throat bond showing the real throat cross section. The second improvement (IPNM2) uses a series of sub-throat bonds with varying cross sections to better describe the real throat geometry, which is firstly proposed in this paper. The third model (IPNM3) extracts the real pore-throat-pore geometry without simplification. The conductance of fluid flow through these more realistic throat bonds is calculated by the lattice Boltzmann method (LBM). The accuracy and computational efficiency of the different pore network models are evaluated taking the LBM simulation over the whole porous medium as reference solution. The global permeability and detailed pressure distributions in the pores for the different pore network models are validated. The results show that the accuracy of the pore network model increases from CPNM to IPNM3, but at the expense of increasing computational cost. This study suggests that IPNM3 can replace a whole-domain LBM simulation with similar accuracy but much lower computational cost. As a first-order approximation the newly proposed IPNM2 is suggested as good compromise between accuracy and computational cost.

42 ENGINEERING↗

Reactive fluid flow in CO 2 storage reservoirs: A 2‐D pore network model study

Abstract Water acidifies in the presence of CO 2 and prompts mineral dissolution. A 2‐D pore network model scheme is developed to investigate reactive fluid flow in CO 2 storage reservoirs during injection when advective transport prevails. Mineral dissolution satisfies kinetic rate laws and continues until thermodynamic equilibrium is reached. In advection‐dominant regimes, network simulation results show that species concentration, tube enlargement and flow rate can be summarized in terms of the dimensionless Damköhler number Da which is the ratio between advection time along a pore and the reaction time. Reservoirs will tend to experience localized enlargement near injection wells (before water drying) and compact dissolution in the far‐field. The Damköhler number couples with initial pore‐size variability to distort the relationship between mean tube diameter and either local or network‐average flow rates. Both the Damköhler number and pore‐size variability should be considered in field‐scale numerical simulators.

Kim, Seunghee↗

From IMT Device Measurements to Network-Level Consequences: When Learning Suppresses Beyond-LIF Neuron Dynamics

Emerging neuromorphic devices such as insulator--metal transition (IMT) devices exhibit complex temporal dynamics, including slow internal state memory, hysteresis, and burst-like firing, which are poorly captured by conventional leaky integrate-and-fire (LIF) neurons. However, it remains unclear when such dynamics influence learning and inference at the network level, particularly under commonly used unsupervised plasticity rules. We present a controlled, full-stack co-design study spanning experimental characterization of individual IMT devices, compact neuron model development, and large-scale spiking network simulations with identical architectures and learning rules. Rather than optimizing benchmark accuracy, our goal is to diagnose when neuron-level dynamics survive learning and competition, and when they are suppressed, to inform the co-design of devices, networks, and learning rules that can exploit beyond-LIF complexity.

42 ENGINEERING↗

A statistical and simulation-informed model for estimating permeability from pore size distribution in saturated geomaterials

Accurate permeability estimation is essential across subsurface engineering applications but remains challenging due to the complex pore structures of natural geomaterials. Traditional empirical methods and simplified theoretical models often inadequately capture the role of pore size distribution and connectivity. Here, this study develops a statistical and simulation-informed permeability model that collapses pore-scale complexity into a compact scaling of the form k = αϕμ d 2 , where ϕ is porosity, μ d is mean pore size, and α is a weakly varying coefficient. By combining pore network simulations with statistical analysis of unimodal and bimodal pore size distributions, we identify three key findings: (i) permeability is much more sensitive to mean pore size than to porosity; (ii) across extensive datasets, the ratio σ d /μ d (standard deviation to mean) clusters around a characteristic value ∼0.4, allowing the effects of the full pore size distribution to be represented by μ d and a narrowly varying α ≈ 0.05; and (iii) for bimodal systems, there exists a critical fraction of small pores ∼0.78 above which flow becomes small-pore dominated, enabling the definition of an effective flow-controlling pore population and facilitating simplified permeability estimation for such systems. The resulting model, which requires only porosity and a representative mean pore size as inputs, is validated against comprehensive experimental datasets (>1700 samples) spanning diverse soils and rocks and achieves good predictive accuracy. Overall, this work provides a physically grounded yet practically simple permeability estimator suitable for subsurface engineering, environmental protection, and resource management applications.

Permeability↗

Spin-orbit torque induced spike-timing dependent plasticity

Nanoelectronic devices that mimic the functionality of synapses are a crucial requirement for performing cortical simulations of the brain. In this work, we propose a ferromagnet-heavy metal heterostructure that employs spin-orbit torque to implement spike-timing dependent plasticity. The proposed device offers the advantage of decoupled spike transmission and programming current paths, thereby leading to reliable operation during online learning. Possible arrangement of such devices in a crosspoint architecture can pave the way for ultra-dense neural networks. Simulation studies indicate that the device has the potential of achieving pico-Joule level energy consumption (maximum 2 pJ per synaptic event) which is comparable to the energy consumption for synaptic events in biological synapses.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Tree tensor network approach to simulating Shor's algorithm

Constructively simulating quantum systems furthers our understanding of qualitative and quantitative features which may be analytically intractable. In this paper, we directly simulate and explore the entanglement structure present in the paradigmatic example for exponential quantum speedups: Shor's algorithm. To perform our simulation, we construct a dynamic tree tensor network which manifestly captures two salient circuit features for modular exponentiation. These are the natural two-register bipartition and the invariance of entanglement with respect to permutations of the top-register qubits. Our construction help identify the entanglement entropy properties, which we summarize by a scaling relation. Further, the tree network is efficiently projected onto a matrix product state from which we efficiently execute the quantum Fourier transform. In conclusion, future simulation of quantum information states with tensor networks exploiting circuit symmetries is discussed.

97 MATHEMATICS AND COMPUTING↗

Hyperparameter Optimization and Feature Inclusion in Graph Neural Networks for Spiking Implementation

Graph convolutional networks leverage both graph structures and features on nodes and edges for improved learning performance in comparison with classical machine learning approaches. Spiking neuromorphic computers natively implement network-like computation and have been shown to be successful at implementing graph learning without features. Incorporating graph features brings the challenge of efficient feature representation and balancing the contribution of topology and features in learning. In this work, we present our design of a simulated network of spiking neurons to perform semi-supervised learning on graph data using both the graph structure and the node features. We explore various design choices, present preliminary results, and discuss the opportunities for using neuromorphic computers for this task in the future.

Cong, Guojing↗