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.

106 records · Page 6

Parallel computing in enterprise modeling.

This report presents the results of our efforts to apply high-performance computing to entity-based simulations with a multi-use plugin for parallel computing. We use the term 'Entity-based simulation' to describe a class of simulation which includes both discrete event simulation and agent based simulation. What simulations of this class share, and what differs from more traditional models, is that the result sought is emergent from a large number of contributing entities. Logistic, economic and social simulations are members of this class where things or people are organized or self-organize to produce a solution. Entity-based problems never have an a priori ergodic principle that will greatly simplify calculations. Because the results of entity-based simulations can only be realized at scale, scalable computing is de rigueur for large problems. Having said that, the absence of a spatial organizing principal makes the decomposition of the problem onto processors problematic. In addition, practitioners in this domain commonly use the Java programming language which presents its own problems in a high-performance setting. The plugin we have developed, called the Parallel Particle Data Model, overcomes both of these obstacles and is now being used by two Sandia frameworks: the Decision Analysis Center, and the Seldon social simulation facility. While the ability to engage U.S.-sized problems is now available to the Decision Analysis Center, this plugin is central to the success of Seldon. Because Seldon relies on computationally intensive cognitive sub-models, this work is necessary to achieve the scale necessary for realistic results. With the recent upheavals in the financial markets, and the inscrutability of terrorist activity, this simulation domain will likely need a capability with ever greater fidelity. High-performance computing will play an important part in enabling that greater fidelity.

97 MATHEMATICS AND COMPUTING↗

POLARIS: Agent-based modeling framework development and implementation for integrated travel demand and network and operations simulations

Here, we discuss the development of an agent-based modelling software development kit, and the implementation and validation of a model using it that integrates dynamic simulation of travel demand, network supply and network operations. A description is given of the core utilities in the kit: a parallel discrete event engine, interprocess exchange engine, and memory allocator, as well as a number of ancillary utilities: visualization library, database IO library, and scenario manager. The overall framework emphasizes the design goals of: generality, code agility, and high performance. This framework allows the modeling of several aspects of transportation system that are typically done with separate stand-alone software applications, in a high-performance and extensible manner. The issue of integrating such models as dynamic traffic assignment and disaggregate demand models has been a long standing issue for transportation modelers. The integrated approach shows a possible way to resolve this difficulty. The simulation model built from the POLARIS framework is a single, shared-memory process for handling all aspects of the integrated urban simulation. The resulting gains in computational efficiency and performance allow planning models to be extended to include previously separate aspects of the urban system, enhancing the utility of such models from the planning perspective. Lastly, initial tests with case studies involving traffic management center impacts on various network events such as accidents, congestion and weather events, show the potential of the system.

42 ENGINEERING↗

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↗

Billion-atom synchronous parallel kinetic Monte Carlo simulations of critical 3D Ising systems

An extension of the synchronous parallel kinetic Monte Carlo (spkMC) algorithm developed by Martinez et al. [J. Comp. Phys. 227 (2008) 3804] to discrete lattices is presented. The method solves the master equation synchronously by recourse to null events that keep all processors' time clocks current in a global sense. Boundary conflicts are resolved by adopting a chessboard decomposition into non-interacting sublattices. We find that the bias introduced by the spatial correlations attendant to the sublattice decomposition is within the standard deviation of serial calculations, which confirms the statistical validity of our algorithm. We have analyzed the parallel efficiency of spkMC and find that it scales consistently with problem size and sublattice partition. We apply the method to the calculation of scale-dependent critical exponents in billion-atom 3D Ising systems, with very good agreement with state-of-the-art multispin simulations.

97 MATHEMATICS AND COMPUTING↗

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.↗

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↗

EMAPS: An Efficient Multiscale Approach to Plasma Systems with Non-MHD Scale Effects

