Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2026

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗
DOE OSTI2019

Fit Fly: A Case Study of Interconnect Innovation through Parallel Simulation

To meet the demand for exascale-level performance from high-performance computing (HPC) interconnects, many system architects are turning to simulation results for accurate and reliable predictions of the performance of prospective technologies. Testing full-scale networks with a variety of benchmarking tools, including synthetic workloads and application traces, can give crucial insight into what ideas are most promising without needing to physically construct a test network. While flexible, however, this approach is extremely compute time intensive. We address this time complexity challenge through the use of large-scale, optimistic parallel simulation that ultimately leads to faster HPC network architecture innovations. In this paper we demonstrate this innovation capability through a real-world network design case study. Specifically, we have simulated and compared four extreme-scale interconnects: Dragonfly, Megafly, Slim Fly, and a new dual-rail-dual-plane variation of the Slim Fly network topology. We present this new variant of Slim Fly, dubbed Fit Fly, to show how interconnect innovation and evaluation-beyond what is possible through analytic methods-can be achieved through parallel simulation. We validate and compare the model with various network designs using the CODES interconnect simulation framework. By running large-scale simulations in a parallel environment, we are able to quickly generate reliable performance results that can help network designers break ground on the next generation of high-performance network designs.

High Performance Computing↗
DOE OSTI2015

NWChem: Quantum Chemistry Simulations at Scale

Methods based on quantum mechanics equations have been developed since the 1930's with the purpose of accurately studying the electronic structure of molecules. However, it is only during the last two decades that intense development of new computational algorithms has opened the possibility of performing accurate simulations of challenging molecular processes with high-order many-body methods. A wealth of evidence indicates that the proper inclusion of instantaneous interactions between electrons (or the so-called electron correlation effects) is indispensable for the accurate characterization of chemical reactivity, molecular properties, and interactions of light with matter. The availability of reliable methods for benchmarking of medium-size molecular systems provides also a unique chance to propagate high-level accuracy across spatial scales through the multiscale methodologies. Some of these methods have potential to utilize computational resources in an effi*cient way since they are characterized by high numerical complexity and appropriate level of data granularity, which can be effi*ciently distributed over multi-processor architectures. The broad spectrum of coupled cluster (CC) methods falls into this class of methodologies. Several recent CC implementations clearly demonstrated the scalability of CC formalisms on architectures composed of hundreds thousand computational cores. In this context NWChem provides a collection of Tensor Contraction Engine (TCE) generated parallel implementations of various coupled cluster methods capable of taking advantage of many thousand of cores on leadership class parallel architectures.

chemistry↗
DOE OSTI2020

Direction-optimizing Label Propagation and its Application for Community Detection

Label Propagation is a machine learning algorithm typically used for classification. It has also been found to be an effective method for detecting communities in networks. It has two attractive features as a community detection method: it has nearly linear runtime and it requires no \textit{a priori} community information. We propose a new Direction Optimizing Label Propagation Algorithm (DOLPA) that relies on the use of {\em frontiers} and alternates between label {\em push} and label {\em pull} operations to enhance the performance of LPA. Specifically, DOLPA has parameters for tuning the processing order of vertices in a graph. This reduces the number of edges visited and improves the quality of solution. We apply DOLPA to community detection and present the design and implementation of the algorithm as well as its shared-memory parallelization using OpenMP. Empirically, we evaluate our algorithm using synthetic graphs as well as real-world networks. Compared with the state-of-art \textit{Parallel Label Propagation} algorithm, we achieve at least two times the F-Score while reducing the runtime by 50\% for synthetic graphs with overlapping communities. We also compare DOLPA against the state-of-art parallel implementation of the Louvain method using the same graphs and show that DOLPA achieves about three times the F-Score at 10\% the runtime. On real-world graphs, we get a speedup of up to $10\times$ using 64 threads.

Liu, X↗
DOE OSTI2015

On the use of Abelian point group symmetry in density-fitted local MP2 using various types of virtual orbitals

Electron correlation methods based on symmetry-adapted canonical Hartree-Fock orbitals can be speeded up significantly in the well known group theoretical manner, using the fact that integrals vanish unless the integrand is totally symmetric. In contrast to this, local electron correlation methods cannot benefit from such simplifications, since the localized molecular orbitals (LMOs) generally do not transform according to irreducible representations of the underlying point group symmetry. Instead, groups of LMOs become symmetry-equivalent and this can be exploited to accelerate local calculations. We describe an implementation of such a symmetry treatment for density-fitted local Møller-Plesset perturbation theory, using various types of virtual orbitals: Projected atomic orbitals, orbital specific virtuals, and pair natural orbitals. The savings by the symmetry treatment are demonstrated by calculations for several large molecules having different point group symmetries. Benchmarks for the parallel execution efficiency of our method are also presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗
DOE OSTI2016

Limited‐memory adaptive snapshot selection for proper orthogonal decomposition

Summary Reduced order models are useful for accelerating simulations in many‐query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models (ROMs) can have prohibitively expensive memory and floating‐point operation costs in high‐performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time‐stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition‐based ROMs, and memory usage is minimized by computing the singular value decomposition using a single‐pass incremental algorithm. Results for a viscous Burgers' test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full‐order model is recovered to within discretization error. A parallel version of the resulting method can be used on supercomputers to generate proper orthogonal decomposition‐based ROMs, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space. Copyright © 2016 John Wiley & Sons, Ltd.

