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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Multi-Channel Large Network Simulation Including Adversarial Activity

Using network simulation to generate high fidelity networks is essential to test adversarial search problems, in addition to their benefits of privacy preservation and benchmarking purposes. Different generative models have been developed to generate single-channel, homogeneous networks that can model domains such as social networks, communication, and co-authorship. Modeling adversarial activity compounds the complexity of network simulation as it requires generating multi-channel networks simultaneously with correlated channel attributes at scale. We present a methodology along with scalable graph modeling and generation tools to produce realistic large-scale synthetic background activity graphs with embedded an adversarial activity. We present a concrete use case based on an attack scenario developed with the help of subject matter experts (SMEs). We discuss challenges in modeling integration across channels, scalability of the generative models, and integration across such models. We also discuss required aspects to simulate high fidelity multi-channel networks up-to an order of billion edges.

Network simulation, Multi-channel simulation, Adve↗
DOE OSTI2017

DYNAMIC - The Nonlinear Dynamical Network Simulator v. 0.1

The purpose of the DYNAMIC software system is to perform simulations to validate a new research concept called “Chaotic Logic” which we recently published. The problem to be solved is to simulate certain networks of nonlinearly-interacting dynamical variables, and collect statistics on their behavior, to show that they can reliably perform useful computations. The dynamical trajectories for such networks are computed by time integration of their Hamilton’s equations.

Frank, MichaelP.↗
DOE OSTI2016

Cyber-Physical Test Platform for Microgrids: Combining Hardware, Hardware-in-the-Loop, and Network-Simulator-in-the-Loop

This paper presents a cyber-physical testbed, developed to investigate the complex interactions between emerging microgrid technologies such as grid-interactive power sources, control systems, and a wide variety of communication platforms and bandwidths. The cyber-physical testbed consists of three major components for testing and validation: real time models of a distribution feeder model with microgrid assets that are integrated into the National Renewable Energy Laboratory's (NREL) power hardware-in-the-loop (PHIL) platform; real-time capable network-simulator-in-the-loop (NSIL) models; and physical hardware including inverters and a simple system controller. Several load profiles and microgrid configurations were tested to examine the effect on system performance with increasing channel delays and router processing delays in the network simulator. Testing demonstrated that the controller's ability to maintain a target grid import power band was severely diminished with increasing network delays and laid the foundation for future testing of more complex cyber-physical systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations

Abstract Large‐scale discrete fracture network (DFN) simulators are standard fare for studies involving the sub‐surface transport of particles since direct observation of real world underground fracture networks is generally infeasible. While these simulators have successfully been used in several engineering applications, estimates of output quantities of interest (QoI) — such as breakthrough time of particles reaching the edge of the system — suffer from two distinct types of uncertainty. A run of a DFN simulator requires several parameters to be set that dictate the placement and size of fractures, the density of fractures, and the overall permeability of the system; uncertainty on the proper parameters will lead to uncertainty in the QoI, called epistemic uncertainty. Furthermore, since these input settings to DFN simulators control the stochastic processes which place fractures and govern flow, understanding how this randomness affects the QoI requires several runs of the simulator at distinct random seeds. The uncertainty in the QoI attributed to different realizations (i.e., different seeds) of the same random process (i.e., identical input parameters) leads to a second type of uncertainty, called aleatoric uncertainty. In this paper, we perform a Sensitivity Analysis, which directly attributes the uncertainty observed in the QoI to the epistemic uncertainty from each input parameter and to the aleatoric uncertainty. Beyond the specific takeaways on which input variables influence uncertainty in the QoI the most, a major contribution of this paper is the introduction of a statistically rigorous workflow for characterizing the uncertainty in DFN flow simulations that exhibit heteroskedasticity.

58 GEOSCIENCES↗
DOE OSTI2018

Validating quantum-classical programming models with tensor network simulations

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force statevector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

HPC Network Simulation Tuning via Automatic Extraction of Hardware Parameters

Popular HPC network interconnection simulators such as SST/macro provide a variety of configurable parameters to explore the design space of hardware components such as network interface cards (NIC), switches, and links among them. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for matching configurations of the existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or intentionally omitted. In this work, we propose a framework to autotune the multiple network models’ simulation configurations within SST/macro using Tree-structured Parzen Estimator-based Bayesian optimization to observe the effect on simulation accuracy across different message regimes. These regimes consist of small to large message sizes and latency to bandwidth-bound messages. We provide a detailed analysis of the simulation error for four representative HPC systems. Our Bayesian optimization based autotuning framework for network models achieves a maximum of 5x improvement in accuracy over best-effort manual configurations based on available hardware specifications.

Simulation, autotuning↗
DOE OSTI2017

Percolation connectivity, pore size, and gas apparent permeability: Network simulations and comparison to experimental data: Connectivity, Pore Size, and Gas Permeability

