Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel 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.

50 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

On extending parallelism to serial simulators

This paper describes an approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops submodels using an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between submodels; however, the automation requires that any such communication must take a nonzero amount off simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of submodels on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian Parallel Simulator), is described, along with performance results on the Intel Paragon.

Nicol, David↗
NASA NTRS1990

Performance bounds on parallel self-initiating discrete-event

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Nicol, David M.↗
DOE OSTI2024

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↗
NASA NTRS1995

A software bus for thread objects

The authors have implemented a software bus for lightweight threads in an object-oriented programming environment that allows for rapid reconfiguration and reuse of thread objects in discrete-event simulation experiments. While previous research in object-oriented, parallel programming environments has focused on direct communication between threads, our lightweight software bus, called the MiniBus, provides a means to isolate threads from their contexts of execution by restricting communications between threads to message-passing via their local ports only. The software bus maintains a topology of connections between these ports. It routes, queues, and delivers messages according to this topology. This approach allows for rapid reconfiguration and reuse of thread objects in other systems without making changes to the specifications or source code. A layered approach that provides the needed transparency to developers is presented. Examples of using the MiniBus are given, and the value of bus architectures in building and conducting simulations of discrete-event systems is discussed.

Callahan, John R.↗
NASA NTRS2007

A Queue Simulation Tool for a High Performance Scientific Computing Center

The NASA Center for Computational Sciences (NCCS) at the Goddard Space Flight Center provides high performance highly parallel processors, mass storage, and supporting infrastructure to a community of computational Earth and space scientists. Long running (days) and highly parallel (hundreds of CPUs) jobs are common in the workload. NCCS management structures batch queues and allocates resources to optimize system use and prioritize workloads. NCCS technical staff use a locally developed discrete event simulation tool to model the impacts of evolving workloads, potential system upgrades, alternative queue structures and resource allocation policies.

Spear, Carrie↗
NASA NTRS1990

DSIM: A distributed simulator

Discrete event-driven simulation makes it possible to model a computer system in detail. However, such simulation models can require a significant time to execute. This is especially true when modeling large parallel or distributed systems containing many processors and a complex communication network. One solution is to distribute the simulation over several processors. If enough parallelism is achieved, large simulation models can be efficiently executed. This study proposes a distributed simulator called DSIM which can run on various architectures. A simulated test environment is used to verify and characterize the performance of DSIM. The results of the experiments indicate that speedup is application-dependent and, in DSIM's case, is also dependent on how the simulation model is distributed among the processors. Furthermore, the experiments reveal that the communication overhead of ethernet-based distributed systems makes it difficult to achieve reasonable speedup unless the simulation model is computation bound.

Goswami, Kumar K.↗
DOE OSTI2024

DECA: Discrete Event inspired Cellular Automata for grain structure prediction in additive manufacturing

Microstructure largely dictates macroscopic material properties and is strongly affected by processing. Therefore, the simulation of microstructure evolution in response to thermal fields during processing is of significant interest within the computational materials science community. Additive manufacturing (AM) has emerged as a technique for producing complex geometries and unique microstructures. Yet, complex and rapid thermal cycles in AM pose computational challenges for existing microstructure models. This work proposes a discrete event inspired cellular automata (CA) approach, titled DECA, to accelerate simulation of grain structure evolution in AM. In contrast to conventional time-stepped CA models, this model directly solves the times capture events would take place allowing for stepping in events rather than time (a technique also found in the field of discrete-event simulation). In comparison to purely serial discrete-event models, DECA allows for temporary violation of the causality constraint, but detects and corrects these violations, leading to an emergent phenomenon dubbed causality rippling, in which previously calculated capture events are overwritten. The amount of repeated calculations, defined by the capture ratio, is taken as a measure of computational inefficiency, and the model parameters that affect this ratio are evaluated. The new DECA approach was found to be more computationally efficient than conventional time-stepped CA models while guaranteeing an accurate solution, which can only be achieved in the conventional models for vanishingly small time steps. Finally, opportunities for parallelization and scaling of the new approach are discussed.

36 MATERIALS SCIENCE↗
NASA NTRS2004

Turnaround Time Modeling for Conceptual Rocket Engines

Recent years have brought about a paradigm shift within NASA and the Space Launch Community regarding the performance of conceptual design. Reliability, maintainability, supportability, and operability are no longer effects of design; they have moved to the forefront and are affecting design. A primary focus of this shift has been a planned decrease in vehicle turnaround time. Potentials for instituting this decrease include attacking the issues of removing, refurbishing, and replacing the engines after each flight. less, it is important to understand the operational affects of an engine on turnaround time, ground support personnel and equipment. One tool for visualizing this relationship involves the creation of a Discrete Event Simulation (DES). A DES model can be used to run a series of trade studies to determine if the engine is meeting its requirements, and, if not, what can be altered to bring it into compliance. Using DES, it is possible to look at the ways in which labor requirements, parallel maintenance versus serial maintenance, and maintenance scheduling affect the overall turnaround time. A detailed DES model of the Space Shuttle Main Engines (SSME) has been developed. Trades may be performed using the SSME Processing Model to see where maintenance bottlenecks occur, what the benefits (if any) are of increasing the numbers of personnel, or the number and location of facilities, in addition to trades previously mentioned, all with the goal of optimizing the operational turnaround time and minimizing operational cost. The SSME Processing Model was developed in such a way that it can easily be used as a foundation for developing DES models of other operational or developmental reusable engines. Performing a DES on a developmental engine during the conceptual phase makes it easier to affect the design and make changes to bring about a decrease in turnaround time and costs.

