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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Machine Learning-enabled Scalable Performance Prediction of Scientific Codes

Hardware architectures become increasingly complex as the compute capabilities grow to exascale. Here, we present the Analytical Memory Model with Pipelines (AMMP) of the Performance Prediction Toolkit (PPT). PPT-AMMP takes high-level source code and hardware architecture parameters as input and predicts runtime of that code on the target hardware platform, which is defined in the input parameters. PPT-AMMP transforms the code to an (architecture-independent) intermediate representation, then (i) analyzes the basic block structure of the code, (ii) processes architecture-independent virtual memory access patterns that it uses to build memory reuse distance distribution models for each basic block, and (iii) runs detailed basic-block level simulations to determine hardware pipeline usage. PPT-AMMP uses machine learning and regression techniques to build the prediction models based on small instances of the input code, then integrates into a higher-order discrete-event simulation model of PPT running on Simian PDES engine. We validate PPT-AMMP on four standard computational physics benchmarks and present a use case of hardware parameter sensitivity analysis to identify bottleneck hardware resources on different code inputs. We further extend PPT-AMMP to predict the performance of a scientific application code, namely, the radiation transport mini-app SNAP. To this end, we analyze multi-variate regression models that accurately predict the reuse profiles and the basic block counts. We validate predicted SNAP runtimes against actual measured times.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

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↗

DOE OSTI2022

A simulation‐based integrated virtual testbed for dynamic optimization in smart manufacturing systems

Abstract In a manufacturing system, production control‐related decision‐making activities occur at different levels. At the process level, one of the main control activities is to tune the parameters of individual manufacturing equipment. At the system level, the main activity is to coordinate production resources and to route parts to appropriate workstations based on their processing requirement, priority indices, and control policy. At the factory level, the goal is to plan and schedule the processing of parts at different operations for the entire system in order to optimize certain objectives. Note that the results of such activities at different levels are closely coupled and affect the overall performance of the manufacturing system as a whole. Therefore, it is important to systematically integrate these control and optimization activities into one unified platform to ensure the goal of each individual activity is aligned with the overall performance of the system. In this paper, we develop a simulation‐based virtual testbed that implements dynamic optimization, automatic information exchange, and decision‐making from the process‐level, system‐level, and factory‐level of a manufacturing system into an integrated computation environment. This is demonstrated by connecting a Python‐based numerical computation program, discrete‐event simulation software (Simul8), and an optimization solver (CPLEX) via a third‐party master program. The application of this simulation‐based virtual testbed is illustrated by a case study in a machining shop.

Sun, Yuting↗

DOE OSTI2023

DSS-SimPy-RL (Open-DSS and SimPy based Cyber-Physical RL environment) [SWR-23-29]

Recently, numerous data-driven approaches to control an electric grid using machine learning techniques have been investigated. With the advancement of reinforcement learning (RL) based techniques, gradually the conventional optimization based solvers are being replaced with RL approach where there is uncertainty in the environment such as renewable generation or cyber system emulation. However, to train an agent efficiently, it requires numerous interactions with an environment to learn the best policies. There are numerous RL environments for the power systems based on some well-known simulators, similarly there are environment for communication domains. While majority of the cyber emulators are based in an UNIX environment, the power simulators are based in the Windows-based operating system, the generation of cyber-physical mixed domain RL environment has been challenging. Existing co-simulation methods are efficient but resource and time intensive to generate large scale data set for training RL agents. Hence, this software focuses on development and validation of a mixed domain RL environment using Open DSS for the physical side and leverages a discrete event simulator python package, SimPy, for cyber-side emulation which is Operating Systems agnostic. Further utilizing this software co-simulation and training RL agents for re-routing based resilient control for network reconfiguration and volt-var control in power distribution feeder are performed.

Sahu, Abhijeet↗

DOE OSTI2026

A simulation framework for evaluating electronic order workflows in integrated health records

