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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Generation of Reversible C++ Code for Optimistic Parallel Discrete Event Simulation

The reversible execution of C/C++ code has been a target of research and engineering for more than a decade as reversible computation has become a central notion in large-scale parallel discrete event simulation (PDES). The simulation models that are implemented for PDES are of increasing complexity and size and require various language features to support abstraction, encapsulation, and composition when building a simulation model. In this paper, we focus on parallel simulation models that are written with user-defined C++ abstractions and abstractions of the C++ Standard Library. We present an approach based on incremental state saving for establishing reversibility of C++ and an evaluation for a kinetic Monte-Carlo simulation implemented in C++. Although a significant runtime overhead is introduced with our technique, it is an enormous win that it allows using the entire C++ language, and has that code automatically transformed into reversible code to enable parallel execution with the Rensselaer’s optimistic simulation system (ROSS).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

A Framework for the Optimization of Discrete-Event Simulation Models

With the growing use of computer modeling and simulation, in all aspects of engineering, the scope of traditional optimization has to be extended to include simulation models. Some unique aspects have to be addressed while optimizing via stochastic simulation models. The optimization procedure has to explicitly account for the randomness inherent in the stochastic measures predicted by the model. This paper outlines a general purpose framework for optimization of terminating discrete-event simulation models. The methodology combines a chance constraint approach for problem formulation, together with standard statistical estimation and analyses techniques. The applicability of the optimization framework is illustrated by minimizing the operation and support resources of a launch vehicle, through a simulation model.

Joshi, B. D.↗
NASA NTRS2011

Performance Analysis of Cloud Computing Architectures Using Discrete Event Simulation

Cloud computing offers the economic benefit of on-demand resource allocation to meet changing enterprise computing needs. However, the flexibility of cloud computing is disadvantaged when compared to traditional hosting in providing predictable application and service performance. Cloud computing relies on resource scheduling in a virtualized network-centric server environment, which makes static performance analysis infeasible. We developed a discrete event simulation model to evaluate the overall effectiveness of organizations in executing their workflow in traditional and cloud computing architectures. The two part model framework characterizes both the demand using a probability distribution for each type of service request as well as enterprise computing resource constraints. Our simulations provide quantitative analysis to design and provision computing architectures that maximize overall mission effectiveness. We share our analysis of key resource constraints in cloud computing architectures and findings on the appropriateness of cloud computing in various applications.

Stocker, John C.↗
NASA NTRS2010

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

Kuhn, D. Richard↗
NASA NTRS2011

Examining Passenger Flow Choke Points at Airports Using Discrete Event Simulation

The movement of passengers through an airport quickly, safely, and efficiently is the main function of the various checkpoints (check-in, security. etc) found in airports. Human error combined with other breakdowns in the complex system of the airport can disrupt passenger flow through the airport leading to lengthy waiting times, missing luggage and missed flights. In this paper we present a model of passenger flow through an airport using discrete event simulation that will provide a closer look into the possible reasons for breakdowns and their implications for passenger flow. The simulation is based on data collected at Norfolk International Airport (ORF). The primary goal of this simulation is to present ways to optimize the work force to keep passenger flow smooth even during peak travel times and for emergency preparedness at ORF in case of adverse events. In this simulation we ran three different scenarios: real world, increased check-in stations, and multiple waiting lines. Increased check-in stations increased waiting time and instantaneous utilization. while the multiple waiting lines decreased both the waiting time and instantaneous utilization. This simulation was able to show how different changes affected the passenger flow through the airport.

Brown, Jeremy R.↗
DOE OSTI2022

Discrete-event Simulation Process Model for the Pyrochemical Processing of Plutonium at Los Alamos National Laboratory

The pyrochemical metal production operations that occur in the Plutonium Facility at Los Alamos National Laboratory perform plutonium purification with the aim to provide plutonium metal for a variety of defense- and non-defense missions within the National Nuclear Security Administration. The demands and constraints associated with the pyrochemical processing of plutonium are complex, making decision analyses challenging for program managers who require plutonium production for their mission applications. The construction of a discrete-event simulation process model is proposed to measure and report the process capacity, material throughput, equipment requirements, and dose accumulation for operators of the pyrochemical metal production operations. The process model, constructed in the ExtendSim™ software, will represent the cause-and-effect relationships between the pyrochemical processing environment and the process constraints, including criticality limitations, material control and accountability measures, chemical analysis requirements, and equipment availability. An accurate representation of the pyrochemical metal production process capacity through simulation modeling will be helpful to program managers in their efforts to forecast plutonium availability for mission applications. Furthermore, the proposed process model will be vital for future analyses that will measure the interactions between the pyrochemical metal production operations and the aqueous reprocessing operations and their ability to minimize transuranic waste disposal.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2016

Development of a Discrete Event Simulation Model for Pyroprocessing Safeguardability

Advanced nuclear energy systems offer benefits for energy sustainability, independence, security, economic growth, and carbon emission reduction. Nuclear fuel fabricated for these systems utilize remotely-handled facilities for batch processing in hot cells. Because special nuclear material is in both different physical and chemical form than that of the contemporary fuel cycle, new challenges arise in terms of safeguardability. To that end, we are developing a system model for a commercial pyroprocessing facility that can also produce quantitative metrics to assess facility design. This paper presents the progress of a first build of a material throughput model using discrete event simulation for the fuel fabrication subsystem. The intent is to study the Type I error, or false alarm, as a metric for safeguardability. Initiating events that could cause false alarms arise from safeguards, safety, and security. False alarms can necessitate a facility shutdown until the anomaly is resolved by facility inspection. A high number would be costly for the facility operator both in terms of operation throughput goals and possible compensatory penalties. Therefore, different conceptual facility designs exhibit different frequencies for the false alarm per initiating event, and this can provide a measure of the safeguardability of each design. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A Study into the Benefits of Using Discrete Event Simulation in TRU and Mixed Low-Level Waste (MLLW) Disposal at Advanced Mixed Waste Treatment Plant (AMWTP) - 19536

