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 217 records · Page 12

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↗

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↗

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↗

Modeling, analysis, and optimization of complex nuclear processes and facilities via computational methods: The HALEU process case study

Improving and adapting industrial systems to timely meet changing programmatic and market demands is an important goal to achieve, including when operating and maintaining complex nuclear processes and facilities. However, changes to these complex systems are costly, particularly when they are already in place and bounded to stringent requirements and constraints such as when handling radioactive material and contaminated equipment. These conditions often exist when treating spent nuclear fuel remotely within shielded nuclear radiation chambers, commonly referred as hot cells, to condition nuclear material and/or fabricate products for utilization in other nuclear enterprises such as in the manufacture of advanced nuclear fuel. The illustrative case considered here is the production of high assay low enriched uranium (HALEU) products supporting the deployment of advanced nuclear reactors. For the HALEU program, resources invested were and are being systematically analyzed so that these investments are maximized in a facility that is nearly 60 years old. A methodology that has effectively enabled optimized and improvements in the Spent Fuel Treatment (SFT) program, and consequently the HALEU program, involves discrete event simulation as addressed in this article. Here, the quantification of multiple productivity metrics, including material processing rates, cycle times, bottlenecks, number of material transfers as well as equipment, workstation, and material handling utilization, has resulted in a myriad of diverse discoveries and data-informed decisions regarding process layout and constituent, labor levels and schedules, selection of new process units, storage needs, and other critical process configurations. This article describes such a computational capability being applied for decision-making, illustrates its application to an actual process and program, provides illustrative results, and argues how computational methods for the modeling, analysis, and optimization of complex processes and facilities does lead to informed decisions derived from data and not only from intuition.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Estimating value of information for heliostat washing operations at solar thermal plants

Concentrating solar power (CSP) plants depend on thousands of heliostats whose reflectance declines as dust accumulates. Operators routinely measure reflectance to estimate soiling and, in turn, inform cleaning schedules, but the value of collecting more frequent or more accurate data has not been formally quantified. This study introduces a Monte Carlo discrete event simulation framework that integrates stochastic models of soiling, weather, and measurement error with a dynamic cleaning dispatch policy to estimate annual energy production and operations costs. Applied to two representative central-receiver field configurations, the results show that both the frequency and accuracy of reflectance measurements can meaningfully impact plant performance. In both case studies, reducing measurement intervals yields significant returns, with the energy gains greatly exceeding the cost of more frequent data collection. The simulation framework serves as a decision-support tool for CSP operators, allowing them to input site-specific soiling conditions, measurement accuracy, and survey frequency to evaluate the tradeoffs between data collection cost and energy recovery, and to identify measurement strategies that maximize plant profit.

14 SOLAR ENERGY↗

Impact of Data Placement on Resilience in Large-Scale Object Storage Systems

Distributed object storage architectures have become the de facto standard for high-performance storage in big data, cloud, and HPC computing. Object storage deployments using commodity hardware to reduce costs often employ object replication as a method to achieve data resilience. Repairing object replicas after failure is a daunting task for systems with thousands of servers and billions of objects, however, and it is increasingly difficult to evaluate such scenarios at scale on realworld systems. Resilience and availability are both compromised if objects are not repaired in a timely manner. In this work we leverage a high-fidelity discrete-event simulation model to investigate replica reconstruction on large-scale object storage systems with thousands of servers, billions of objects, and petabytes of data. We evaluate the behavior of CRUSH, a well-known object placement algorithm, and identify configuration scenarios in which aggregate rebuild performance is constrained by object placement policies. After determining the root cause of this bottleneck, we then propose enhancements to CRUSH and the usage policies atop it to enable scalable replica reconstruction. We use these methods to demonstrate a simulated aggregate rebuild rate of 410 GiB/s (within 5% of projected ideal linear scaling) on a 1,024-node commodity storage system. We also uncover an unexpected phenomenon in rebuild performance based on the characteristics of the data stored on the system.

Carns, Philip↗

A lock-free priority queue design based on multi-dimensional linked lists

The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN) for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state of the art approaches under high concurrency.

97 MATHEMATICS AND COMPUTING↗

The SprayList: a scalable relaxed priority queue

