Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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 199 records · Page 11

Magneto-Hydrodynamic Modeling in the Design and Interpretation of Wire Array Z-pinches

Magneto-hydrodynamic simulations provide a powerful tool for improving our understanding of the complex physical processes underlying the behavior of wire array Z-pinches. We show how, by using large scale parallel 3D simulations of the array as a whole, it is possible to encompass all of the important features of the wire ablation, implosion and stagnation phases and to observe how these phenomena control the X-ray pulse that is achieved. Comparison of code results with experimental data from the 'Z' and MAGPIE pulsed power generators is shown to provide a detailed benchmark test for the models. The simulation results are also used to highlight key areas for future research.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Summary Report of Working Group 2: Computation

The working group on computation addressed three physics areas: (i) plasma-based accelerators (laser-driven and beam-driven), (ii) high gradient structure-based accelerators, and (iii) electron beam sources and transport [1]. Highlights of the talks in these areas included new models of breakdown on the microscopic scale, new three-dimensional multipacting calculations with both finite difference and finite element codes, and detailed comparisons of new electron gun models with standard models such as PARMELA. The group also addressed two areas of advances in computation: (i) new algorithms, including simulation in a Lorentz-boosted frame that can reduce computation time orders of magnitude, and (ii) new hardware architectures, like graphics processing units and Cell processors that promise dramatic increases in computing power. Highlights of the talks in these areas included results from the first large-scale parallel finite element particle-in-cell code (PIC), many order-of-magnitude speedup of, and details of porting the VPIC code to the Roadrunner supercomputer. The working group featured two plenary talks, one by Brian Albright of Los Alamos National Laboratory on the performance of the VPIC code on the Roadrunner supercomputer, and one by David Bruhwiler of Tech-X Corporation on recent advances in computation for advanced accelerators. Highlights of the talk by Albright included the first one trillion particle simulations, a sustained performance of 0.3 petaflops, and an eight times speedup of science calculations, including back-scatter in laser-plasma interaction. Highlights of the talk by Bruhwiler included simulations of 10 GeV accelerator laser wakefield stages including external injection, new developments in electromagnetic simulations of electron guns using finite difference and finite element approaches.

43 PARTICLE ACCELERATORS↗

Calculating potential energy curves with fixed-node diffusion Monte Carlo: CO and N 2

This study reports on the prospect for the routine use of Quantum Monte Carlo (QMC) for the electronic structure problem, applying fixed-node Diffusion Monte Carlo (DMC) to generate highly accurate Born-Oppenheimer potential energy curves (PECs) for small molecular systems. The singlet ground electronic states of CO and N 2 were used as test cases. The PECs obtained by DMC employing multiconfigurational trial wavefunctions were compared with those obtained by conventional high-accuracy electronic structure methods such as multireference configuration interaction and/or the best available empirical spectroscopic curves. The goal was to test whether a straightforward procedure using available QMC codes could be applied robustly and reliably. Results obtained with DMC codes were found to be in close agreement with the benchmark PECs, and the n 3 scaling with the number of electrons (compared with n 7 or worse for conventional high-accuracy quantum chemistry) could be advantageous depending on the system size. Due to a large pre-factor in the scaling, for the small systems tested here, it is currently still much more computationally intensive to compute PECs with QMC. Nevertheless, QMC algorithms are particularly well-suited to large-scale parallelization and are therefore likely to become more relevant for future massively parallel hardware architectures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling of a chain of three plasma accelerator stages with the WarpX electromagnetic PIC code on GPUs

The fully electromagnetic particle-in-cell code WarpX is being developed by a team of the U.S. DOE Exascale Computing Project (with additional non-U.S. collaborators on part of the code) to enable the modeling of chains of tens to hundreds of plasma accelerator stages on exascale supercomputers, for future collider designs. The code is combining the latest algorithmic advances (e.g., Lorentz boosted frame and pseudo-spectral Maxwell solvers) with mesh refinement and runs on the latest computer processing unit and graphical processing unit (GPU) architectures. In this paper, we summarize the strategy that was adopted to port WarpX to GPUs, report on the weak parallel scaling of the pseudo-spectral electromagnetic solver, and then present solutions for decreasing the time spent in data exchanges from guard regions between subdomains. In Sec. IV, we demonstrate the simulations of a chain of three consecutive multi-GeV laser-driven plasma accelerator stages.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

ETG turbulence in a tokamak pedestal