Electronic health record (EHR) systems are critical to modern healthcare delivery, yet the dynamic workflows that govern electronic order processing remain underexplored. Inefficiencies in these digital pathways can cause delays in care, repetitive workloads, and even patient harm. This study presents a discrete-event simulation framework used to reconstruct and evaluate EHR-based order workflows in a large integrated healthcare system. Using real-world data extracted from the Veterans Health Administration’s Corporate Data Warehouse, the authors mapped order events to standardized state transitions and modeled their progression across different facilities of varying complexity levels. After being calibrated with empirical distributions of transition times and validated against observed time-in-system metrics, the simulation demonstrates close alignment with historical performance. Scenario analyses reveal that resource capacity constraints significantly amplify the impact of electronic order surges, which are reflected in the disproportionate growth in backlogs and processing delays. Adjustments in transition probabilities further increased recirculation and extended workflow paths. Network-based analysis identified Reserved, InProgress, and Completed as structurally critical states that function as hubs within the process network but the transitions in-between also act as major bottlenecks. These results showcased the effectiveness of simulation-based approaches in monitoring EHR order processing performance and evaluating consequences of workflow changes on healthcare network resources planning. The proposed simulation framework provides a scalable data-driven tool to support operational decision-making and improve the efficiency of electronic order management in complex healthcare environments.

Engineering↗

DOE OSTI2018

Simulated execution of hybrid quantum computing systems

We use modeling and simulation to study the behavior and performance of hybrid quantum computing systems. Our approach is based on a layered design with abstract machine models, which identify the key components and interfaces for quantum processing units, quantum programming models, and hybrid execution models. We use discrete-event simulating to track the dynamical state of hierarchical abstract machine models while executing test programs, and we collect statistics on time and energy consumption to forecast the resources required by quantum processors for future scientific computation.

Humble, Travis↗

DOE OSTI2024

A Simulation Study of Quantum Clock Synchronization Using Teleportation

An important requirement in implementing distributed computing and sensing application is the synchronization of clocks at various locations. The Internet relies on the Network Time Protocol (NTP), which synchronizes clocks with accuracy in the order of milliseconds. More recently an ensemble of atomic clocks is used for navigation based on GPS. These clocks are highly accurate and provide time with very low uncertainty. Even so, many physics experiments such as distributed LIGO-based systems may require more accurate clock synchronization that is achievable using quantum entanglement. This requires the deployment of a network of quantum clocks synchronized by exploiting entangled atomic clock qubits. In this paper, we carry out a simulation study of synchronizing a network of quantum clocks interconnected by a fiber plant that supports the ESnet; the latter is used to support the classical communication needed for teleportation. We consider an existing protocol for synchro-nizing the atomic clock qubits that relies on the GHZ states. To assess the performance of the protocol we developed a discrete-event simulation of the network using IBM Qiskit framework for underlying quantum gate operations and measurements. The simulation results shed light on the resources required in terms of the number entangled qubits and the time needed to achieve the synchronization of different number of nodes in ESnet.

Kiran, Mariam↗

DOE OSTI2017

Concurrent conversation modeling and parallel simulation of the naming game in social networks

The Naming Game is an effective self-organization model to understand the emergence of linguistic consensus and to investigate the system dynamics in a variety of phenomena over social networks of autonomous agents. The Naming Game is an effective description for the evolution of consensus despite the absence of any central coordination or specialized initialization even in large-scale networks. While the classical game is effective in description, it was defined with inherently sequential evaluation semantics over the entire network. Here, we develop a new concurrent model as a relaxation of the classical formulation and express it in a discrete event style of evaluation. Further, with the uncovered concurrency that was absent in the classical algorithm, we map the concurrent model to parallel discrete event simulation. Using a prototype implementation, we present an initial parallel performance study on networks containing hundreds of thousands of individuals, with a decrease in simulation time in the best-observed case from 4800 seconds down to 1400 seconds.

Perumalla, Kalyan↗

DOE OSTI2024

Exploring the benefits of using co-packaged optics in data center and AI supercomputer networks: a simulation-based analysis [Invited]