Nix, Michael↗
DOE OSTI2020

Robust Event Simulation Variants Endowed to Ns-3 for General Exploration

Sandia's ns-3 contributions are modifications to the open source ns-3 network simulator that enable simulation speedup. One improvement, for example, removes the need for simulating the transmission and receipt of packets between nodes that are too distant to actually be able to communicate. In large-scale simulations this optimization has shown significant gains in performance. Additional contributions will pave the way for parallel discrete simulation (PDES) in ns-3. SAND2020-12456 O Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Dickson, Joseph↗
DOE OSTI2022

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↗
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↗
NASA NTRS2004

A Re-programmable Platform for Dynamic Burn-in Test of Xilinx Virtexll 3000 FPGA for Military and Aerospace Applications

Field Programmable Gate Arrays (FPGA) have played increasingly important roles in military and aerospace applications. Xilinx SRAM-based FPGAs have been extensively used in commercial applications. They have been used less frequently in space flight applications due to their susceptibility to single-event upsets. Reliability of these devices in space applications is a concern that has not been addressed. The objective of this project is to design a fully programmable hardware/software platform that allows (but is not limited to) comprehensive static/dynamic burn-in test of Virtex-II 3000 FPGAs, at speed test and SEU test. Conventional methods test very few discrete AC parameters (primarily switching) of a given integrated circuit. This approach will test any possible configuration of the FPGA and any associated performance parameters. It allows complete or partial re-programming of the FPGA and verification of the program by using read back followed by dynamic test. Designers have full control over which functional elements of the FPGA to stress. They can completely simulate all possible types of configurations/functions. Another benefit of this platform is that it allows collecting information on elevation of the junction temperature as a function of gate utilization, operating frequency and functionality. A software tool has been implemented to demonstrate the various features of the system. The software consists of three major parts: the parallel interface driver, main system procedure and a graphical user interface (GUI).

Field Programmable Gate Arrays (FPGA)↗
NASA NTRS2003

FAST/Polar Conjunction Study of Field-Aligned Auroral Acceleration and Corresponding Magnetotail Drivers

The discrete aurora results when energized electrons bombard the Earth's atmosphere at high latitudes. This paper examines the physical processes that can cause field-aligned acceleration of plasma particles in the auroral region. A data and theoretical study has been carried out to examine the acceleration mechanisms that operate in the auroral zone and to identi@ the magnetospheric drivers of these acceleration mechanisms. The observations used in the study were collected by the Fast Auroral Snapshot (FAST) and Polar satellites when the two satellites were in approximate magnetic conjunction in the auroral region. During these events FAST was in the middle of the auroral zone and Polar was above the auroral zone in the near-Earth plasma sheet. Polar data were used to determine the conditions in the magnetotail at the time field-aligned acceleration was measured by FAST in the auroral zone. For each of the magnetotail drivers identified in the data study, the physics of field-aligned acceleration in the auroral region was examined using existing theoretical efforts and/or a long-system particle in cell simulation to model the magnetically connected region between the two satellites. Results from the study indicate that there are three main drivers of auroral acceleration: (1) field-aligned currents that lead to quasistatic parallel potential drops (parallel electric fields), (2) earthward flow of high-energy plasma beams from the magnetotail into the auroral zone that lead to quasistatic parallel potential drops, and (3) large-amplitude Alfven waves that propagate into the auroral region from the magnetotail. The events examined thus far confm the previously established invariant latitudinal dependence of the drivers and show a strong dependence on magnetic activity. Alfven waves tend to occur primarily at the poleward edge of the auroral region during more magnetically active times and are correlated with intense electron precipitation. At lower latitudes away from the poleward edge of the auroral zone is the primary field-aligned current region which results in the classical field- aligned acceleration associated with the auroral zone (electrons earthward and ion beams tailward). During times of high magnetic activity, high-energy ion beams originating from the magnetotail are observed within, and overlapping, the regions of primary and return field-aligned current. Along the field lines where the high-energy magnetotail ion beams are located, field-aligned acceleration can occur in the auroral zone leading to precipitating electrons and upwelling ionospheric ion beams. Field-aligned currents are present during both quiet and active times, while the Alfven waves and magnetotail ion beams were observed only during more magnetically active events.

Schriver, D.↗