This paper explores the fundamental characteristics of electron-temperature-gradient (ETG)-driven turbulence in the tokamak pedestal. The extreme gradients in the pedestal produce linear instabilities and nonlinear turbulence that are distinct from the corresponding ETG phenomenology in the core plasma. The linear system exhibits multiple (greater than ten) unstable eigenmodes at each perpendicular wave vector, representing different toroidal and slab branches of the ETG instability. Proper orthogonal decomposition of the nonlinear fluctuations reveals no clear one-to-one correspondence between the linear and nonlinear modes for most wave vectors. Moreover, nonlinear frequencies deviate strongly from those of the linear instabilities, with spectra peaking at positive frequencies, which is opposite the sign of the ETG instability. The picture that emerges is one in which the linear properties are preserved only in a narrow range of k-space. Outside this range, nonlinear processes produce strong deviations from both the linear frequencies and eigenmode structures. This is interpreted in the context of critical balance, which enforces alignment between the parallel scales and fluctuation frequencies. We also investigate the nonlinear saturation processes. We observe a direct energy cascade from the injection scale to smaller scales in both perpendicular directions. However, in the bi-normal direction, there is also nonlocal inverse energy transfer to larger scales. Neither streamers nor zonal flows dominate the saturation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A NEW MONTE CARLO METHOD FOR TIME-DEPENDENT NEUTRINO RADIATION TRANSPORT

Monte Carlo approaches to radiation transport have several attractive properties such as simplicity of implementation, high accuracy, and good parallel scaling. Moreover, Monte Carlo methods can handle complicated geometries and are relatively easy to extend to multiple spatial dimensions, which makes them potentially interesting in modeling complex multi-dimensional astrophysical phenomena such as core-collapse supernovae. The aim of this paper is to explore Monte Carlo methods for modeling neutrino transport in core-collapse supernovae. We generalize the Implicit Monte Carlo photon transport scheme of Fleck and Cummings and gray discrete-diffusion scheme of Densmore et al. to energy-, time-, and velocity-dependent neutrino transport. Using our 1D spherically-symmetric implementation, we show that, similar to the photon transport case, the implicit scheme enables significantly larger timesteps compared with explicit time discretization, without sacrificing accuracy, while the discrete-diffusion method leads to significant speed-ups at high optical depth. Our results suggest that a combination of spectral, velocity-dependent, Implicit Monte Carlo and discrete-diffusion Monte Carlo methods represents a robust approach for use in neutrino transport calculations in core-collapse supernovae. Our velocity-dependent scheme can easily be adapted to photon transport.

79 ASTRONOMY AND ASTROPHYSICS↗

CHARACTERIZING MAGNETIZED TURBULENCE IN M51

We use previously published high-resolution synchrotron polarization data to perform an angular dispersion analysis with the aim of characterizing magnetized turbulence in M51. We first analyze three distinct regions (the center of the galaxy, and the northwest and southwest spiral arms) and can clearly discern the turbulent correlation length scale from the width of the magnetized turbulent correlation function for two regions and detect the imprint of anisotropy in the turbulence for all three. Furthermore, analyzing the galaxy as a whole allows us to determine a two-dimensional Gaussian model for the magnetized turbulence in M51. We measure the turbulent correlation scales parallel and perpendicular to the local mean magnetic field to be, respectively, {delta}{sub ||} = 98 {+-} 5 pc and {delta} = 54 {+-} 3 pc, while the turbulent-to-ordered magnetic field strength ratio is found to be B{sub t}/B{sub 0} = 1.01 {+-} 0.04. These results are consistent with those of Fletcher et al., who performed a Faraday rotation dispersion analysis of the same data, and our detection of anisotropy is consistent with current magnetized turbulence theories.

79 ASTRONOMY AND ASTROPHYSICS↗

DIRECT NUMERICAL SIMULATIONS OF REFLECTION-DRIVEN, REDUCED MAGNETOHYDRODYNAMIC TURBULENCE FROM THE SUN TO THE ALFVÉN CRITICAL POINT

We present direct numerical simulations of inhomogeneous reduced magnetohydrodynamic (RMHD) turbulence between the Sun and the Alfvén critical point. These are the first such simulations that take into account the solar-wind outflow velocity and the radial inhomogeneity of the background solar wind without approximating the nonlinear terms in the governing equations. RMHD turbulence is driven by outward-propagating Alfvén waves (z {sup +} fluctuations) launched from the Sun, which undergo partial non-WKB reflection to produce sunward-propagating Alfvén waves (z {sup –} fluctuations). We present 10 simulations with different values of the correlation time τ{sub c{sub sun}{sup +}} and perpendicular correlation length L{sub ☉} of outward-propagating Alfvén waves at the coronal base. We find that between 15% and 33% of the z {sup +} energy launched into the corona dissipates between the coronal base and Alfvén critical point. Between 33% and 40% of this input energy goes into work on the solar-wind outflow, and between 22% and 36% escapes as z {sup +} fluctuations through the simulation boundary at r = r{sub A}. The z {sup ±} power spectra scale like k{sub perpendicular}{sup -α{sup ±}}, where k is the wavenumber in the plane perpendicular to B{sub 0}. In our simulation with the smallest value of τ{sub c{sub sun}{sup +}} (∼2 minutes) and largest value of L{sub ☉} (2 × 10{sup 4} km), we find that α{sup +} decreases approximately linearly with increasing ln (r), reaching a value of 1.3 at r = 11.1 R{sub ☉}. Our simulations with larger values of τ{sub c{sub sun}{sup +}} exhibit alignment between the contours of constant φ{sup +}, φ{sup –}, Ω{sub 0}{sup +}, and Ω{sub 0}{sup -}, where φ{sup ±} are the Elsässer potentials and Ω{sub 0}{sup ±} are the outer-scale parallel Elsässer vorticities.