Using Discrete-Event Simulation (DES) as a novel paradigm for time integration of large-scale physics-driven systems, we have achieved significant breakthroughs in simulations of multi-dimensional magnetized plasmas where ion kinetic and finite Larmor radius (FLR) and Hall effects play a crucial role. For these purposes we apply a unique asynchronous simulation tool: a parallel, electromagnetic Particle-in-Cell (PIC) code, HYPERS (Hybrid Particle Event-Resolved Simulator), which treats plasma electrons as a charge neutralizing fluid and solves a self-consistent set of non-radiative Maxwell, electron fluid equations and ion particle equations on a structured computational grid. HYPERS enables adaptive local time steps for particles, fluid elements and electromagnetic fields. This ensures robustness (stability) and efficiency (speed) of highly dynamic and nonlinear simulations of compact plasma systems such spheromaks, FRCs, ion beams and edge plasmas. HYPERS is a unique asynchronous code that has been designed to serve as a test bed for developing multi-physics applications not only for laboratory plasma devices but generally across a number of plasma physics fields, including astrophysics, space physics and electronic devices. We have made significant improvements to the HYPERS core: (1) implemented a new asynchronous magnetic field integration scheme that preserves local divB=0 to within round-off errors; (2) Improved staggered-grid discretizations of electric and magnetic fields. These modifications have significantly enhanced the accuracy and robustness of 3D simulations. We have conducted first-ever end-to-end 3D simulations of merging spheromak plasmas. The preliminary results show: (1) tilt-driven relaxation of a freely expanding spheromak to an m=1 Taylor helix configuration and (2) possibility of formation of a tilt-stable field-reversed configuration via merging and magnetic reconnection of two double-sided spheromaks with opposite helicities.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

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↗

Extended MHD modeling of tearing-driven magnetic relaxation

Discrete relaxation events in reversed-field pinch relevant configurations are investigated numerically with nonlinear extended magnetohydrodynamic modeling, including the Hall term in Ohm’s law and first-order ion finite Larmor radius effects. Our results show variability among relaxation events, where the Hall dynamo effect may help or impede the MHD dynamo effect in relaxing the parallel current density profile. The competitive behavior arises from multi-helicity conditions where the dominant magnetic fluctuation is relatively small. The resulting changes in parallel current density and parallel flow are aligned in the core, consistent with experimental observations. Analysis of simulation results also confirms that force density from fluctuation-induced Reynolds stress arises subsequent to the drive from fluctuation-induced Lorentz force density. Transport of momentum density is found to be dominated by the fluctuation-induced Maxwell stress over most of the cross section with viscous and gyroviscous contributions being large in the edge region. The findings resolve a discrepancy with respect to the relative orientation of current density and flow relaxation, which had not been realized or investigated in Ref. [King et. al. Phys. Plasmas 19, 055905 (2012)], where only the magnitude of flow relaxation is actually consistent with experimental results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule provides a route to attain the compromise between accuracy and cost of PBMC methods. Further, in order to avoid double looping over all simulation particles when considering the two-particle events (typically, particle coagulation), the weighted majorant kernel is introduced to estimate the maximum coagulation rates being used for acceptance–rejection processes by single-looping over all particles, and meanwhile the mean time-step of coagulation event is estimated by summing the coagulation kernels of rejected and accepted particle pairs. The computational load of these fast differentially-weighted PBMC simulations (based on the Markov jump model) is reduced greatly to be proportional to the number of simulation particles in a zero-dimensional system (single cell). Finally, for a spatially inhomogeneous multi-dimensional (multi-cell) simulation, the proposed fast PBMC is performed in each cell, and multiple cells are parallel processed by multi-cores on a GPU that can implement the massively threaded data-parallel tasks to obtain remarkable speedup ratio (comparing with CPU computation, the speedup ratio of GPU parallel computing is as high as 200 in a case of 100 cells with 10 000 simulation particles per cell). These accelerating approaches of PBMC are demonstrated in a physically realistic Brownian coagulation case. The computational accuracy is validated with benchmark solution of discrete-sectional method. The simulation results show that the comprehensive approach can attain very favorable improvement in cost without sacrificing computational accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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)↗

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↗

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.↗