Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Towards improved speed and accuracy of laser powder bed fusion simulations via representation of multiple time scales

Here, we report the result of investigations into alternative representations of the temporal evolution of the laser powder bed fusion (LPBF) process. In order to provide the reader with sufficient context for the following discussion, the modeling challenge and its underlying cause, as well as current attempts to provide a satisfactory solution, will be discussed. Next, the author will describe two numerical methods (multirate time integration and parallel-in-time) to better represent the temporal scales of the problem. Finally, the results of applying these methods to a two-dimensional version of the heat transfer portion of the LPBF problem will be presented, reporting on both convergence and performance behavior, which indicate the possibility of significant speedup of solution calculations (40–100 times), along with well-characterized effects on solution accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Path-accelerated stochastic molecular dynamics: Parallel-in-time integration using path integrals

Massively parallel computer architectures create new opportunities for the performance of long-time scale molecular dynamics (MD) simulations. Here, we introduce the path-accelerated molecular dynamics method that takes advantage of distributed computing to reduce the wall-clock time of MD simulation via parallelization with respect to stochastic MD time steps. The marginal distribution for the time evolution of a system is expressed in terms of a path integral, enabling the use of path sampling techniques to numerically integrate MD trajectories. By parallelizing the evaluation of the path action with respect to time and by initializing the path configurations from a nonequilibrium distribution, the algorithm enables significant speedups in terms of the length of MD trajectories that can be integrated in a given amount of wall-clock time. The method is demonstrated for Brownian dynamics, although it is generalizable to other stochastic equations of motion including open systems. We apply the method to two simple systems, a harmonic oscillator and a Lennard-Jones liquid, and we show that in comparison to the conventional Euler integration scheme for Brownian dynamics, the new method can reduce the wall-clock time for integrating trajectories of a given length by more than three orders of magnitude in the former system and more than two in the latter. This new method for parallelizing MD in the dimension of time can be trivially combined with algorithms for parallelizing the MD force evaluation to achieve further speedup.

Rosa-Raíces, Jorge L.↗
DOE OSTI2024

The inviscid incompressible limit of Kelvin–Helmholtz instability for plasmas

The Kelvin–Helmholtz Instability (KHI) is an interface instability that develops between two fluids or plasmas flowing with a common shear layer. KHI occurs in astrophysical jets, solar atmosphere, solar flows, cometary tails, planetary magnetospheres. Two applications of interest, encompassing both space and fusion applications, drive this study: KHI formation at the outer flanks of the Earth’s magnetosphere and KHI growth from non-uniform laser heating in magnetized direct-drive implosion experiments. Here, we study 2D KHI with or without a magnetic field parallel to the flow. We use both the GAMERA code, which solves the compressible Euler equations, and the STRATOSPEC code, which solves the Navier-Stokes equations under the Boussinesq approximation, coupled with the magnetic field dynamics. GAMERA is a global three-dimensional MHD code with high-order reconstruction in arbitrary nonorthogonal curvilinear coordinates, which is developed for a large range of astrophysical applications. STRATOSPEC is a three-dimensional pseudo-spectral code with an accuracy of infinite order (no numerical diffusion). Magnetized KHI is a canonical case for benchmarking hydrocode simulations with extended MHD options. An objective is to assess whether or not, and under which conditions, the incompressibility hypothesis allows to describe a dynamic compressible system. For comparing both codes, we reach the inviscid incompressible regime, by decreasing the Mach number in GAMERA, and viscosity and diffusion in STRATOSPEC. Here, we specifically investigate both single-mode and multi-mode initial perturbations, either with or without magnetic field parallel to the flow. The method relies on comparisons of the density fields, 1D profiles of physical quantities averaged along the flow direction, and scale-by-scale spectral densities. We also address the triggering, formation and damping of filamentary structures under varying Mach number or Atwood number, with or without a parallel magnetic field. Comparisons show very satisfactory results between the two codes. The vortices dynamics is well reproduced, along with the breaking or damping of small-scale structures. We end with the extraction of growth rates of magnetized KHI from the compressible regime to the incompressible limit in the linear regime assessing the effects of compressibility under increasing magnetic field. The observed differences between the two codes are explained either from diffusion or non-Boussinesq effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2017

In-memory integration of existing software components for parallel adaptive unstructured mesh workflows

Unstructured mesh methods, like finite elements and finite volumes, support the effective analysis of complex physical behaviors modeled by partial differential equations over general threedimensional domains. The most reliable and efficient methods apply adaptive procedures with a-posteriori error estimators that indicate where and how the mesh is to be modified. Although adaptive meshes can have two to three orders of magnitude fewer elements than a more uniform mesh for the same level of accuracy, there are many complex simulations where the meshes required are so large that they can only be solved on massively parallel systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Wavefront shaping with a Hadamard basis for scattering soil imaging