We modeled single-phase gas flow through porous media using percolation networks. Gas permeability is different from liquid permeability. The latter is only related to the geometry and topology of the pore space, while the former depends on the specific gas considered and varies with gas pressure. As gas pressure decreases, four flow regimes can be distinguished as viscous flow, slip flow, transition flow, and free molecular diffusion. Here we use a published conductance model presumably capable of predicting the flow rate of an arbitrary gas through a cylindrical pipe in the four regimes. We incorporated this model into pipe network simulations. We considered 3-D simple cubic, body-centered cubic, and face-centered cubic lattices, in which we varied the pipe radius distribution and the bond coordination number. Gas flow was simulated at different gas pressures. The simulation results showed that the gas apparent permeability k app obeys an identical scaling law in all three lattices, k app ~ (z-z c ) β , where the exponent β depends on the width of the pipe radius distribution, z is the mean coordination number, and z c its critical value at the percolation threshold. Surprisingly, (z-z c ) had a very weak effect on the ratio of the apparent gas permeability to the absolute liquid permeability, k app /k abs , suggesting that the Klinkenberg gas slippage correction factor is nearly independent of connectivity. We constructed models of k app and k app /k abs based on the observed power law and tested them by comparison with published experimental data on glass beads and other materials.

58 GEOSCIENCES↗
DOE OSTI2017

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Trace Replay and Network Simulation Tool

TraceR is a trace reply tool built upon the ROSS-based CODES simulation framework. TraceR can be used for predicting network performances and understanding network behavior by simulating messaging in High Performance Computing applications on interconnection networks.

Acun, Bilge↗
DOE OSTI2017

Trace Replay and Network Simulation Tool

TraceR Is a trace replay tool built upon the ROSS-based CODES simulation framework. TraceR can be used for predicting network performance and understanding network behavior by simulating messaging In High Performance Computing applications on interconnection networks.

Jain, Nikhil↗
DOE OSTI2015

Trace Replay and Network Simulation Tool

TraceR is a trace reply tool built upon the ROSS-based CODES simulation framework. TraceR can be used for predicting network performances and understanding network behavior by simulating messaging in High Performance Computing applications on interconnection networks.

Acun, Bilge↗
DOE OSTI2015

Pore connectivity, electrical conductivity, and partial water saturation: Network simulations

Abstract The electrical conductivity of brine‐saturated rock is predominantly dependent on the geometry and topology of the pore space. When a resistive second phase (e.g., air in the vadose zone and oil/gas in hydrocarbon reservoirs) displaces the brine, the geometry and topology of the pore space occupied by the electrically conductive phase are changed. We investigated the effect of these changes on the electrical conductivity of rock partially saturated with brine. We simulated drainage and imbibition as invasion and bond percolation processes, respectively, in pipe networks assumed to be perfectly water‐wet. The simulations included the formation of a water film in the pipes invaded by the nonwetting fluid. During simulated drainage/imbibition, we measured the changes in resistivity index as well as a number of relevant microstructural parameters describing the portion of the pore space saturated with water. Except Euler topological number, all quantities considered here showed a significant level of “universality,” i.e., insensitivity to the type of lattice used (simple cubic, body‐centered cubic, or face‐centered cubic). Hence, the coordination number of the pore network appears to be a more effective measure of connectivity than Euler number. In general, the simulated resistivity index did not obey Archie's simple power law. In log‐log scale, the resistivity index curves displayed a substantial downward or upward curvature depending on the presence or absence of a water film. Our network simulations compared relatively well with experimental data sets, which were obtained using experimental conditions and procedures consistent with the simulations. Finally, we verified that the connectivity/heterogeneity model proposed by Bernabé et al. (2011) could be extended to the partial brine saturation case when water films were not present.

Li, M.↗
DOE OSTI2021

Benchmarking the Performance of Neuromorphic and Spiking Neural Network Simulators

