Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrete Event 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 163 records · Page 9

Scalable Deep Learning-Based Microarchitecture Simulation on GPUs

Cycle-accurate microarchitecture simulators are essential tools for designers to architect, estimate, optimize, and manufacture new processors that meet specific design expectations. However, conventional simulators based on discrete-event methods often require an exceedingly long time-to-solution for the simulation of applications and architectures at full complexity and scale. Given the excitement around wielding the machine learning (ML) hammer to tackle various architecture problems, there have been attempts to employ ML to perform architecture simulations, such as Ithemal and SimNet. However, the direct application of existing ML approaches to architecture simulation may be even slower due to overwhelming memory traffic and stringent sequential computation logic. This work proposes the first graphics processing unit (GPU)-based microarchitecture simulator that fully unleashes the potential of GPUs to accelerate state-of-the-art ML-based simulators. First, considering the application traces are loaded from central processing unit (CPU) to GPU for simulation, we introduce various designs to reduce the data movement cost between CPUs and GPUs. Second, we propose a parallel simulation paradigm that partitions the application trace into sub-traces to simulate them in parallel with rigorous error analysis and effective error correction mechanisms. Combined, this scalable GPU-based simulator outperforms by orders of magnitude the traditional CPU-based simulators and the state-of-the-art ML-based simulators, i.e., SimNet and Ithemal.

97 MATHEMATICS AND COMPUTING↗

A Passive System Reliability Analysis for a Station Blackout

The latest iterations of advanced reactor designs have included increased reliance on passive safety systems to maintain plant integrity during unplanned sequences. While these systems are advantageous in reducing the reliance on human intervention and availability of power, the phenomenological foundations on which these systems are built require a novel approach to a reliability assessment. Passive systems possess the unique ability to fail functionally without failing physically, a result of their explicit dependency on existing boundary conditions that drive their operating mode and capacity. Argonne National Laboratory is performing ongoing analyses that demonstrate various methodologies for the characterization of passive system reliability within a probabilistic framework. Two reliability analysis techniques are utilized in this work. The first approach, the Reliability Method for Passive Systems, provides a mechanistic technique employing deterministic models and conventional static event trees. The second approach, a simulation-based technique, utilizes discrete dynamic event trees to treat time- dependent phenomena during scenario evolution. For this demonstration analysis, both reliability assessment techniques are used to analyze an extended station blackout in a pool-type sodium fast reactor (SFR) coupled with a reactor cavity cooling system (RCCS). This work demonstrates the entire process of a passive system reliability analysis, including identification of important parameters and failure metrics, treatment of uncertainties and analysis of results.

Brunett, Acacia↗

Race conditions and data partitioning: risks posed by common errors to reproducible parallel simulations

When parallel algorithms for simulation were introduced in the 1970s, their development and use interested only experts in parallel computation. This circumstance changed as multi-core processors became commonplace, putting a parallel computer into the hands of every modeler. A natural outcome is growing interest in parallel simulation among persons not intimately familiar with parallel computing. At the same time, parallel simulation tools continue to be developed with the implicit assumption that the modeler is knowledgeable about parallel programming. The unintended consequence is a rapidly growing number of users of parallel simulation tools that are unlikely to recognize when the interaction of race conditions, partitioning strategies, and simultaneous action in their simulation models make results non-reproducible, thereby calling into question the validity of conclusions drawn from the simulation data. Here, we illustrate the potential dangers of exposing parallel algorithms to users who are not experts in parallel computation with example models constructed using existing parallel simulation tools. By doing so, we hope to refocus tool developers on usability, even if this new focus incurs loss of some performance.

97 MATHEMATICS AND COMPUTING↗

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

Used Nuclear Fuel Management Using the Next Generation System Analysis Model

