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 1,657 records · Page 92

Adaptive Critical Balance and Firehose Instability in an Expanding, Turbulent, Collisionless Plasma

Abstract Using a hybrid-kinetic particle-in-cell simulation, we study the evolution of an expanding, collisionless, magnetized plasma in which strong Alfvénic turbulence is persistently driven. Temperature anisotropy generated adiabatically by the plasma expansion (and consequent decrease in the mean magnetic-field strength) gradually reduces the effective elasticity of the field lines, causing reductions in the linear frequency and residual energy of the Alfvénic fluctuations. In response, these fluctuations modify their interactions and spatial anisotropy to maintain a scale-by-scale “critical balance” between their characteristic linear and nonlinear frequencies. Eventually the plasma becomes unstable to kinetic firehose instabilities, which excite rapidly growing magnetic fluctuations at ion-Larmor scales. The consequent pitch-angle scattering of particles maintains the temperature anisotropy near marginal stability, even as the turbulent plasma continues to expand. The resulting evolution of parallel and perpendicular temperatures does not satisfy double-adiabatic conservation laws, but is described accurately by a simple model that includes anomalous scattering. Our results have implications for understanding the complex interplay between macro- and microscale physics in various hot, dilute, astrophysical plasmas, and offer predictions concerning power spectra, residual energy, ion-Larmor-scale spectral breaks, and non-Maxwellian features in ion distribution functions that may be tested by measurements taken in high-beta regions of the solar wind.

79 ASTRONOMY AND ASTROPHYSICS↗

Interlocked optimization and fast gradient algorithm for a seismic inverse problem

Highlights: {yields} A 2D extension of the 1D nonlinear inversion of well-seismic data is given. {yields} Appropriate regularization yields a well-determined large scale inverse problem. {yields} An interlocked optimization loop acts as an efficient preconditioner. {yields} The adjoint state method is used to compute the misfit function gradient. {yields} Domain decomposition method yields an efficient parallel implementation. - Abstract: We give a nonlinear inverse method for seismic data recorded in a well from sources at several offsets from the borehole in a 2D acoustic framework. Given the velocity field, approximate values of the impedance are recovered. This is a 2D extension of the 1D inversion of vertical seismic profiles . The inverse problem generates a large scale undetermined ill-conditioned problem. Appropriate regularization terms render the problem well-determined. An interlocked optimization algorithm yields an efficient preconditioning. A gradient algorithm based on the adjoint state method and domain decomposition gives a fast parallel numerical method. For a realistic test case, convergence is attained in an acceptable time with 128 processors.

97 MATHEMATICS AND COMPUTING↗

Stable parallel training of Wasserstein conditional generative adversarial neural networks

In this work, we propose a stable, parallel approach to train Wasserstein conditional generative adversarial neural networks (W-CGANs) under the constraint of a fixed computational budget. Differently from previous distributed GANs training techniques, our approach avoids inter-process communications, reduces the risk of mode collapse and enhances scalability by using multiple generators, each one of them concurrently trained on a single data label. The use of the Wasserstein metric also reduces the risk of cycling by stabilizing the training of each generator. We illustrate the approach on the CIFAR10, CIFAR100, and ImageNet1k datasets, three standard benchmark image datasets, maintaining the original resolution of the images for each dataset. Performance is assessed in terms of scalability and final accuracy within a limited fixed computational time and computational resources. To measure accuracy, we use the inception score, the Fréchet inception distance, and image quality. An improvement in inception score and Fréchet inception distance is shown in comparison to previous results obtained by performing the parallel approach on deep convolutional conditional generative adversarial neural networks as well as an improvement of image quality of the new images created by the GANs approach. Weak scaling is attained on both datasets using up to 2000 NVIDIA V100 GPUs on the OLCF supercomputer Summit.

97 MATHEMATICS AND COMPUTING↗

Detailed Modeling, Design, and Evaluation of a Scalable Multi-level Checkpointing System