79 ASTRONOMY AND ASTROPHYSICS↗

MPI-AMRVAC FOR SOLAR AND ASTROPHYSICS

In this paper, we present an update to the open source MPI-AMRVAC simulation toolkit where we focus on solar and non-relativistic astrophysical magnetofluid dynamics. We highlight recent developments in terms of physics modules, such as hydrodynamics with dust coupling and the conservative implementation of Hall magnetohydrodynamics. A simple conservative high-order finite difference scheme that works in combination with all available physics modules is introduced and demonstrated with the example of monotonicity-preserving fifth-order reconstruction. Strong stability-preserving high-order Runge-Kutta time steppers are used to obtain stable evolutions in multi-dimensional applications, realizing up to fourth-order accuracy in space and time. With the new distinction between active and passive grid cells, MPI-AMRVAC is ideally suited to simulate evolutions where parts of the solution are controlled analytically or have a tendency to progress into or out of a stationary state. Typical test problems and representative applications are discussed with an outlook toward follow-up research. Finally, we discuss the parallel scaling of the code and demonstrate excellent weak scaling up to 30, 000 processors, allowing us to exploit modern peta-scale infrastructure.

79 ASTRONOMY AND ASTROPHYSICS↗

Gravity, two times, tractors, Weyl invariance, and six-dimensional quantum mechanics

Fefferman and Graham showed some time ago that four-dimensional conformal geometries could be analyzed in terms of six-dimensional, ambient, Riemannian geometries admitting a closed homothety. Recently, it was shown how conformal geometry provides a description of physics manifestly invariant under local choices of unit systems. Strikingly, Einstein's equations are then equivalent to the existence of a parallel scale tractor (a six-component vector subject to a certain first order covariant constancy condition at every point in four-dimensional spacetime). These results suggest a six-dimensional description of four-dimensional physics, a viewpoint promulgated by the 2 times physics program of Bars. The Fefferman-Graham construction relies on a triplet of operators corresponding, respectively, to a curved six-dimensional light cone, the dilation generator and the Laplacian. These form an sp(2) algebra which Bars employs as a first class algebra of constraints in a six-dimensional gauge theory. In this article four-dimensional gravity is recast in terms of six-dimensional quantum mechanics by melding the 2 times and tractor approaches. This parent formulation of gravity is built from an infinite set of six-dimensional fields. Successively integrating out these fields yields various novel descriptions of gravity including a new four-dimensional one built from a scalar doublet, a tractor-vector multiplet and a conformal class of metrics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accurate and Scalable O(N) Algorithm for First-Principles Molecular-Dynamics Computations on Large Parallel Computers

We present the first truly scalable first-principles molecular dynamics algorithm with O(N) complexity and controllable accuracy, capable of simulating systems with finite band gaps of sizes that were previously impossible with this degree of accuracy. By avoiding global communications, we provide a practical computational scheme capable of extreme scalability. Accuracy is controlled by the mesh spacing of the finite difference discretization, the size of the localization regions in which the electronic wave functions are confined, and a cutoff beyond which the components of the overlap matrix can be omitted when computing selected elements of its inverse. We demonstrate the algorithm's excellent parallel scaling for up to 101 952 atoms on 23 328 processors, with a wall-clock time of the order of 1 min per molecular dynamics time step and numerical error on the forces of less than 7x10 -4 Ha/Bohr.

36 MATERIALS SCIENCE↗

Communication-Avoiding Parallel Sparse-Dense Matrix-Matrix Multiplication

Multiplication of a sparse matrix with a dense matrix is a building block of an increasing number of applications in many areas such as machine learning and graph algorithms. However, most previous work on parallel matrix multiplication considered only both dense or both sparse matrix operands. This paper analyzes the communication lower bounds and compares the communication costs of various classic parallel algorithms in the context of sparse-dense matrix-matrix multiplication. We also present new communication-avoiding algorithms based on a 1D decomposition, called 1.5D, which - while suboptimal in dense-dense and sparse-sparse cases - outperform the 2D and 3D variants both theoretically and in practice for sparse-dense multiplication. Our analysis separates one-time costs from per iteration costs in an iterative machine learning context. Experiments demonstrate speedups up to 100x over a baseline 3D SUMMA implementation and show parallel scaling over 10 thousand cores.

