Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel 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 595 records · Page 33

MS–STEM–FEM: A parallelized multi-slice fluctuation TEM simulation tool

Atomic configurations of glassy or amorphous materials containing medium-range order (MRO) may be identified by comparing fluctuation transmission electron microscopy (FTEM) measurements to FTEM simulations obtained using model configurations. Candidate model sizes have traditionally been much thinner than the samples measured experimentally, and publicly available FTEM simulation software has until now omitted microscope parameters, dynamical scattering, and the phase of the diffracted electron wave. We introduce MS–STEM–FEM, an open-source software package for simulating FTEM experiments using established multi-slice TEM simulation techniques to emulate experiment more closely by incorporating microscope parameters and simulating electron scattering and propagation as a complex valued wave. Simulations using established models are compared with results of experimental STEM–FEM to validate the software. Several statistical measures of diffraction are implemented and their responses to model features are compared. Dynamical scattering is found to be less influential than the variety of crystallite orientations which occur in thicker models. Simulations of variable resolution microscopy confirm that cumulative intensity of the FTEM signal decreases with reduced model MRO and increased coherence volume. In conclusion, advantageous model scaling characteristics and efficient processor performance scaling are demonstrated, along with a study of convergence with respect to pertinent simulation parameters to identify accuracy requirements.

36 MATERIALS SCIENCE↗

Exploiting Internal Parallelism for Address Translation in Solid-State Drives

Solid-state Drives (SSDs) have changed the landscape of storage systems and present a promising storage solution for data-intensive applications due to their low latency, high bandwidth, and low power consumption compared to traditional hard disk drives. SSDs achieve these desirable characteristics using internal parallelism—parallel access to multiple internal flash memory chips—and a Flash Translation Layer (FTL) that determines where data are stored on those chips so that they do not wear out prematurely. However, current state-of-the-art cache-based FTLs like the Demand-based Flash Translation Layer (DFTL) do not allow IO schedulers to take full advantage of internal parallelism, because they impose a tight coupling between the logical-to-physical address translation and the data access. In this study to address this limitation, we introduce a new FTL design called Parallel-DFTL that works with the DFTL to decouple address translation operations from data accesses. Parallel-DFTL separates address translation and data access operations into different queues, allowing the SSD to use concurrent flash accesses for both types of operations. We also present a Parallel-LRU cache replacement algorithm to improve the concurrency of address translation operations. To compare Parallel-DFTL against existing FTL approaches, we present a Parallel-DFTL performance model and compare its predictions against those for DFTL and an ideal page-mapping approach. We also implemented the Parallel-DFTL approach in an SSD simulator using real device parameters, and used trace-driven simulation to evaluate Parallel-DFTL’s efficacy. Our evaluation results show that Parallel-DFTL improved the overall performance by up to 32% for the real IO workloads we tested, and by up to two orders of magnitude with synthetic test workloads. Finally, we also found that Parallel-DFTL is able to achieve reasonable performance with a very small cache size and that it provides the best benefit for those workloads with large request size or with high write ratio.

97 MATHEMATICS AND COMPUTING↗

Editorial: Neuroscience, computing, performance, and benchmarks: Why it matters to neuroscience how fast we can compute

At the turn of the millennium the computational neuroscience community realized that neuroscience was in a software crisis: software development was no longer progressing as expected and reproducibility declined. The International Neuroinformatics Coordinating Facility (INCF) was inaugurated in 2007 as an initiative to improve this situation. The INCF has since pursued its mission to help the development of standards and best practices. In a community paper published this very same year, Brette et al. tried to assess the state of the field and to establish a scientific approach to simulation technology, addressing foundational topics, such as which simulation schemes are best suited for the types of models we see in neuroscience. In 2015, a Frontiers Research Topic “Python in neuroscience” by Muller et al. triggered and documented a revolution in the neuroscience community, namely in the usage of the scripting language Python as a common language for interfacing with simulation codes and connecting between applications. The review by Einevoll et al. documented that simulation tools have since further matured and become reliable research instruments used by many scientific groups for their respective questions. Open source and community standard simulators today allow research groups to focus on their scientific questions and leave the details of the computational work to the community of simulator developers. A parallel development has occurred, which has been barely visible in neuroscientific circles beyond the community of simulator developers: Supercomputers used for large and complex scientific calculations have increased their performance from ~10 TeraFLOPS (10 13 floating point operations per second) in the early 2000s to above 1 ExaFLOPS (10 18 floating point operations per second) in the year 2022. This represents a 100,000-fold increase in our computational capabilities, or almost 17 doublings of computational capability in 22 years. Moore's law (the observation that it is economically viable to double the number of transistors in an integrated circuit every other 18–24 months) explains a part of this; our ability and willingness to build and operate physically larger computers, explains another part. It should be clear, however, that such a technological advancement requires software adaptations and under the hood, simulators had to reinvent themselves and change substantially to embrace this technological opportunity. It actually is quite remarkable that—apart from the change in semantics for the parallelization—this has mostly happened without the users knowing. The current Research Topic was motivated by the wish to assemble an update on the state of neuroscientific software (mostly simulators) in 2022, to assess whether we can see more clearly which scientific questions can (or cannot) be asked due to our increased capability of simulation, and also to anticipate whether and for how long we can expect this increase of computational capabilities to continue.