We investigate the advantages of using co-packaged optics in next-generation data center and AI supercomputer networks. The increased escape bandwidth offered by co-packaged optics provides multiple possibilities for building 50T switches and beyond, expanding the opportunities in both the data center and supercomputing domains. Furthermore, this provides network architects with the opportunity to expand their design space and develop simplified networks with enhanced network locality properties. Co-packaging at the switch and server points enables networks with double capacity while reducing the switch count by 64% compared to state-of-the-art systems. We evaluate these concepts through discrete-event simulations using all-to-all and all-reduce traffic patterns that simulate collective communications commonly found in network-bound applications. Initially, we investigate the all-to-all overhead involved in distributing the virtual machines of the applications across multiple leaf switches and compare it to the scenario in which all VMs are placed under a single switch. Subsequently, we evaluate the performance of an AI supercomputing cluster by simulating both patterns for different message sizes, while also varying the number of participating nodes. The results suggest that networks with improved locality properties become increasingly important as the network stack operates at higher speeds; for a stack latency of 1.25 µs, placing the applications under multiple switches can result in up to 68% higher completion times than placing them under a single switch. For AI supercomputers, significant improvements are observed in the mean server throughput, reaching more than 90% for configurations involving 256 nodes and message sizes of at least 128 KiB.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2016

Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits.

Upcoming weapon programs require an aggressive increase in Application Specific Integrated Circuit (ASIC) production at Sandia National Laboratories (SNL). SNL has developed unique modeling and optimization tools that have been instrumental in improving ASIC production productivity and efficiency, identifying optimal operational and tactical execution plans under resource constraints, and providing confidence in successful mission execution. With ten products and unprecedented levels of demand, a single set of shared resources, highly variable processes, and the need for external supplier task synchronization, scheduling is an integral part of successful manufacturing. The scheduler uses an iterative multi-objective genetic algorithm and a multi-dimensional performance evaluator. Schedule feasibility is assessed using a discrete event simulation (DES) that incorporates operational uncertainty, variability, and resource availability. The tools provide rapid scenario assessments and responses to variances in the operational environment, and have been used to inform major equipment investments and workforce planning decisions in multiple SNL facilities.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

DOE OSTI2019

Career Development through Discreet Simulation Modeling - 19009

The cleanup mission of the Department of Energy (DOE) Office of River Protection (ORP) at the Hanford Site is to immobilize 212,000 m3 (56 million gallons) of nuclear waste, currently stored in 177 underground tanks, at the Waste Treatment and Immobilization Plant (WTP) and associated supplemental treatment facilities. Waste transfers to and from the WTP utilize the intricate Hanford Waste Feed Delivery (WFD) system, a network composed of: double-shell tanks (DSTs), single shell tanks (SSTs), the effluent treatment facility (ETF), a large number of pumps, valves, and leak detectors, and thousands of feet of underground transfer lines. This equipment must be prepared to safely and reliably transfer waste to the WTP. This study used discrete event simulation modeling to explore the behavior of the waste transfer system to identify areas of improvement. Two models and their subsequent results are presented: the Effluent Treatment Facility and the next-to-be-retrieved single-shell tanks (A/AX Farms). This study focused on identifying throughput bottlenecks, operational constraints, choke-point analysis, and redundancy in equipment, process design, and operational strategy. Analysis performed on the ETF OR Model indicated that the existing facility operation strategy will not result in a sufficient throughput to prevent WTP melter idling. Furthermore, in the absence of equipment failures, the facility was still shown to be unable to reach the required throughput to prevent melter idling. It is concluded that ETF system maintenance events are currently the main bottlenecks in the ETF facility. Analysis performed on the SST (A/AX) OR model indicate that the main drivers of the retrieval schedule are the hard retrieval start dates for each SST tank. In addition, it was concluded that operating the ventilation trains in parallel results in 15 times less retrieval interruptions and shortens the retrieval durations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DOE OSTI2015

Comparison of Two Models for Damage Accumulation in Simulations of System Performance

A comprehensive simulation study of system performance needs to address variations in component behavior, variations in phenomenology, and the coupling between phenomenology and component failure. This paper discusses two models of this: 1. damage accumulation is modeled as a random walk process in each time history, with component failure occurring when damage accumulation reaches a specified threshold; or 2. damage accumulation is modeled mechanistically within each time history, but failure occurs when damage reaches a time-history-specific threshold, sampled at time zero from each component’s distribution of damage tolerance. A limiting case of the latter is classical discrete-event simulation, with component failure times sampled a priori from failure time distributions; but in such models, the failure times are not typically adjusted for operating conditions varying within a time history. Nowadays, as discussed below, it is practical to account for this. The paper compares the interpretations and computational aspects of the two models mentioned above.