The U.S. Department of Energy (DOE) is leading the National effort to manage the back end of the nuclear fuel cycle, encompassing the safe transportation, storage/staging, and/or eventual disposal of used nuclear fuel (UNF) and high-level radioactive waste. The Next Generation System Analysis Model (NGSAM) is DOE’s discrete-event, agent-based simulation tool designed to model the full life cycle of UNF from reactor discharge to final disposal. NGSAM supports the DOE Office of Spent Fuel and High-Level Waste Disposition by enabling a detailed, scenario-based analysis of logistics, infrastructure, and shipping strategies. NGSAM replaces legacy models with a modern, flexible platform built on Repast Simphony and enhanced by the Process Analysis Tool. NGSAM simulates the movement and interaction of individual fuel assemblies with system components such as canisters, casks, railcars, and facilities. The model integrates with the Java Transportation Operations Model to plan and execute transportation scenarios, supporting both constrained and unconstrained resource allocation. Key features include customizable allocation and acceptance algorithms, detailed facility-level operations, and a Quick Edit tool for rapid scenario adjustments. NGSAM supports multimodal transportation modeling (e.g. rail, road, barge) and provides comprehensive cost, schedule, and infrastructure data. NGSAM utilizes data from sources such as DOE’s STANDARDS UNF database and DOE’s Stakeholder Tool for Assessing Radioactive Transportation, while also allowing user-defined inputs for scenario customization. NGSAM enables stakeholders to evaluate complex UNF management strategies, assess system performance under varying assumptions, and inform decision making for future infrastructure investments. Its modular architecture and integration with other Integrated Waste Management System tools make it a critical asset for planning the safe and efficient disposition of the Nation’s growing UNF inventory.

Craig, Brian [Argonne National Laboratory (ANL)]↗

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↗

Nuclear Materials Process Modeling at the Y-12 National Security Complex

The Y-12 National Security Complex (Y-12) has implemented process modeling for various accountable nuclear materials operations that are performed throughout the plant. Using a discrete, event-based dynamic simulation program, key nuclear material streams are modeled, allowing Y-12 to effectively manage numerous points of interest within the plant’s production operations. Integration of the various material processes into a single, interdependent supply and demand model is one of the ongoing focuses within Y-12’s process modeling effort. The primary purpose of using dynamic simulation modeling is to allow for analysis of the nuclear materials inventories and forecasted supplies based on future demands. Analysis of these inventories includes capacity evaluation, bottleneck mitigation, and assessments of individual pieces of equipment to inform future facility investment decisions and associated project schedules. Modeling of the nuclear materials processes throughout the complex also allows for incorporation of changes relevant to production capabilities such as the upcoming transition of specific operations to the new Uranium Processing Facility. Prior to implementation of process modeling, Y-12 forecasted supply and demand of accountable nuclear materials streams using Microsoft Excel. With deterministic models such as Microsoft Excel, the annual forecasts, generated within data input condition parameters, can only provide a fixed point of data. Fixed data cannot simulate integrated material streams and account for the possibility of occurrences and other changes that dynamic simulations take into consideration. Y-12’s dynamic process modeling allows integrated simulations of multiple accountable nuclear materials processes, including supply and demand forecasting and analysis, and is a coordinated effort involving many steps of verification and validation (V&V), site briefings, testing, reporting, data mining, planning, and documentation that spans various programs throughout the Y-12 complex.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Dynamic, risk informed decision support systems and methods

The present disclosure is directed to a decision support system or tool based on a Bayesian Network (BN) framework. The diagnostic support tool is created by using advanced Probabilistic Risk Assessment (PRA) method(s) to construct Bayesian Networks (BNs) that form a Bayesian Decision Support Process (BDSP) to provide science-based decision support for understanding and managing events in complex systems. In an embodiment, the PRA method(s) may include Discrete Dynamic Event Trees (DDETs) and simulations.

Groth, Katrina↗

Optimized Uncertainty Quantification Algorithm Within a Dynamic Event Tree Framework

Methods for developing Phenomenological Identification and Ranking Tables (PIRT) for nuclear power plants have been a useful tool in providing insight into modelling aspects that are important to safety. These methods have involved expert knowledge with regards to reactor plant transients and thermal-hydraulic codes to identify are of highest importance. Quantified PIRT provides for rigorous method for quantifying the phenomena that can have the greatest impact. The transients that are evaluated and the timing of those events are typically developed in collaboration with the Probabilistic Risk Analysis. Though quite effective in evaluating risk, traditional PRA methods lack the capability to evaluate complex dynamic systems where end states may vary as a function of transition time from physical state to physical state . Dynamic PRA (DPRA) methods provide a more rigorous analysis of complex dynamic systems. A limitation of DPRA is its potential for state or combinatorial explosion that grows as a function of the number of components; as well as, the sampling of transition times from state-to-state of the entire system. This paper presents a method for performing QPIRT within a dynamic event tree framework such that timing events which result in the highest probabilities of failure are captured and a QPIRT is performed simultaneously while performing a discrete dynamic event tree evaluation. The resulting simulation results in a formal QPIRT for each end state. The use of dynamic event trees results in state explosion as the number of possible component states increases. This paper utilizes a branch and bound algorithm to optimize the solution of the dynamic event trees. The paper summarizes the methods used to implement the branch-and-bound algorithm in solving the discrete dynamic event trees.