As part of the 1995 Settlement agreement reached between the Idaho State Government and the Idaho National laboratory, it was agreed that the approximately 65,000 cubic metres of waste stored at the AMWTP site was to be shipped out of the state to the waste isolation pilot plant (WIPP) in New Mexico or a similar disposal facility by the end of December 2018. In June 2016, the operation of AMWTP was taken over by Fluor Idaho, a subsidiary of Fluor Inc. To improve their capability of processing all of the varied waste contained on the extensive site, Fluor Idaho requested the assistance of DBD Ltd. We were tasked with producing an all-encompassing operational research (OR) model/discrete event simulation (DES) model of the site, which is able to produce live end-date predictions based on current inventory and waste tracking against milestones. The DES model, is capable of predicting years worth of plant operation in a matter of minutes including the variation caused by such complexities as resource/staff availability, equipment breakdown and maintenance, prioritisation of different waste types, and varying shift patterns of both staff and facilities. The DES model can be run from its own bespoke dashboard, that can be customised to suit the audience it is being used to inform, producing clear key performance indicator (KPI) graphics and high-level overviews for senior management, down to drum by drum breakdowns of the predicted feed plans for each individual facility on the AMWTP site for a work planner to analyse and compare to the current operations. Simulation can produce these types of outputs for very low cost and low risk, as it avoids experimentation to find potential alternatives to the status-quo that could result in loss of production or time. These methods can also be used to produce cost benefit analyses for suggested processing options feeding into optioneering studies and cost reduction strategies. As a tool for plant optimisation and tracking, discrete event simulation can provide detailed results quickly and reliably. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
NASA NTRS1988

Parallel discrete event simulation using shared memory

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Reed, Daniel A.↗
NASA NTRS1990

Discrete event simulation tool for analysis of qualitative models of continuous processing systems

An artificial intelligence design and qualitative modeling tool is disclosed for creating computer models and simulating continuous activities, functions, and/or behavior using developed discrete event techniques. Conveniently, the tool is organized in four modules: library design module, model construction module, simulation module, and experimentation and analysis. The library design module supports the building of library knowledge including component classes and elements pertinent to a particular domain of continuous activities, functions, and behavior being modeled. The continuous behavior is defined discretely with respect to invocation statements, effect statements, and time delays. The functionality of the components is defined in terms of variable cluster instances, independent processes, and modes, further defined in terms of mode transition processes and mode dependent processes. Model construction utilizes the hierarchy of libraries and connects them with appropriate relations. The simulation executes a specialized initialization routine and executes events in a manner that includes selective inherency of characteristics through a time and event schema until the event queue in the simulator is emptied. The experimentation and analysis module supports analysis through the generation of appropriate log files and graphics developments and includes the ability of log file comparisons.

Malin, Jane T.↗
NASA NTRS1998

Synchronous Parallel Emulation and Discrete Event Simulation System with Self-Contained Simulation Objects and Active Event Objects

The present invention is embodied in a method of performing object-oriented simulation and a system having inter-connected processor nodes operating in parallel to simulate mutual interactions of a set of discrete simulation objects distributed among the nodes as a sequence of discrete events changing state variables of respective simulation objects so as to generate new event-defining messages addressed to respective ones of the nodes. The object-oriented simulation is performed at each one of the nodes by assigning passive self-contained simulation objects to each one of the nodes, responding to messages received at one node by generating corresponding active event objects having user-defined inherent capabilities and individual time stamps and corresponding to respective events affecting one of the passive self-contained simulation objects of the one node, restricting the respective passive self-contained simulation objects to only providing and receiving information from die respective active event objects, requesting information and changing variables within a passive self-contained simulation object by the active event object, and producing corresponding messages specifying events resulting therefrom by the active event objects.

Steinman, Jeffrey S.↗
DOE OSTI2018

Modeling Large-Scale Slim Fly Networks Using Parallel Discrete-Event Simulation

As supercomputers approach exascale performance, the increased number of processors translates to an increased demand on the underlying network interconnect. We present that the slim fly network topology, a new low-diameter, low-latency, and low-cost interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this article, we present a high-fidelity slim fly packet-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate the model with published work before scaling the network size up to an unprecedented 1 million compute nodes and confirming that the slim fly observes peak network throughput at extreme scale. In addition to synthetic workloads, we evaluate large-scale slim fly models with real communication workloads from applications in the Design Forward program with over 110,000 MPI processes. We show strong scaling of the slim fly model on an Intel cluster achieving a peak network packet transfer rate of 2.3 million packets per second and processing over 7 billion discrete events using 128 MPI tasks. Enabled by the strong performance capabilities of the model, we perform a detailed application trace and routing protocol performance study. Lastly, through analysis of metrics such as packet latency, hop count, and congestion, we find that the slim fly network is able to leverage simple minimal routing and achieve the same performance as more complex adaptive routing for tested DOE benchmark applications.

97 MATHEMATICS AND COMPUTING↗