Here, soil is a scattering medium that inhibits imaging of plant-microbial-mineral interactions that are essential to plant health and soil carbon sequestration. However, optical imaging in the complex medium of soil has been stymied by the seemingly intractable problems of scattering and contrast. Here, we develop a wavefront shaping method based on adaptive stochastic parallel gradient descent optimization with a Hadamard basis to focus light through soil mineral samples. Our approach allows a sparse representation of the wavefront with reduced dimensionality for the optimization. We further divide the used Hadamard basis set into subsets and optimize a certain subset at once. Simulation and experimental optimization results demonstrate our method has an approximately seven times higher convergence rate and overall better performance compared to that with optimizing all pixels at once. The proposed method can benefit other high-dimensional optimization problems in adaptive optics and wavefront shaping.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

CSB-RNN: A Faster-Than-Realtime RNN Acceleration Framework with Compressed Structured Blocks

Recurrent Neural Networks (RNN) is widely applied to temporal sequence analysis, where real-time performance is usually in demand. However, RNN suffers a heavy computational workload as the model comes with a large weight matrix. To alleviate the pain, model compression (pruning) schemes have been proposed for RNN that pruning the redundant (near-zero) weight-values. On the one hand, the non-structured pruning methods achieve a considerable pruning rate while bringing the computational irregularity, which is un-friendly to parallel-hardware. On the other hand, the existing structured pruning methods consider the hardware parallelism; However, they suffer a poor pruning rate due to the restrict constraints on pruning structure. This paper presents CSB-RNN, an optimized full-stack RNN framework with the novel compressed structured block (CSB) technique. The CSB-pruned RNN model comes with both fine-granularity that benefits the pruning rate and regular structure that facilitates the hardware-parallelism. Further, we propose a novel hardware architecture for inferencing the CSB-pruned model. Different from conventional parallel hardware, this architecture solves the block-workload imbalance issue and achieves an over 95% hardware utilization. With the experiments on 10 RNN models in 5 application domains, the CSB-RNN realizes 7×-20× lossless compression and up to 50× acceptable lossy-compression, which is 2×-7× to the prior art. With the addition of the novel hardware, the compressed-RNN inference reaches a super real-time latency of 10-400µs with FPGA implementation.

Shi, Runbin↗
DOE OSTI2019

A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation

The central importance of large scale eigenvalue problems in scientific computation necessitates the development massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Low-synch Gram–Schmidt with delayed reorthogonalization for Krylov solvers

The parallel strong-scaling of iterative methods is often determined by the number of global reductions at each iteration. Low-synch Gram-Schmidt algorithms are applied here to the Arnoldi algorithm to reduce the number of global reductions and therefore to improve the parallel strong-scaling of iterative solvers for nonsymmetric matrices such as the GMRES and the Krylov-Schur iterative methods. In the Arnoldi context, the factorization is "left-looking" and processes one column at a time. Among the methods for generating an orthogonal basis for the Arnoldi algorithm, the classical Gram-Schmidt algorithm, with reorthogonalization (CGS2) requires three global reductions per iteration. A new variant of CGS2 that requires only one reduction per iteration is presented and applied to the Arnoldi algorithm. Delayed CGS2 (DCGS2) employs the minimum number of global reductions per iteration (one) for a one-column at-a-time algorithm. The main idea behind the new algorithm is to group global reductions by rearranging the order of operations. DCGS2 must be carefully integrated into an Arnoldi expansion or a GMRES solver. Numerical stability experiments assess robustness for Krylov-Schur eigenvalue computations. Performance experiments on the ORNL Summit supercomputer then establish the superiority of DCGS2 over CGS2.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

DeepHyper: Asynchronous Hyperparameter Search for Deep Neural Networks

Hyperparameters employed by deep learning (DL) methods play a substantial role in the performance and reliability of these methods in practice. Unfortunately, finding performance-optimizing hyperparameter settings is a notoriously difficult task. Hyperparameter search methods typically have limited production-strength implementations or do not target scalability within a highly parallel machine, portability across different machines, experimental comparison between different methods, and tighter integration with workflow systems. In this paper, we present DeepHyper, a Python package that provides a common interface for the implementation and study of scalable hyperparameter search methods. It adopts the Balsam workflow system to hide the complexities of running large numbers of hyperparameter configurations in parallel on high-performance computing (HPC) systems. We implement and study asynchronous model-based search methods that consist of sampling a small number of input hyperparameter configurations and progressively fitting surrogate models over the input-output space until exhausting a user-defined budget of evaluations. We evaluate the efficacy of these methods relative to approaches such as random search, genetic algorithms, Bayesian optimization, and hyperband on DL benchmarks on CPU- and GPU-based HPC systems.