42 ENGINEERING↗

ExtendSim Scenario Manager Overview

ExtendSim® is an advanced simulation environment used to model processes using either discrete event, continuous, discrete rate or agent-based modeling techniques. The process models created are comprised of blocks that are linked together to simulate the logic and sequence of the process being evaluated. These blocks can communicate with each other via messages. This ensures that required information is communicated throughout the model as needed. In addition, ExtendSim has a number of data management techniques, including integrated databases that can be used to store input and output information from the model.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Robotics for Energy Infrastructure Construction on Earth and Beyond: Pilot Study Exploring Level 3-4 Semi-Autonomous Installation of a Reduced-Scale Photovoltaic Power Plant Prototype: Preprint

There is a growing need to build energy infrastructure at massive scale on both Earth and in space. On Earth, increasing electricity demand from applications such as AI data centers is driving rapid expansion of power systems, while in space, long-duration missions such as lunar operations require reliable and resilient energy infrastructure that can be deployed quickly. These needs outpace the capabilities of conventional construction methods. Robotic construction offers a path to faster, lower-cost, and more consistent deployment, yet most existing approaches focus on automating individual tasks rather than end-to-end assembly. The Industrialized Construction Innovation (ICI) team at the National Laboratory of the Rockies (NLR), in collaboration with the Colorado School of Mines, has been investigating robotics and automation strategies for rapid end-to-end energy infrastructure construction. This paper presents a pilot study demonstrating level 3-4 semi-autonomous, end-to-end robotic assembly of a reduced-scale photovoltaic power plant prototype under terrestrial conditions. The approach combines hardware redesign of photovoltaic components for robotic compatibility, discrete-event and physics-based robotic simulations in synthetic environments, and sim-to-real deployment to execute end-to-end robotic assembly of[NM1.1][NM1.2] tracking components, structural members, photovoltaic modules, and embedded electrical connections. The pilot identifies key limitations like tolerance management, perception and localization, end effector capability, fastening methods, and multi-physics simulation fidelity, that must be addressed to enable end-to-end robotic assembly of full-scale energy infrastructure. The study highlights how these insights inform scaling strategies for terrestrial energy infrastructure and adaptation to unstructured and extreme environments, including off-world scenarios such as robotic assembly of vertical tall lunar towers.

14 SOLAR ENERGY↗

Electron-Proton Scattering Event Generation using Structured Tokenization

Recent work such as Omnijet-$\alpha$ has demonstrated that effective tokenization combined with transformer-based architectures can produce effective foundation models for jet physics. While tokenization may help models capture generalizable event characteristics, it also introduces discretization errors that may compromise the precision required for downstream physics analyses. As the number and complexity of the particle features grow, these errors are likely to grow proportionally. In this study, we investigate new tokenization strategies to improve the application of generative transformer models to \textsc{Pythia8} simulations of electron-proton scattering at the Electron-Ion Collider. Specifically, we propose a feature-based structured tokenization approach that utilizes multiple tokens per particle, improving expressivity, while reducing the total number of unique tokens needed. We evaluate this method against grid-based binning, K-means clustering, and vector-quantized variational auto-encoders on the event simulations. Our results show that feature-based structured tokenization reduces discretization error, leading to more accurate generative modeling of particle-level events.