High-performance computing (HPC) systems are growing more powerful by utilizing more hardware components. As the system mean-time-before-failure correspondingly drops, applications must checkpoint more frequently to make progress. However, as the system memory sizes grow faster than the bandwidth to the parallel file system, the cost of checkpointing begins to dominate application run times. A potential solution to this problem is to use multi-level checkpointing, which employs multiple types of checkpoints with different costs and different levels of resiliency in a single run. The goal is to design light-weight checkpoints to handle the most common failure modes and rely on more expensive checkpoints for less common, but more severe failures. While this approach is theoretically promising, it has not been fully evaluated in a large-scale, production system context. To this end we have designed a system, called the Scalable Checkpoint/Restart (SCR) library, that writes checkpoints to storage on the compute nodes utilizing RAM, Flash, or disk, in addition to the parallel file system. We present the performance and reliability properties of SCR as well as a probabilistic Markov model that predicts its performance on current and future systems. We show that multi-level checkpointing improves efficiency on existing large-scale systems and that this benefit increases as the system size grows. In particular, we developed low-cost checkpoint schemes that are 100x-1000x faster than the parallel file system and effective against 85% of our system failures. This leads to a gain in machine efficiency of up to 35%, and it reduces the the load on the parallel file system by a factor of two on current and future systems.

99 GENERAL AND MISCELLANEOUS↗

Community Detection on the GPU

We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune the load balance when processing networks with nodes of highly varying degrees. This is achieved by scaling the number of threads assigned to each node according to its degree. Extensive experiments show that we obtain speedups up to a factor of 270 compared to the sequential algorithm. The algorithm consistently outperforms other recent shared memory implementations and is only one order of magnitude slower than the current fastest parallel Louvain method running on a Blue Gene/Q supercomputer using more than 500K threads.

community detection↗

Parallel methodology to capture cyclic variability in motored engines

Numerical prediction of of cycle-to-cycle variability (CCV) in SI engines is extremely challenging for two key reasons: (i) high-fidelity methods such as large eddy simulation (LES) are require to accurately capture the in-cylinder turbulent flowfield, and (ii) CCV is experienced over long timescales and hence the simulations need to be performed for hundreds of consecutive cycles. In this study, a new methodology is proposed to dissociate this long time-scale problem into several shorter time-scale problems, which can considerably reduce the computational time without sacrificing the fidelity of the simulations. The strategy is to perform multiple single-cycle simulations in parallel by effectively perturbing the simulation parameters such as the initial and boundary conditions. It is shown that by perturbing the initial velocity field effectively based on the intensity of the in-cylinder turbulence, the mean and variance of the in-cylinder flowfield is captured reasonably well. Adding perturbations in the initial pressure field and the boundary pressure improves the predictions. It is shown that this new approach is able to give accurate predictions of the flowfield statistics in less than one-tenth of time required for the conventional approach of simulating consecutive engine cycles.

33 ADVANCED PROPULSION SYSTEMS↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

Scalable subsurface inverse modeling of huge data sets with an application to tracer concentration breakthrough data from magnetic resonance imaging

When characterizing subsurface properties is crucial for reliable and cost-effective groundwater supply management and contaminant remediation. With recent advances in sensor technology, large volumes of hydro-geophysical and geochemical data can be obtained to achieve high-resolution images of subsurface properties. However, characterization with such a large amount of information requires prohibitive computational costs associated with “big data” processing and numerous large-scale numerical simulations. To tackle such difficulties, the Principal Component Geostatistical Approach (PCGA) has been proposed as a “Jacobian-free” inversion method that requires much smaller forward simulation runs for each iteration than the number of unknown parameters and measurements needed in the traditional inversion methods. PCGA can be conveniently linked to any multi-physics simulation software with independent parallel executions. In our paper, we extend PCGA to handle a large number of measurements (e.g. 106 or more) by constructing a fast preconditioner whose computational cost scales linearly with the data size. For illustration, we characterize the heterogeneous hydraulic conductivity (K) distribution in a laboratory-scale 3-D sand box using about 6 million transient tracer concentration measurements obtained using magnetic resonance imaging. Since each individual observation has little information on the K distribution, the data was compressed by the zero-th temporal moment of breakthrough curves, which is equivalent to the mean travel time under the experimental setting. Moreover, only about 2,000 forward simulations in total were required to obtain the best estimate with corresponding estimation uncertainty, and the estimated K field captured key patterns of the original packing design, showing the efficiency and effectiveness of the proposed method. This article is protected by copyright. All rights reserved.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Synchronous parallel spatially resolved stochastic cluster dynamics

In this work, a spatially resolved stochastic cluster dynamics (SRSCD) model for radiation damage accumulation in metals is implemented using a synchronous parallel kinetic Monte Carlo algorithm. The parallel algorithm is shown to significantly increase the size of representative volumes achievable in SRSCD simulations of radiation damage accumulation. Additionally, weak scaling performance of the method is tested in two cases: (1) an idealized case of Frenkel pair diffusion and annihilation, and (2) a characteristic example problem including defect cluster formation and growth in α-Fe. For the latter case, weak scaling is tested using both Frenkel pair and displacement cascade damage. To improve scaling of simulations with cascade damage, an explicit cascade implantation scheme is developed for cases in which fast-moving defects are created in displacement cascades. For the first time, simulation of radiation damage accumulation in nanopolycrystals can be achieved with a three dimensional rendition of the microstructure, allowing demonstration of the effect of grain size on defect accumulation in Frenkel pair-irradiated α-Fe.