biophysically detailed models↗

Facilitating Co-Design for Extreme-Scale Systems Through Lightweight Simulation

This work focuses on tools for investigating algorithm performance at extreme scale with millions of concurrent threads and for evaluating the impact of future architecture choices to facilitate the co-design of high-performance computing (HPC) architectures and applications. The approach focuses on lightweight simulation of extreme-scale HPC systems with the needed amount of accuracy. The prototype presented in this paper is able to provide this capability using a parallel discrete event simulation (PDES), such that a Message Passing Interface (MPI) application can be executed at extreme scale, and its performance properties can be evaluated. The results of an initial prototype are encouraging as a simple 'hello world' MPI program could be scaled up to 1,048,576 virtual MPI processes on a four-node cluster, and the performance properties of two MPI programs could be evaluated at up to 16,384 virtual MPI processes on the same system.

97 MATHEMATICS AND COMPUTING↗

Parallel exponential time differencing methods for geophysical flow simulations

Two ocean models are considered for geophysical flow simulations: the multilayer shallow water equations and the multilayer primitive equations. For the former, we investigate the parallel performance of exponential time differencing (ETD) methods, including exponential Rosenbrock–Euler, ETD2wave, and B-ETD2wave. For the latter, we take advantage of the splitting of barotropic and baroclinic modes and propose a new two-level method in which an ETD method is applied to solve the fast barotropic mode. Furthermore, these methods could improve the computational efficiency of numerical simulations because ETD methods allow for much larger time step sizes than traditional explicit time-stepping techniques that are commonly used in existing computational ocean models. Several standard benchmark tests for ocean modeling are performed and comparison of the numerical results demonstrates a great potential of applying the parallel ETD methods for simulating real-world geophysical flows.

54 ENVIRONMENTAL SCIENCES↗

TADSim: Discrete Event-based Performance Prediction for Temperature Accelerated Dynamics

Next-generation high-performance computing will require more scalable and flexible performance prediction tools to evaluate software--hardware co-design choices relevant to scientific applications and hardware architectures. Here, we present a new class of tools called application simulators—parameterized fast-running proxies of large-scale scientific applications using parallel discrete event simulation. Parameterized choices for the algorithmic method and hardware options provide a rich space for design exploration and allow us to quickly find well-performing software--hardware combinations. We demonstrate our approach with a TADSim simulator that models the temperature-accelerated dynamics (TAD) method, an algorithmically complex and parameter-rich member of the accelerated molecular dynamics (AMD) family of molecular dynamics methods. The essence of the TAD application is captured without the computational expense and resource usage of the full code. We accomplish this by identifying the time-intensive elements, quantifying algorithm steps in terms of those elements, abstracting them out, and replacing them by the passage of time. We use TADSim to quickly characterize the runtime performance and algorithmic behavior for the otherwise long-running simulation code. We extend TADSim to model algorithm extensions, such as speculative spawning of the compute-bound stages, and predict performance improvements without having to implement such a method. Validation against the actual TAD code shows close agreement for the evolution of an example physical system, a silver surface. Finally, focused parameter scans have allowed us to study algorithm parameter choices over far more scenarios than would be possible with the actual simulation. This has led to interesting performance-related insights and suggested extensions.

97 MATHEMATICS AND COMPUTING↗

MOOSE: A parallel computational framework for coupled systems of nonlinear equations.