42 ENGINEERING↗

DOE OSTI2021

Evaluating MPI resource usage summary statistics

The Message Passing Interface (MPI) remains the dominant programming model for scientific applications running on today’s high-performance computing (HPC) systems. This dominance stems from MPI’s powerful semantics for inter-process communication that has enabled scientists to write applications for simulating important physical phenomena. MPI does not, however, specify how messages and synchronization should be carried out. Those details are typically dependent on low-level architecture details and the message characteristics of the application. Therefore, analyzing an application’s MPI resource usage is critical to tuning MPI’s performance on a particular platform. The result of this analysis is typically a discussion of the mean message sizes, queue search lengths and message arrival times for a workload or set of workloads. While a discussion of the arithmetic mean in MPI resource usage might be the most intuitive summary statistic, it is not always the most accurate in terms of representing the underlying data. In this paper, we analyze MPI resource usage for a number of key MPI workloads using an existing MPI trace collector and discrete-event simulator. Our analysis demonstrates that the average, while easy and efficient to calculate, is a useful metric for characterizing latency and bandwidth measurements, but may not be a good representation of application message sizes, match list search depths, or MPI inter-operation times. Additionally, we show that the median and mode are superior choices in many cases. We also observe that the arithmetic mean is not the best representation of central tendency for data that are drawn from distributions that are multi-modal or have heavy tails. Furthermore, the results and analysis of our work provide valuable guidance on how we, as a community, should discuss and analyze MPI resource usage data for scientific applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Discrete Event Execution with One-Sided and Two-Sided GVT Algorithms on 216,000 Processor Cores

Global virtual time (GVT) computation is a key determinant of the efficiency and runtime dynamics of parallel discrete event simulations (PDES), especially on large-scale parallel platforms. Here, three execution modes of a generalized GVT computation algorithm are studied on high-performance parallel computing systems: (1) a synchronous GVT algorithm that affords ease of implementation, (2) an asynchronous GVT algorithm that is more complex to implement but can relieve blocking latencies, and (3) a variant of the asynchronous GVT algorithm to exploit one-sided communication in extant supercomputing platforms. Performance results are presented of implementations of these algorithms on up to 216,000 cores of a Cray XT5 system, exercised on a range of parameters: optimistic and conservative synchronization, fine- to medium-grained event computation, synthetic and non-synthetic applications, and different lookahead values. Performance of up to 54 billion events executed per second is registered. Detailed PDES-specific runtime metrics are presented to further the understanding of tightly-coupled discrete event dynamics on massively parallel platforms.

Perumalla, Kalyan S↗

DOE OSTI2016

Model-based Dynamic Control of Speculative Forays in Parallel Computation

In simulations running in parallel, the processors would have to synchronize with other processors to maintain correct global order of computations. This can be done either by blocking computation until correct order is guaranteed, or by \textit{speculatively} proceeding with the best guess (based on local information) and later correcting errors if/as necessary. Since the gainful lengths of speculative forays depend on the dynamics of the application software and hardware at runtime, an online control system is necessary to dynamically choose and/or switch between the blocking and speculative strategies. In this paper, we formulate the reversible speculative computing in large-scale parallel computing as a dynamic linear feedback control (optimization) system model and evaluate its performance in terms of time and cost savings as compared to the traditional (forward) computing. We illustrate with an exact analogy in the form of vehicular travel under dynamic, delayed route information. The objective is to assist in making the optimal decision on what computational approach is to be chosen, by predicting the amount of time and cost savings (or losing) under different environments represented by different parameters and probability distribution functions. We consider the cases of Gaussian, exponential and log-normal distribution functions. The control system is intended for incorporating into speculative parallel applications such as optimistic parallel discrete event simulations to decide at runtime when and to what extent speculative execution can be performed gainfully.

Perumalla, Kalyan↗

DOE OSTI2017

Analysis of Operating Strategies Using Different Target Designs For 238Pu Production