Balaprakash, Prasanna↗
DOE OSTI2024

PySAGES: flexible, advanced sampling methods accelerated with GPUs

Abstract Molecular simulations are an important tool for research in physics, chemistry, and biology. The capabilities of simulations can be greatly expanded by providing access to advanced sampling methods and techniques that permit calculation of the relevant underlying free energy landscapes. In this sense, software that can be seamlessly adapted to a broad range of complex systems is essential. Building on past efforts to provide open-source community-supported software for advanced sampling, we introduce PySAGES, a Python implementation of the Software Suite for Advanced General Ensemble Simulations (SSAGES) that provides full GPU support for massively parallel applications of enhanced sampling methods such as adaptive biasing forces, harmonic bias, or forward flux sampling in the context of molecular dynamics simulations. By providing an intuitive interface that facilitates the management of a system’s configuration, the inclusion of new collective variables, and the implementation of sophisticated free energy-based sampling methods, the PySAGES library serves as a general platform for the development and implementation of emerging simulation techniques. The capabilities, core features, and computational performance of this tool are demonstrated with clear and concise examples pertaining to different classes of molecular systems. We anticipate that PySAGES will provide the scientific community with a robust and easily accessible platform to accelerate simulations, improve sampling, and enable facile estimation of free energies for a wide range of materials and processes.

Chemistry↗
DOE OSTI2017

A backward Monte-Carlo method for time-dependent runaway electron simulations

Kinetic descriptions of runaway electrons (REs) are usually based on Fokker-Planck models that determine the probability distribution function of REs in 2-dimensional momentum space. Despite the simplification involved, the Fokker-Planck equation can rarely be solved analytically and direct numerical approaches [e.g., continuum and particle-based Monte Carlo (MC)] can be time consuming, especially in the computation of asymptotic-type observables including the runaway probability, the slowing-down and runaway mean times, and the energy limit probability. In this study, we present a novel backward MC approach to these problems based on backward stochastic differential equations that describe the dynamics of the runaway probability by means of the Feynman-Kac theory. The key ingredient of the backward MC algorithm is to place all the particles in a runaway state and simulate them backward from the terminal time to the initial time. As such, our approach can provide much faster convergence than direct MC methods (by significantly reducing the number of particles required to achieve a prescribed accuracy) while at the same time maintaining the advantages of particle-based methods (compared to continuum approaches). The proposed algorithm is unconditionally stable and can be parallelized as easy as the direct MC method, and its extension to dimensions higher than two is straightforward, thus paving the way for conducting large-scale RE simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2025

Effect of sintering temperature on adhesion of spray-on piezoelectric transducers

Conventionally sol-gel spray-on transducers require a high-temperature (> 700 ◦C) sintering process; however, this process can affect the microstructure of the substrate material. For mechanical elbows and valves utilized for fluid transport in the energy sector, the components are designed to have a specific microstructure, and deviations from these specifications can create weak points in the system. For this reason it is important to investigate how the temperature of the deposition process affects the substrate. This paper investigates the effect of high-temperature and low-temperature (< 150 ◦C) processing conditions on the surface composition of the substrate. Furthermore, the resultant transducers from high- and low-temperature fabrication processes are compared to determine if a low-temperature processing method is feasible. For these studies a sol-gel spray-on process is employed to deposit piezoelectric ceramics onto a stainless-steel 316L substrate. Energy-dispersive X-ray spectroscopy is utilized to determine the composition of the substrate surface before and after transducer deposition. Results indicate that the high-temperature processing conditions may alter the surface composition of the metal due to a diffusion of the metal into the ceramic, which results in a metal surface that is bonded to the ceramic. Furthermore, it is shown that low-temperature processing of spray-on transducers is a viable method for transducer fabrication where the resultant transducers meet the industry minimum requirement of 30 dB signalto-noise ratio. In parallel simulation calculations, finite-element method (FEM) studies were performed to model the adhesive strength of the low-temperature processed transducer to the substrate surface. Comparisons between the simulations and experiments suggest that the bond strength is much greater than the commercial gel bonds and closer to hardened epoxy glue bonds. These results indicate that spray-on transducers fabricated under lowtemperature processing conditions are a viable solution for leave-in-place monitoring of structures.

M. Sinding, Kyle↗
DOE OSTI2023

High Power Targetry R&D and support for future generation accelerator