High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by ``spraying'' themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(p log^3 p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log^3 p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. As a result, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.

97 MATHEMATICS AND COMPUTING↗

Performance Prediction Toolkit

The Performance Prediction Toolkit (PPT), is a scalable co-design tool that contains the hardware and middle-ware models, which accept proxy applications as input in runtime prediction. PPT relies on Simian, a parallel discrete event simulation engine in Python or Lua, that uses the process concept, where each computing unit (host, node, core) is a Simian entity. Processes perform their task through message exchanges to remain active, sleep, wake-up, begin and end.

Chennupati, Gopinath↗

CELAVI (Circular Economy Lifecycle Assessment and VIsualization) [SWR-20-87]

A circular economy emphasizes the efficient use of all resources (e.g., materials, land, water). Despite anticipated overall benefits to society, the transition to a circular economy is likely to create regional differences in impacts. Current tools are unable to fully evaluate these potential externalities, which will be important for informing research prioritization and regional decision making. The Circular Economy Lifecycle Assessment and VIsualization (CELAVI) framework allows stakeholders to quantify and visualize potential regional and sectoral transfers of impacts that could result from transitioning to a circular economy, with particular focus on energy materials. The framework uses system dynamics to model material flows for multiple circular economy pathways and decisions are based on learning-by-doing and are implemented via cost and strategic value of different circular economy pathways. It uses network theory to track the spatial and sectoral flow of functional units across a graph and discrete event simulation to to step through time and evaluate lifecycle assessment data at each time step. The framework is designed to be flexible and scalable to accommodate multiple energy materials and multiple energy technologies. The primary goal of CELAVI is to help answer questions about how material flows and environmental and economic impacts of energy systems might change if the circularity of energy systems increases.

Eberle, Annika↗

Mobiliti v1.0

Mobiliti is a software platform designed to emulate the dynamics of a regional transportation road network. It is built on open-source software that provides parallel discrete-event simulation. The software is transformative in the area of transportation network simulation because of the geospatial scale and fidelity of the network model and the computational time it takes to model a full day of travel demand. For example, it runs a simulation of the entire San Francisco Bay Area, with a network model of ~1M links and a population that completes ~19M trips in ~5 minutes. This scale of simulation has not been attempted with existing simulation models due to the complexity of the model and the computational time it would take to complete. The intent of the software is to create a digital twin capability for cities to evaluate consequences of infrastructure or policy changes on road network dynamics.

Macfarlane, Jane↗

CELAVI (Circular Economy Lifecycle Assessment and VIsualization) v.1.3.1 9/30/2022 [SWR-20-87]

A circular economy emphasizes the efficient use of all resources (e.g., materials, land, water). Despite anticipated overall benefits to society, the transition to a circular economy is likely to create regional differences in impacts. Current tools are unable to fully evaluate these potential externalities, which will be important for informing research prioritization and regional decision making. The Circular Economy Lifecycle Assessment and VIsualization (CELAVI) framework allows stakeholders to quantify and visualize potential regional and sectoral transfers of impacts that could result from transitioning to a circular economy, with particular focus on energy materials. The framework uses system dynamics to model material flows for multiple circular economy pathways and decisions are based on learning-by-doing and are implemented via cost and strategic value of different circular economy pathways. It uses network theory to track the spatial and sectoral flow of functional units across a graph and discrete event simulation to to step through time and evaluate lifecycle assessment data at each time step. The framework is designed to be flexible and scalable to accommodate multiple energy materials and multiple energy technologies. The primary goal of CELAVI is to help answer questions about how material flows and environmental and economic impacts of energy systems might change if the circularity of energy systems increases.

Eberle, Annika↗

An intra-node HPC network architecture with nanosecond-scale photonic switches

We propose a single-stage network architecture for intra-node connectivity that makes use of nanosecond-scale photonic switches. Although buffering at the switch points is of vital importance for complex multi-stage networks, this is not the case for smaller-scale single-stage networks where the end nodes are located only one hop apart. By limiting the buffering to the end points, the proposed architecture manages to minimize the required electro-optic and opto-electronic conversions, leading in this way to both low end-to-end latency and better energy efficiency. Combining these advantages with nanosecond-scale switching times can allow for high-throughput operation even for frequent switch reconfigurations. The performance of the proposed architecture is evaluated via discrete-event simulations for a wide range of synthetic-traffic cases. The simulation results show that high-throughput operation of ≥90% can be achieved even for small message sizes, i.e., 32 KB for all-to-all communication and 2 KB for uniform random traffic, at a data rate of 400 Gb/s and a switch reconfiguration time of ≤72 ns. Moreover, if 100-ns reconfiguration times are achievable as opposed to 150-ns, then for the all-to-all traffic case a 16% and 28% reduction in completion time can be achieved for message sizes of 8 KB and 1 KB, respectively. In a forthcoming era of optically interfaced processors and accelerators, nanosecond-scale photonic switches appear as a highly promising solution for keeping up with the intra-node bandwidth scaling due to their high-bandwidth, low-latency and fast-switching capabilities.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Toward lower-diameter large-scale HPC and data center networks with co-packaged optics

We investigate the advantages of using co-packaged optics for building low-diameter, large-scale high-performance computing (HPC) and data center networks. The increased escape bandwidth offered by co-packaged optics can enable high-radix switch implementations of more than 150 switch ports, which can be combined with data rates of up to 400 Gb/s per port. From the network architecture perspective, the key benefits of using co-packaged optics in future fat-tree networks include (a) the ability to implement large-scale topologies of > <#comment/> 11 , 000 end points by eliminating the need for a third switching layer and (b) the ability to provide up to 4 × <#comment/> higher bisection bandwidth compared to existing solutions, reducing at the same time the number of required switch application-specific integrated circuits by > <#comment/> 80 % <#comment/> . From the network operation perspective, both reduced energy consumption and lower packet delays can be achieved since fewer hops are required; i.e., packets need to traverse fewer serializer/deserializer lanes and fewer switch buffers, which reduces the probability of contending with other packets and improves the tolerance of network congestion. The performance of the proposed architecture is evaluated via discrete-event simulations for a wide range of representative HPC synthetic-traffic cases that include both hotspot and non-hotspot scenarios. The simulation results suggest that co-packaged optics form a promising solution to keep up with bandwidth scaling in future networks, while the reduced number of switching layers can lead to significant mean packet delay improvements that start from 30% and reach up to 74% for high-load conditions.

Maniotis, Pavlos (ORCID:0000000244905253)↗

Toward higher-radix switches with co-packaged optics for improved network locality in data center and HPC networks [Invited]

In this work, we study the network locality improvements that can be achieved by using co-packaged optics in data center and high-performance computing (HPC) networks. The increased escape bandwidth offered by co-packaged optics can enable switches with speeds of 51.2 Tb/s and beyond. From a network architecture perspective, the key advantages of introducing co-packaged optics at the switch points include the implementation of large-scale topologies of >12,000 end points with 4× higher bisection bandwidth and the reduction of the required number of switches by >40% compared with state-of-the-art approaches. From a network operation perspective, improved network locality and faster operation can be achieved since the higher-radix switches can mitigate the impact of network contention. Placing applications under fewer leaf switches reduces the number of packets that cross the spine switches in a leaf-spine topology. The proposed scheme is evaluated via discrete-event simulations: we initially evaluate the network locality properties of the system by using virtual-machine traces from a production data center, and we subsequently quantify the performance improvements by simulating an all-to-all pattern for a variety of message sizes over a number of nodes. The results suggest that co-packaged optics form a promising solution for keeping up with bandwidth scaling in future networks. The virtual-machine analysis shows that large-scale applications can be placed under up to 50% fewer first-level switches, while the network analysis shows speedups of up to 7.1, which translates to execution time reductions of up to 26% and 42.7% for applications with communication ratios of 0.3 and 0.5, respectively.

99 GENERAL AND MISCELLANEOUS↗

ASC CSSE Level 2 Milestone #6362: Resilient Asynchronous Many Task Programming Model

This report is an outcome of the ASC CSSE Level 2 Milestone 6362: Analysis of Re- silient Asynchronous Many-Task (AMT) Programming Model. It comprises a summary and in-depth analysis of resilience schemes adapted to the AMT programming model. Herein, performance trade-offs of a resilient-AMT prograrnming model are assessed through two ap- proaches: (1) an analytical model realized by discrete event simulations and (2) empirical evaluation of benchmark programs representing regular and irregular workloads of explicit partial differential equation solvers. As part of this effort, an AMT execution simulator and a prototype resilient-AMT programming framework have been developed. The former permits us to hypothesize the performance behavior of a resilient-AMT model, and has undergone a verification and validation (V&V) process. The latter allows empirical evaluation of the perfor- mance of resilience schemes under emulated program failures and enabled the aforementioned V&V process. The outcome indicates that (1) resilience techniques implemented within an AMT framework allow efficient and scalable recovery under frequent failures, that (2) the abstraction of task and data instances in the AMT programming model enables readily us- able Application Program Interfaces (APIs) for resilience, and that (3) this abstraction enables predicting the performance of resilient-AMT applications with a simple simulation infrastruc- ture. This outcome will provide guidance for the design of the AMT programming model and runtime systems, user-level resilience support, and application development for ASC's next generation platforms (NGPs).

97 MATHEMATICS AND COMPUTING↗

Evaluating Trade-offs in Potential Exascale Interconnect Technologies

This report details work to study trade-offs in topology and network bandwidth for potential interconnects in the exascale (2021-2022) timeframe. The work was done using multiple interconnect models across two parallel discrete event simulators. Results from each independent simulator are shown and discussed and the areas of agreement and disagreement are explored.

97 MATHEMATICS AND COMPUTING↗

Resilient U.S. Land Ports of Entry

The continued operation of Land Ports of Entry (LPOE), managed by the Customs and Border Protection (CBP) and General Services Administration% is vital to the U.S. economy and security. Border faculties are included in the Department of Homeland Security (DHS) Government Facilities Sector2, one of the 16 critical infrastructures "whose assets, systems, and networks, whether physical or virtual, are considered so vital to the United States that their incapacitation or destruction would have a debilitating effect on security, national economic security, national public health or safety, or any combination thereof.'" Specifically, disruptions to the flow of border crossing traffic, in the form of closures or increased border crossing wait times, impact the economy and security of all countries involved. This paper describes a process for analyzing and improving the resilience of U.S. Land Ports of Entry. For LPOE, the team believes that energy resilience is the primary objective due to the complete reliance on the e-manifest system and the increasing use of Multi-Energy Portals (MEPs). Emanifests are part of CPB's Automated Commercial Environment (ACE). They document several key pieces of information about cargo vehicles wishing to cross the border into the United States and are submitted before arriving at the port. Vehicles can be flagged for more invasive inspection based on the content of the e-manifest. MEPs are a non-intrusive inspection (NII) technology used to scan the contents of the cargo. Together MEPs and ACE serve an important role in aiding CBP with their mission to protect "the public from dangerous people and materials", and "enabling legitimate trade and travel.'" To analyze resilience of a port, the team would need to understand the port's current energy usage, which systems depend on energy and what backup systems exist, and any emergency operation plans that dictate how systems are operated in the event of a power outage. The team would also need to determine the design basis threats (DBTs) for the LPOE which could include natural disasters, manmade events, and accidents. The magnitudes of the DBTs are calculated and are then translated to expected impacts on the infrastructure and systems at the port. With this information gathered, existing LPOE models developed here at Sandia National Laboratories could be extended to support decisions about resilience. Current models are implemented in FlexSim, a 3rd party discrete event simulator. FlexSim provides 3-D visuals of physical layout that can reveal valuable insights, allows input to be variable (e.g. time it takes to interact with the CBP officer at primary inspection can vary) so that a whole range of possibilities can be captured in the results, and can be used to collect user-defined output metrics. Current LPOE models focus on cargo vehicle traffic, and process changes caused by the installation of new drive-through MEPs. Extending them to address resilience questions would require the addition of key pieces of information learned during the resilience analysis including critical systems, failure rates, and process changes for when failures occur. The primary output metric for current models is border crossing wait time. Additional metrics would also be added to the model to gain a more complete understanding of impacts related to resilience, for example, MEP scan rate. Once complete, the model could be used to analyze the effectiveness of mitigation strategies representing some future state.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