An engineering effort is underway to re-establish capability to produce 238Pu oxide at the kilogram scale in the United States. A multi-step batch process is being developed to produce this important material. Recently, a portion of this process was studied using discrete-event simulation tools to determine whether the conceptual process might achieve its yearly production goal. The study showed the conceptual process can meet the yearly production goal under some circumstances, but process improvements would be needed to ensure greater likelihood of success. This study extends the work performed previously by examining the effects of changing the reactor target design on the yearly process output. Two new reactor target configurations are considered an aluminum-clad reactor target containing 50% greater 237Np oxide content than the original target, and a zirconium alloy-clad target using no aluminum. The results indicate that use of the new aluminum-clad target configuration may allow the process to achieve the same yearly production goal in less time using fewer targets. If the zirconium alloy-clad target is used, then even fewer targets would be needed to reach the production goal, but some process changes would be required to handle the zirconium cladding. The number of days needed to process a target batch to completion, and the steady state 238Pu oxide production rate, for each configuration are compared to the results from the initial simulation study.

campaign↗

DOE OSTI2024

Power System Operational Impacts of Electric Vehicle Dynamic Wireless Charging

The electrification of the transportation sector poses an opportunity for reducing greenhouse gas (GHG) emissions from passenger vehicles. Electric vehicle (EV) charging through dynamic wireless power transfer (DWPT), known as roadway electrification, could shift EV demand profiles to better coincide with renewable electricity generation. However, this would be a very large new load and few studies evaluate the regional impacts of DWPT charging in a power transmission system. This paper defines methods that address dataset generation for passenger vehicle trips and models to evaluate regional impacts for this emerging technology. Household vehicle miles traveled (VMT) data form localized EV demand profiles through discrete-event simulation. This data serves as exogenous inputs for a Production Cost Model (PCM) of a synthetic transmission system based on the Electric Reliability Council of Texas's (ERCOT) network. EV charging methods are compared for both a 2018 baseline generation mixture and a high-renewable generation case incorporating 20 GW of installed solar photovoltaic (PV) capacity. The PCM employs unit commitment and economic dispatch (UC&ED) models to compare financial, environmental, and grid reliability impacts from EV charging across passenger EV adoption levels. In-transit charging could reduce grid operational costs by as much as 1.49%, with up to $13.7B saved in annual vehicle operational costs for consumers compared to gas-powered vehicles. Health impacts analysis from power plant and vehicle tailpipe emissions from this study show net health benefits increase by 40% for in-transit charging coupled with high renewable generation. Renewable resources provide an avenue for cost-effective in-transit charging with reduced emissions. The combination of dataset generation and open-source power system modeling establish a foundation for the holistic evaluation of regional DWPT impacts.

dynamic wireless power transfer↗

DOE OSTI2024

Techno-economic and life-cycle analysis of strategies for improving operability and biomass quality in catalytic fast pyrolysis of forest residues

Many of the challenges faced by the first commercial biorefineries were associated with feedstock handling, quality, and cost. Strategies are needed to enable further expansion of biorefineries and meet the growing demand for bio-based fuels and products. Here, we examine 2 key feedstock challenges and mitigation strategies in the context of a catalytic fast pyrolysis (CFP) biorefinery: (1) the operability of the feed system, which may be improved by modifying the minimum particle size fed to the reactor, and (2) the quality of the biomass, which may be improved by employing air classification to remove undesirable material and increase fuel yields. We conduct techno-economic analysis (TEA) and life-cycle analysis for these strategies, employing a discrete event simulation model for biomass preprocessing combined with a series of correlations developed from literature data and a rigorous CFP conversion model. Our results highlight the importance of balancing increased cost and material losses from preprocessing against improved operability and fuel yields. Economics and sustainability were optimized when operating at the lowest minimum particle size, emphasizing the importance of minimizing material losses while maintaining the operability of the process. Economically, additional costs and material losses from air classification could be acceptable due to improved biomass conversion, and an optimum air classification speed was identified; however, the fuel GHG emissions were minimized when air classification was not used. Valorizing material removed during preprocessing as a coproduct could improve economics and sustainability, decreasing the burden of material losses.

09 - BIOMASS FUELS↗