Goldenberg, Steven [Thomas Jefferson National Acce↗

Electron-Proton Scattering Event Generation using Structured Tokenization

Recent work such as Omnijet-$\alpha$ has demonstrated that effective tokenization combined with transformer-based architectures can produce effective foundation models for jet physics. While tokenization may help models capture generalizable event characteristics, it also introduces discretization errors that may compromise the precision required for downstream physics analyses. As the number and complexity of the particle features grow, these errors are likely to grow proportionally. In this study, we investigate new tokenization strategies to improve the application of generative transformer models to \textsc{Pythia8} simulations of electron-proton scattering at the Electron-Ion Collider. Specifically, we propose a feature-based structured tokenization approach that utilizes multiple tokens per particle, improving expressivity, while reducing the total number of unique tokens needed. We evaluate this method against grid-based binning, K-means clustering, and vector-quantized variational auto-encoders on the event simulations. Our results show that feature-based structured tokenization reduces discretization error, leading to more accurate generative modeling of particle-level events.

Goldenberg, Steven [Thomas Jefferson National Acce↗

Activity Diagrams for DEVS Models: A Case Study Modeling Health Care Behavior

Discrete Event Systems Specification (DEVS) is a widely used formalism for modeling and simulation of discrete and continuous systems. While DEVS provides a sound mathematical representation of discrete systems, its practical use can suffer when models become complex. Five main functions, which construct the core of atomic modules in DEVS, can realize the behaviors that modelers want to represent. The integration of these functions is handled by the simulation routine, however modelers can implement each function in various ways. Therefore, there is a need for graphical representations of complex models to simplify their implementation and facilitate their reproduction. In this work, we illustrate the use of activity diagrams for this purpose in the context of a health care behavior model, which is developed with an agent-based modeling paradigm.

Activity diagram↗

Virtual Time III, Part 3: Throttling and Message Cancellation

This is Part 3 of a trio of papers that unify in a natural way the two historically distinct parallel discrete event synchronization paradigms, optimistic and conservative, combining the best properties of both into a single framework called Unified Virtual Time (UVT). In this part, we survey the synchronization effects that can be achieved by restricting to corner cases the relationships permitted among the control variables, GVT, CVT, TVT, and LVT, which were defined in Part 1. Here we also survey various throttling policies from the literature and describe how they can be implemented in UVT by controlling the value of TVT, including policies that can take advantage of rollback in addition to LP blocking. A significant result is a new category of efficient and higher precision throttling algorithms for optimistic execution that are based on optimistic lookahead, defined in a way that is symmetric to what we now call the conservative lookahead information that is traditionally used for conservative synchronization. Finally, we present a novel algorithm allowing the choice between lazy and aggressive cancellation to be made on a message-by-message basis using either external logic expressed in the model code, or policy code internal to the simulator, or a mixture of both.

throttling↗

Toucan: A performance portable, scalable implementation of the DECA algorithm

In the field of additive manufacturing (AM), cellular automata (CA) is extensively used to simulate microstructural evolution during solidification. However, while traditional CA approaches are relatively fast, they still require a substantial number of time steps, are limited to moderate volumes, and are relatively difficult to improve through parallelism due to the highly localized nature of the solidification front. Here, to address these issues of time to solution and load balancing, we introduce Toucan, a parallel, performance-portable, and scalable code written in C++ with the Kokkos library that leverages the discrete event inspired cellular automata (DECA) algorithm to perform parallel-in-time (PinT) grain growth simulations. Toucan effectively mitigates load balancing issues by distributing the computational workload more evenly across processors, enhancing scalability and efficiency. We conduct both strong and weak scaling studies on up to 64 GPUs on the Frontier supercomputer, demonstrating that Toucan significantly outperforms the current state-of-the-art, time-stepped CA code, ExaCA, on both single and multi-GPU simulations. Even in AM-specific weak scaling scenarios, Toucan maintains near-ideal scaling, in contrast to the linear increase observed with ExaCA due to the moving laser raster pattern. This study highlights Toucan’s potential to transform microstructural simulations in AM by radically improving both efficiency and scalability over existing methods.

36 MATERIALS SCIENCE↗

Smart Charging for Electric Ride-Hailing Vehicles using Renewables: A San Francisco Case Study

Charging large fleets of electric ride-hailing vehicles (ERVs) is a complex matter that could serve different objectives: lower carbon dioxide emissions, lower monetary expenditures, or maximize solar photovoltaics (PV) energy consumption. Currently, it is unclear how each of those objectives could impact the business and performance of a ride-hailing fleet. In order to fill this gap, this article employs a dynamic transportation model: a smart charging simulation that combines agent-based, discrete-event, and system dynamic modelling by comparing the above-mentioned objectives in separate scenarios. The results show that each scenario successfully manages to shift between 34% and 87% of all load to hours of the day when the objectives of those scenarios are met. Therefore, in comparison to the baseline, smart charging can save between 5% and 26% of monthly emissions and between 4% and 57% of monthly expenditures. The solar PV scenario, however, results in the highest savings, while ensuring profitable economics via net metering in the short- as well as long term. Finally, the sensitivity analysis points to important trade-offs between several fleet performance metrics. The article concludes by giving business and policy recommendations for maximising the economic, energy and environmental efficiency of large ERV fleets.

ADVANCED PROPULSION SYSTEMS,SOLAR ENERGY↗