Software simulators play a critical role in the development of new algorithms and system architectures in any field of engineering. Neuromorphic computing, which has shown potential in building brain-inspired energy-efficient hardware, suffers a slow-down in the development cycle due to a lack of flexible and easy-to-use simulators of either neuromorphic hardware itself or of spiking neural networks (SNNs), the type of neural network computation executed on most neuromorphic systems. While there are several openly available neuromorphic or SNN simulation packages developed by a variety of research groups, they have mostly targeted computational neuroscience simulations, and only a few have targeted small-scale machine learning tasks with SNNs. Evaluations or comparisons of these simulators have often targeted computational neuroscience-style workloads. In this work, we seek to evaluate the performance of several publicly available SNN simulators with respect to non-computational neuroscience workloads, in terms of speed, flexibility, and scalability. We evaluate the performance of the NEST, Brian2, Brian2GeNN, BindsNET and Nengo packages under a common front-end neuromorphic framework. Our evaluation tasks include a variety of different network architectures and workload types to mimic the computation common in different algorithms, including feed-forward network inference, genetic algorithms, and reservoir computing. We also study the scalability of each of these simulators when running on different computing hardware, from single core CPU workstations to multi-node supercomputers. Our results show that the BindsNET simulator has the best speed and scalability for most of the SNN workloads (sparse, dense, and layered SNN architectures) on a single core CPU. However, when comparing the simulators leveraging the GPU capabilities, Brian2GeNN outperforms the others for these workloads in terms of scalability. NEST performs the best for small sparse networks and is also the most flexible simulator in terms of reconfiguration capability NEST shows a speedup of at least 2x compared to the other packages when running evolutionary algorithms for SNNs. The multi-node and multi-thread capabilities of NEST show at least 2x speedup compared to the rest of the simulators (single core CPU or GPU based simulators) for large and sparse networks. We conclude our work by providing a set of recommendations on the suitability of employing these simulators for different tasks and scales of operations. We also present the characteristics for a future generic ideal SNN simulator for different neuromorphic computing workloads.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Code for Experiment in Publication “Sensitivity Analysis in the Presence of Intrinsic Stochasticity for Discrete Fracture Network Simulations”

Following the Open Research requirements for AGU journals, we must release the code used to perform the experiment described in our recent publication, posted at (https://arxiv.org/abs/2312.04722). This code fits a joint emulator to data from a Discrete Fracture Network (DFN) simulation, performed using the open-source software DFNworks (https://dfnworks.lanl.gov/). All code to be released implements existing methods; there are no novel algorithms nor any major innovations to existing software.

Murph, Alexander↗
DOE OSTI2023

Water dissociation at the water–rutile TiO 2 (110) interface from ab initio-based deep neural network simulations

The interaction of water with TiO 2 surfaces is of crucial importance in various scientific fields and applications, from photocatalysis for hydrogen production and the photooxidation of organic pollutants to self-cleaning surfaces and bio-medical devices. In particular, the equilibrium fraction of water dissociation at the TiO 2 –water interface has a critical role in the surface chemistry of TiO 2 , but is difficult to determine both experimentally and computationally. Among TiO 2 surfaces, rutile TiO 2 (110) is of special interest as the most abundant surface of TiO 2 ’s stable rutile phase. While surface-science studies have provided detailed information on the interaction of rutile TiO 2 (110) with gas-phase water, much less is known about the TiO 2 (110)–water interface, which is more relevant to many applications. In this work, we characterize the structure of the aqueous TiO 2 (110) interface using nanosecond timescale molecular dynamics simulations with ab initio-based deep neural network potentials that accurately describe water/TiO 2 (110) interactions over a wide range of water coverages. Simulations on TiO 2 (110) slab models of increasing thickness provide insight into the dynamic equilibrium between molecular and dissociated adsorbed water at the interface and allow us to obtain a reliable estimate of the equilibrium fraction of water dissociation. We find a dissociation fraction of 22 ± 6% with an associated average hydroxyl lifetime of 7.6 ± 1.8 ns. These quantities are both much larger than corresponding estimates for the aqueous anatase TiO 2 (101) interface, consistent with the higher water photooxidation activity that is observed for rutile relative to anatase.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Structure of disordered TiO 2 phases from ab initio based deep neural network simulations

Amorphous TiO 2 (a-TiO 2 ) is widely used in many fields, ranging from photo-electrochemistry to bio-engineering, hence detailed knowledge of its atomic structure is of scientific and technological interest. Here we use an ab initio-based deep neural network potential (DP) to simulate large scale atomic models of crystalline and disordered TiO 2 with molecular dynamics. Our DP reproduces the structural properties of all (11) TiO 2 crystalline phases, predicts the densities and structure factors of molten and amorphous TiO 2 with only a few percent deviation from experiments, and describes the pressure dependence of the amorphous structure in agreement with recent observations. Furthermore, it can be extended to model additional structures and compositions and can be thus of great value in the study of TiO 2 -based (nano-)materials.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Viscosity in water from first-principles and deep-neural-network simulations

Abstract We report on an extensive study of the viscosity of liquid water at near-ambient conditions, performed within the Green-Kubo theory of linear response and equilibrium ab initio molecular dynamics (AIMD), based on density-functional theory (DFT). In order to cope with the long simulation times necessary to achieve an acceptable statistical accuracy, our ab initio approach is enhanced with deep-neural-network potentials (NNP). This approach is first validated against AIMD results, obtained by using the Perdew–Burke–Ernzerhof (PBE) exchange-correlation functional and paying careful attention to crucial, yet often overlooked, aspects of the statistical data analysis. Then, we train a second NNP to a dataset generated from the Strongly Constrained and Appropriately Normed (SCAN) functional. Once the error resulting from the imperfect prediction of the melting line is offset by referring the simulated temperature to the theoretical melting one, our SCAN predictions of the shear viscosity of water are in very good agreement with experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