36 MATERIALS SCIENCE↗

Analysis of a multi-machine database on divertor heat fluxes

A coordinated effort to measure divertor heat flux characteristics in fully attached, similarly shaped H-mode plasmas on C-Mod, DIII-D, and NSTX was carried out in 2010 in order to construct a predictive scaling relation applicable to next step devices including ITER, FNSF, and DEMO. Few published scaling laws are available and those that have been published were obtained under widely varying conditions and divertor geometries, leading to conflicting predictions for this critically important quantity. This study was designed to overcome these deficiencies. Analysis of the combined data set reveals that the primary dependence of the parallel heat flux width is robustly inverse with I{sub p}, which all three tokamaks independently demonstrate. An improved Thomson scattering system on DIII-D has yielded very accurate scrape off layer (SOL) profile measurements from which tests of parallel transport models have been made. It is found that a flux-limited model agrees best with the data at all collisionalities, while a Spitzer resistivity model agrees at higher collisionality where it is more valid. The SOL profile measurements and divertor heat flux scaling are consistent with a heuristic drift based model as well as a critical gradient model.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

REPRODUCTION OF THE OBSERVED TWO-COMPONENT MAGNETIC HELICITY IN SOLAR WIND TURBULENCE BY A SUPERPOSITION OF PARALLEL AND OBLIQUE ALFVEN WAVES

The angular distribution of the normalized reduced magnetic helicity density ({sigma} r{sub m}) in solar wind turbulence reveals two components of distinct polarity in different angle ranges. This kind of two-component {sigma}{sup r}{sub m} may indicate the possible wave modes and power spectral densities (PSDs) of the turbulent fluctuations. Here we model the measured angular distribution of {sigma}{sup r}{sub m} by assuming a PSD distribution for Alfven fluctuations in wavevector space, and then fit the model results to the observations by adjusting the pattern of the PSD distribution. It is found that the two-component form of the PSD, which has a major and minor component close to k and k{sub ||}, respectively, seems to be responsible for the observed two-component {sigma}{sup r}{sub m}. On the other hand, both an isotropic PSD and a PSD with only a single component bending toward k fail to reproduce the observations. Moreover, it is shown that the effect of gradual balance between outward and inward wave-energy fluxes with decreasing spatial scale needs to be considered in order to reproduce the observed diminishing of |{sigma}{sup r}{sub m}| at shorter scales. Therefore, we suggest that the observed two-component {sigma}{sup r}{sub m} in the solar wind turbulence may be due to a superposition of Alfven waves with quasi-perpendicular (major part) and quasi-parallel (minor part) propagation. The waves seem to become gradually balanced toward shorter scales.

79 ASTRONOMY AND ASTROPHYSICS↗

On Parallelizing Single Dynamic Simulation Using HPC Techniques and APIs of Commercial Software

Time-domain simulations are heavily used in today’s planning and operation practices to assess power system transient stability and post-transient voltage/frequency profiles following severe contingencies to comply with industry standards. Because of the increased modeling complexity, it is several times slower than real time for state-of-the-art commercial packages to complete a dynamic simulation for a large-scale model. With the growing stochastic behavior introduced by emerging technologies, power industry has seen a growing need for performing security assessment in real time. This paper presents a parallel implementation framework to speed up a single dynamic simulation by leveraging the existing stability model library in commercial tools through their application programming interfaces (APIs). Several high performance computing (HPC) techniques are explored such as parallelizing the calculation of generator current injection, identifying fast linear solvers for network solution, and parallelizing data outputs when interacting with APIs in the commercial package, TSAT. The proposed method has been tested on a WECC planning base case with detailed synchronous generator models and exhibits outstanding scalable performance with sufficient accuracy.

Diao, Ruisheng↗

Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

VeloxChem: A Python-driven density-functional theory program for spectroscopy simulations in high-performance computing environments