Koanantakool, Penporn↗

Scalable Reactive Molecular Dynamics Simulations for Computational Synthesis

Reactive molecular dynamics (MD) simulation is a powerful research tool for describing chemical reactions. We eliminate the speed-limiting charge iteration in MD with a novel extended-Lagrangian scheme. The extended-Lagrangian reactive MD (XRMD) code drastically improves energy conservation while substantially reducing time-to-solution. Furthermore, we introduce a new polarizable charge equilibration (PQEq) model to accurately predict atomic charges and polarization. The XRMD code based on hybrid message passing+multithreading achieves a weak-scaling parallel efficiency of 0.977 on 786 432 IBM Blue Gene/Q cores for a 67.6 billion-atom system. The performance is portable to the second-generation Intel Xeon Phi, Knights Landing. Blue Gene/Q simulations for the computational synthesis of materials via novel exfoliation mechanisms for synthesizing atomically thin transition metal dichalcogenide layers will dominate nanomaterials science in this century.

Simulation, Modeling, Performance, and Visualizati↗

Diagnosis of Performance Faults in LargeScale MPI Applications via Probabilistic Progress-Dependence Inference

Debugging large-scale parallel applications is challenging. Most existing techniques provide little information about failure root causes. Further, most debuggers significantly slow down program execution, and run sluggishly with massively parallel applications. This paper presents a novel technique that scalably infers the tasks in a parallel program on which a failure occurred, as well as the code in which it originated. Our technique combines scalable runtime analysis with static analysis to determine the least-progressed task(s) and to identify the code lines at which the failure arose. We present a novel algorithm that infers probabilistically progress dependence among MPI tasks using a globally constructed Markov model that represents tasks' control-flow behavior. In comparison to previous work, our algorithm infers more precisely the least-progressed task. Further, we combine this technique with static backward slicing analysis, further isolating the code responsible for the current state. A blind study demonstrates that our technique isolates the root cause of a concurrency bug in a molecular dynamics simulation, which only manifests itself at 7,996 tasks or more. We extensively evaluate fault coverage of our technique via fault injections in 10 HPC benchmarks and show that our analysis takes less than a few seconds on thousands of parallel tasks.

97 MATHEMATICS AND COMPUTING↗

Visualizing an Exascale Data Center Digital Twin: Considerations, Challenges and Opportunities

Digital twins are an excellent tool to model, visualize, and simulate complex systems, to understand and optimize their operation. In this work, we present the technical challenges of real-time visualization of a digital twin of the Frontier supercomputer.We show the initial prototype and current state of the twin and highlight technical design challenges of visualizing such a large High Performance Computing (HPC) system. The goal is to understand the use of augmented reality as a primary way to extract information and collaborate on digital twins of complex systems. This leverages the spatio-temporal aspect of a 3D representation of a digital twin, with the ability to view historical and real-time telemetry, triggering simulations of a system state and viewing the results, which can be augmented via dashboards for details. Finally, we discuss considerations and opportunities for augmented reality of digital twins of large-scale, parallel computers.

Maiterth, Matthias↗

Non-Galerkin Coarse Grids for Algebraic Multigrid

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

97 MATHEMATICS AND COMPUTING↗

Multigrid Reduction in Time for Nonlinear Parabolic Problems: A Case Study

The need for parallelism in the time dimension is being driven by changes in computer architectures, where performance increases are now provided through greater concurrency, not faster clock speeds. This creates a bottleneck for sequential time marching schemes because they lack parallelism in the time dimension. Multigrid reduction in time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficiency is defined as achieving similar performance when compared to an equivalent linear problem. The benchmark nonlinear problem is the p-Laplacian, where p=4 corresponds to a well-known nonlinear diffusion equation and p=2 corresponds to the standard linear diffusion operator, our benchmark linear problem. The key difficulty encountered is that the nonlinear time-step solver becomes progressively more expensive on coarser time levels as the time-step size increases. To overcome such difficulties, multigrid research has historically targeted an accumulated body of experience regarding how to choose an appropriate solver for a specific problem type. To that end, this paper develops a library of MGRIT optimizations and modifications, most important an alternate initial guess for the nonlinear time-step solver and delayed spatial coarsening, that will allow many nonlinear parabolic problems to be solved with parallel scaling behavior comparable to the corresponding linear problem.

parareal↗