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.

79 records · Page 5

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↗

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↗

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↗