An open-source program named VeloxChem has been developed for the calculation of electronic real and complex linear response functions at the levels of Hartree–Fock and Kohn–Sham density functional theories. With an object-oriented program structure written in a Python/C++ layered fashion, VeloxChem enables time-efficient prototyping of novel scientific approaches without sacrificing computational efficiency, so that molecular systems involving up to and beyond 500 second-row atoms (or some 10,000 contracted and in part diffuse Gaussian basis functions) can be routinely addressed. In addition, VeloxChem is equipped with a polarizable embedding scheme for the treatment of the classical electrostatic interactions with an environment that in turn is modeled by atomic site charges and polarizabilities. The underlying hybrid message passing interface (MPI)/open multiprocessing (OpenMP) parallelization scheme makes VeloxChem suitable for execution in high-performance computing cluster environments, showing even slightly beyond linear scaling for the Fock matrix construction with use of up to 16,384 central processing unit (CPU) cores. An efficient—with respect to convergence rate and overall computational cost—multifrequency/gradient complex linear response equation solver enables calculations not only of conventional spectra, such as visible/ultraviolet/X-ray electronic absorption and circular dichroism spectra, but also time-resolved linear response signals as due to ultra-short weak laser pulses.

97 MATHEMATICS AND COMPUTING↗

Performance Analysis of OpenSHMEM Applications with TAU Commander

The TAU Performance System® (TAU) is a powerful and highly versatile profiling and tracing tool ecosystem for performance engineering of parallel programs. Developed over the last twenty years, TAU has evolved with each new generation of HPC systems and scales efficiently to hundreds of thousands of cores. TAU’s organic growth has resulted in a loosely coupled software toolbox such that novice users first encountering TAU’s complexity and vast array of features are often intimidated and easily frustrated. To lower the barrier to entry for novice TAU users, ParaTools and the US Department of Energy have developed “TAU Commander,” a performance engineering workflow manager that facilitates a systematic approach to performance engineering, guides users through common profiling and tracing workflows, and offers constructive feedback in case of error. This work compares TAU and TAU Commander workflows for common performance engineering tasks in OpenSHMEM applications and demonstrates workflows targeting two different SHMEM implementations, Intel Xeon “Haswell” and “Knights Landing” processors, direct and indirect measurement methods, callsite, profiles, and traces.

97 MATHEMATICS AND COMPUTING↗

MBX V1.2: Accelerating Data-Driven Many-Body Molecular Dynamics Simulations

The MBX software provides an advanced platform for molecular dynamics simulations, leveraging state-of-the-art MB-pol and MB-nrg data-driven many-body potential energy functions. Developed over the past decade, these potential energy functions integrate physics-based and machine-learned many-body terms trained on electronic structure data calculated at the "gold standard" coupled-cluster level of theory. Recent advancements in MBX have focused on optimizing its performance, resulting in the release of MBX v1.2. While the inherently many-body nature of MB-pol and MB-nrg ensures high accuracy, it poses computational challenges. MBX v1.2 addresses these challenges with significant performance improvements, including enhanced parallelism that fully harnesses the power of modern multicore CPUs. In conclusion, these advancements enable simulations on nanosecond time scales for condensed-phase systems, significantly expanding the scope of high-accuracy, predictive simulations of complex molecular systems powered by data-driven many-body potential energy functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Strong magnetohydrodynamic turbulence with cross helicity

Magnetohydrodynamics (MHD) provides the simplest description of magnetic plasma turbulence in a variety of astrophysical and laboratory systems. MHD turbulence with nonzero cross helicity is often called imbalanced, as it implies that the energies of Alfven fluctuations propagating parallel and antiparallel the background field are not equal. Recent analytical and numerical studies have revealed that at every scale, MHD turbulence consists of regions of positive and negative cross helicity, indicating that such turbulence is inherently locally imbalanced. In this paper, results from high resolution numerical simulations of steady-state incompressible MHD turbulence, with and without cross helicity are presented. It is argued that the inertial range scaling of the energy spectra (E{sup +}-) of fluctuations moving in opposite directions is independent of the amount of cross helicity. When cross helicity is nonzero, E{sup +} and E{sup -} maintain the same scaling, but have differing amplitudes depending on the amount of cross helicity.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Polarized micro Raman scattering spectroscopy for curved edges of epitaxial graphene

This letter performed polarized microscopic laser Raman scattering spectroscopy on the curved edges of transferred epitaxial graphene on SiO{sub 2}/Si. The intensity ratio between the parallel and perpendicular polarized D band is evolved, providing a spectroscopy-based technique to probe the atomic-scale edge structures in graphene. A detailed analysis procedure for non-ideal disordered curved edges of graphene is developed combining the atomic-scale zigzag and armchair edge structures along with some point defects. These results could provide valuable information of the realistic edges of graphene at the atomic-scale that can strongly influence the performance of graphene-based nanodevices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