Systems of coupled, nonlinear partial differential equations (PDEs) often arise in simulation of nuclear processes. MOOSE: Multiphysics Object Oriented Simulation Environment, a parallel computational framework targeted at the solution of such systems, is presented. As opposed to traditional data-flow oriented computational frameworks, MOOSE is instead founded on the mathematical principle of Jacobian-free Newton-Krylov (JFNK) solution methods. Utilizing the mathematical structure present in JFNK, physics expressions are modularized into `Kernels,'' allowing for rapid production of new simulation tools. In addition, systems are solved implicitly and fully coupled, employing physics based preconditioning, which provides great flexibility even with large variance in time scales. A summary of the mathematics, an overview of the structure of MOOSE, and several representative solutions from applications built on the framework are presented.

97 MATHEMATICS AND COMPUTING↗

Porting Adaptive Ensemble Molecular Dynamics Workflows to the Summit Supercomputer

Molecular dynamics (MD) simulations must take very small (femtosecond) integration steps in simulation-time to avoid numerical errors. Efficient use of parallel programming models and accelerators in state-of-the art MD programs now is pushing Moore’s limit for time-per-MD step. As a result, directly simulating timescales beyond milliseconds will not be attainable directly, even at exascale. However, concepts from statistical physics can be used to combine many parallel simulations to provide information about longer timescales and to adequately sample the simulation space, while preserving details about the dynamics of the system. Implementing such an approach requires a workflow program that allows adaptable steering of task assignments based on extensive statistical analysis of intermediate results. Here we report the implementation of such an adaptable workflow program to drive simulations on the Summit IBM Power System AC922, a pre-exascale supercomputer at the Oak Ridge Leadership Computing Facility (OLCF). We compare to experiences on Titan, Summit’s predecessor, report the performance of the workflow and its components, and describe the porting process. We find that using a workflow program managed by a Mongo database can provide the fault tolerance, scalable performance, task dispatch rate, and reconfigurability required for robust and portable implementation of ensemble simulations such as are used in enhanced-sampling molecular dynamics. This type of workflow generator can also be used to provide adaptive steering of ensemble simulations for other applications in addition to MD.

Ossyra, John R.↗

Analysis of coupled-bunch instabilities for the NSLS-II storage ring with a 500MHz 7-cell PETRA-III cavity

The NSLS-II storage ring is designed to operate with superconducting RF-cavities with the aim to store an average current of 500 mA distributed in 1080 bunches, with a gap in the uniform filling for ion clearing. At the early stage of the commissioning (phase 1), characterized by a bare lattice without damping wigglers and without Landau cavities, a normal conducting 7-cell PETRA-III RF-cavity structure has been installed with the goal to store an average current of 25 mA. In this paper we discuss our analysis of coupled-bunch instabilities driven by the Higher Order Modes (HOMs) of the 7-cell PETRA-III RF-cavity. As a cure of the instabilities, we apply a well-known scheme based on a proper detuning of the HOMs frequencies based upon cavity temperature change, and the use of the beneficial effect of the slow head–tail damping at positive chromaticity to increase the transverse coupled-bunch instability thresholds. In addition, we discuss measurements of coupled-bunch instabilities observed during the phase 1 commissioning of the NSLS-II storage ring. In our analysis we rely, in the longitudinal case, on the theory of coupled-bunch instability for uniform fillings, while in the transverse case we complement our studies with numerical simulations with OASIS, a novel parallel particle tracking code for self-consistent simulations of collective effects driven by short and long-range wakefields.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimal Run Strategies in Monte Carlo Iterated Fission Source Simulations

The method of successive generations used in Monte Carlo simulations of nuclear reactor models is known to suffer from intergenerational correlation between the spatial locations of fission sites. One consequence of the spatial correlation is that the convergence rate of the variance of the mean for a tally becomes worse than O(N–1). In this work, we consider how the true variance can be minimized given a total amount of work available as a function of the number of source particles per generation, the number of active/discarded generations, and the number of independent simulations. We demonstrate through both analysis and simulation that under certain conditions the solution time for highly correlated reactor problems may be significantly reduced either by running an ensemble of multiple independent simulations or simply by increasing the generation size to the extent that it is practical. However, if too many simulations or too large a generation size is used, the large fraction of source particles discarded can result in an increase in variance. We also show that there is a strong incentive to reduce the number of generations discarded through some source convergence acceleration technique. Furthermore, we discuss the efficient execution of large simulations on a parallel computer; we argue that several practical considerations favor using an ensemble of independent simulations over a single simulation with very large generation size.

correlation↗

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↗