Oxberry, Geoffrey M.↗
DOE OSTI2018

Large-eddy Simulations of Spray Variability Effects on Flow Variability in a Direct-injection Spark-ignition Engine Under Non-combusting Operating Conditions

Large-eddy Simulations (LES) have been carried out to investigate spray variability and its effect on cycle-to-cycle flow variability in a direct-injection spark-ignition (DISI) engine under non-reacting conditions. Initial simulations were performed of an injector in a constant volume spray chamber to validate the simulation spray set-up. Comparisons showed good agreement in global spray measures such as the penetration. Local mixing data and shot-to-shot variability were also compared using Rayleigh-scattering images and probability contours. The simulations were found to reasonably match the local mixing data and shot-to-shot variability using a random-seed perturbation methodology. After validation, the same spray set-up with only minor changes was used to simulate the same injector in an optically accessible DISI engine. Particle Image Velocimetry (PIV) measurements were used to quantify the flow velocity in a horizontal plane intersecting the spark plug gap. The engine was operated in a skip-fired operating mode and comparisons focused on cycles that included fuel injection, but no spark event and therefore no combustion. 105 total LES engine cycles were simulated using a parallel cycle simulation approach and 3 different perturbation methods in an attempt to isolate the effects of shot-to-shot spray variability and the initial turbulent flow field as well as their interaction effects on overall engine CCVs. The experimental mean and standard deviations were reasonably well matched by the simulations, though quantitative comparisons near the injection event during the intake stroke were difficult due to the high uncertainty in the PIV measurements at these crank angles. The 3 simulation perturbation methods resulted in very similar results, though further analysis found the current parallel cycle approach may be limiting the ability of the simulations to isolate the spray and flow effects.

Cycle-to-cycle Variability↗
DOE OSTI2018

Method of Determining the Reliability of Real-Time In-reactor Monitoring of VVER

A methodological approach and the basic tenets for evaluating the reliability of in-reactor monitoring of VVER are presented. The method is based on the statistical analysis of indications in real time and includes methods for evaluating the admissible maximum error of the measurement channels used for monitoring as well as the average value and admissible deviation of indications in groups of parallel monitoring channels, as well as a method of evaluating reliability by comparing the values of a parameter with the regime values. In comparing the indications of a monitoring channel with the indications of other parallel channels, the median value is proposed as the baseline value. The developed method is implemented in the Diagnostika SVRK special software, which has been successfully tested during the commissioning of the No. 1 unit at the Novovoronezh NPP-2.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures

Here, we investigate how to port the standard interior-point method to new exascale architectures for block-structured nonlinear programs with state equations. Computationally, we decompose the interior-point algorithm into two successive operations: the evaluation of the derivatives and the solution of the associated Karush-Kuhn-Tucker (KKT) linear system. Our method accelerates both operations using two levels of parallelism. First, we distribute the computations on multiple processes using coarse parallelism. Second, each process uses SIMD/GPU accelerators locally to accelerate the operations using fine-grained parallelism. The KKT system is reduced by eliminating the inequalities and the state variables from the corresponding equations. We demonstrate our method's capability on the supercomputer Polaris, a testbed for the future exascale Aurora system. Each node is equipped with four GPUs, a setup amenable to our two-level approach. Our experiments on the stochastic optimal power flow problem show that the reduction method is 50x faster than the sparse linear solver HSL MA57 running in serial on the CPU, and 6x faster than Pardiso running in parallel on CPU on the same number of processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Parallelized Screening of Characterized and DFT-Modeled Bimetallic Colloidal Cocatalysts for Photocatalytic Hydrogen Evolution

Using a newly designed and developed parallelized photoreactor and colorimetric detection method, a large sampling of bimetallic co-catalysts (Pd/Sn, Pd/Mo, Pd/Ru, Pd/Pb, Pd/Ni, Ni/Sn, Mo/Sn and Pt/Sn) for photocatalytic water reduction have been tested in this work. Of these co-catalysts, the combination of palladium and tin showed the highest synergistic behavior and peak hydrogen gas production at a low relative fraction of palladium. The resulting Pd/Sn bimetallic co-catalysts were characterized using high-angle annular dark-field (HAADF) and scanning transmission electron microscopy energy dispersive X-ray spectroscopy (STEM-EDS), and specifically, investigation of the palladium/tin mixture indicated that palladium and tin elements reside within the same particle. The experimental catalytic activity for the palladium/tin mixture was compared to density functional theory-derived energy values associated with the adsorption of hydrogen onto a surface. This comparison demonstrated that the typical peak found in electrochemical Sabatier volcano plots at ΔG H* = ~0 eV was replicated in the experimental photocatalytic system with a peak activity observed at ΔG H* = -0.036 eV. Computational confirmation of the results expressed here demonstrates the efficacy of colorimetric detection of hydrogen in parallel and presents a model for increasingly rapid catalyst screening.

08 HYDROGEN↗