A high-power target system is a key beam element to complete future High Energy Physics (HEP) experiments. The target endures high power pulsed beam, leading to high cycle thermal stresses/pressures and thermal shocks. The increased beam power will also create significant challenges such as corrosion and radiation damage that can cause harmful effects on the material and degrade their mechanical and thermal properties during irradiation. This can eventually lead to the failure of the material and drastically reduce the lifetime of targets and beam intercepting devices. Designing a reliable target is already a challenge for MW class facilities today and has led several major accelerator facilities to operate at lower power due to target concerns. With present plans to increase beam power for next generation accelerator facilities in the next decade and the multi-year time-scale to acquire the knowledge on material behavior under such extreme environment, timely R&D of robust high-power targets is critical to fully secure the physics benefits of ambitious accelerator power upgrades. The next generation of high-power targets for future accelerators will use more complex geometries, novel materials, and new concepts allowing better high heat flux cooling methods. Advanced numerical simulations need to be developed to satisfy the physical design requirements of reliable beam-intercepting devices. In parallel, radiation hardened beam instrumentation irradiation methods for high-power targets must be further developed. Additional irradiation facilities are needed since only a few facilities worldwide offer beams for target testing, and the beam provided may not be appropriate for the specific facility or project. Thus, a comprehensive research and development program must be implemented to address the challenges that multi-MW targets face.

Pellemoine, F.↗
DOE OSTI2016

SU-G-TeP1-15: Toward a Novel GPU Accelerated Deterministic Solution to the Linear Boltzmann Transport Equation

Purpose: To develop a Graphic Processor Unit (GPU) accelerated deterministic solution to the Linear Boltzmann Transport Equation (LBTE) for accurate dose calculations in radiotherapy (RT). A deterministic solution yields the potential for major speed improvements due to the sparse matrix-vector and vector-vector multiplications and would thus be of benefit to RT. Methods: In order to leverage the massively parallel architecture of GPUs, the first order LBTE was reformulated as a second order self-adjoint equation using the Least Squares Finite Element Method (LSFEM). This produces a symmetric positive-definite matrix which is efficiently solved using a parallelized conjugate gradient (CG) solver. The LSFEM formalism is applied in space, discrete ordinates is applied in angle, and the Multigroup method is applied in energy. The final linear system of equations produced is tightly coupled in space and angle. Our code written in CUDA-C was benchmarked on an Nvidia GeForce TITAN-X GPU against an Intel i7-6700K CPU. A spatial mesh of 30,950 tetrahedral elements was used with an S4 angular approximation. Results: To avoid repeating a full computationally intensive finite element matrix assembly at each Multigroup energy, a novel mapping algorithm was developed which minimized the operations required at each energy. Additionally, a parallelized memory mapping for the kronecker product between the sparse spatial and angular matrices, including Dirichlet boundary conditions, was created. Atomicity is preserved by graph-coloring overlapping nodes into separate kernel launches. The one-time mapping calculations for matrix assembly, kronecker product, and boundary condition application took 452±1ms on GPU. Matrix assembly for 16 energy groups took 556±3s on CPU, and 358±2ms on GPU using the mappings developed. The CG solver took 93±1s on CPU, and 468±2ms on GPU. Conclusion: Three computationally intensive subroutines in deterministically solving the LBTE have been formulated on GPU, resulting in two orders of magnitude speedup. Funding support from Natural Sciences and Engineering Research Council and Alberta Innovates Health Solutions. Dr. Fallone is a co-founder and CEO of MagnetTx Oncology Solutions (under discussions to license Alberta bi-planar linac MR for commercialization).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Numerical methods for high-dimensional probability density function equations

In this paper we address the problem of computing the numerical solution to kinetic partial differential equations involving many phase variables. These types of equations arise naturally in many different areas of mathematical physics, e.g., in particle systems (Liouville and Boltzmann equations), stochastic dynamical systems (Fokker–Planck and Dostupov–Pugachev equations), random wave theory (Malakhov–Saichev equations) and coarse-grained stochastic systems (Mori–Zwanzig equations). We propose three different classes of new algorithms addressing high-dimensionality: The first one is based on separated series expansions resulting in a sequence of low-dimensional problems that can be solved recursively and in parallel by using alternating direction methods. The second class of algorithms relies on truncation of interaction in low-orders that resembles the Bogoliubov–Born–Green–Kirkwood–Yvon (BBGKY) framework of kinetic gas theory and it yields a hierarchy of coupled probability density function equations. The third class of algorithms is based on high-dimensional model representations, e.g., the ANOVA method and probabilistic collocation methods. A common feature of all these approaches is that they are reducible to the problem of computing the solution to high-dimensional equations via a sequence of low-dimensional problems. The effectiveness of the new algorithms is demonstrated in numerical examples involving nonlinear stochastic dynamical systems and partial differential equations, with up to 120 variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