SEARCH · Engineering Papers

Results for “parallelization”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 973 records · Page 54

All sources NASA NTRS DOE OSTI

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 OSTI2021

Modeling of Combined Lead Fast Reactor and Concentrating Solar Power Supercritical Carbon Dioxide Cycles to Demonstrate Feasibility, Efficiency Gains, and Cost Reductions

Solar power has innate issues with weather, grid demand and time of day, which can be mitigated through use of thermal energy storage for concentrating solar power (CSP). Nuclear reactors, including lead-cooled fast reactors (LFRs), can adjust power output according to demand; but with high fixed costs and low operating costs, there may not be sufficient economic incentive to make this worthwhile. We investigate potential synergies through coupling CSP and LFR together in a single supercritical CO 2 Brayton cycle and/or using the same thermal energy storage. Combining these cycles allows for the LFR to thermally charge the salt storage in the CSP cycle during low-demand periods to be dispatched when grid demand increases. The LFR/CSP coupling into one cycle is modeled to find the preferred location of the LFR heat exchanger, CSP heat exchanger, sCO 2 -to-salt heat exchanger (C2S), turbines, and recuperators within the supercritical CO 2 Brayton cycle. Three cycle configurations have been studied: two-cycle configuration, which uses CSP and LFR heat for dedicated turbocompressors, has the highest efficiencies but with less component synergies; a combined cycle with CSP and LFR heat sources in parallel is the simplest with the lowest efficiencies; and a combined cycle with separate high-temperature recuperators for both the CSP and LFR is a compromise between efficiency and component synergies. Additionally, four thermal energy storage charging techniques are studied: the turbine positioned before C2S, requiring a high LFR outlet temperature for viability; the turbine after the C2S, reducing turbine inlet temperature and therefore power; the turbine parallel to the C2S producing moderate efficiency; and a dedicated circulator loop. While all configurations have pros and cons, use of a single cycle offers component synergies with limited efficiency penalty. Using a turbine in parallel with the C2S heat exchanger is feasible but results in a low charging efficiency, while a dedicated circulator loop offers flexibility and near-perfect heat storage efficiency but increasing cost with additional cycle components.

14 SOLAR ENERGY↗

DOE OSTI2020

Exploring the Acceleration Mechanisms for Particle Injection and Power-law Formation during Transrelativistic Magnetic Reconnection

Magnetic reconnection in the relativistic and transrelativistic regimes is able to accelerate particles to hard power-law energy spectra f ∝ γ -p (approaching p = 1). The underlying acceleration mechanism that determines the spectral shape is currently a topic of intense investigation. By means of fully kinetic plasma simulations, we carry out a study of particle acceleration during magnetic reconnection in the transrelativistic regime of a proton–electron plasma. While earlier work in this parameter regime has focused on the effects of electric field parallel to the local magnetic field on the particle injection (from thermal energy to the lower-energy bound of the power-law spectrum), here we examine the roles of both parallel and perpendicular electric fields to gain a more complete understanding on the injection process and further development of a power-law spectrum. We show that the parallel electric field does contribute significantly to particle injection, and is more important in the initial phase of magnetic reconnection. However, as the simulation proceeds, the acceleration by the perpendicular electric field becomes more important for particle injection and completely dominates the acceleration responsible for the high-energy power-law spectrum. This holds robustly, in particular for longer reconnection times and larger systems, i.e., in simulations that are more indicative of the processes in astrophysical sources.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2023

Anisotropic Energy Transfer and Conversion in Magnetized Compressible Turbulence

We present a spatial filtering (or coarse-graining) analysis on 3D magnetized magnetohydrodynamic (MHD) turbulence simulations. The filtered compressible MHD formulae show transfer of kinetic and magnetic energies from large to small scales, as well as energy conversion between kinetic, magnetic, and thermal energies. The anisotropic filtering enables separate analyses of the energy flows perpendicular and parallel to the global mean magnetic field. Anisotropy in energy cascade is demonstrated by the larger perpendicular energy cascade rate and also the larger perpendicular wavenumbers associated with the peak energy transfer rate. We also find that the “inertial range” along the parallel (perpendicular) direction in the anisotropic energy cascade formulation is no longer strictly dissipation-free, because it includes the dissipation in the perpendicular (parallel) direction. A change in the driving force (kinetic only versus kinetic and magnetic) affects the energy conversion between kinetic and magnetic energies. While the compressibility of the driving force changes the partition of different channels of energy transfer and conversion, and also increases the total energy transfer rate, the global energy flow remains unaffected by compressibility qualitatively. Our analysis can be applied to multispacecraft observations of turbulence in the solar wind or a planetary magnetosphere.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Boundary of the Distribution of Solar Wind Proton Beta versus Temperature Anisotropy

Abstract The frequency distribution of solar wind protons, measured in the vicinity of Earth’s orbit, is customarily plotted in ( β ∥ , T ⊥ / T ∥ ) phase space. Here, T ⊥ / T ∥ is the ratio of perpendicular and parallel temperatures, and β ∥ = 8 π nT ∥ / B 2 is the ratio of parallel thermal energy to background magnetic field energy, the so-called “parallel beta,” with ⊥ and ∥ denoting directions with respect to the ambient magnetic field. Such a frequency distribution, plotted as a two-dimensional histogram, forms a peculiar rhombic shape defined with an outer boundary in the said phase space. Past studies reveal that the threshold conditions for temperature anisotropy–driven plasma instability partially account for the boundary on the high- β ∥ side. The low- β ∥ side remains largely unexplained despite some efforts. Work by Vafin et al. recently showed that certain contours of collisional relaxation frequency, ν pp , when parameterized by T ⊥ / T ∥ and β ∥ , could match the overall shape of the left-hand boundary, thus suggesting that the collisional relaxation process might be closely related to the formation of the left-hand boundary. The present paper extends the analysis by Vafin et al. and carries out the dynamical computation of the collisional relaxation process for an ensemble of initial proton states with varying degrees of anisotropic temperatures. The final states of the relaxed protons are shown to closely match the observed boundary to the left of the ( β ∥ , T ⊥ / T ∥ ) phase space. When coupled with a similar set of calculations for the ensemble in the collective instability regime, it is found that the combined collisional/collective effects provide the baseline explanation for the observation.

Astronomy & Astrophysics↗

DOE OSTI2020

Extended Physics-Informed Neural Networks (XPINNs): A Generalized Space-Time Domain Decomposition Based Deep Learning Framework for Nonlinear Partial Differential Equations

Here we propose a generalized space-time domain decomposition approach for the physics-informed neural networks (PINNs) to solve nonlinear partial differential equations (PDEs) on arbitrary complex-geometry domains. The proposed framework, named eXtended PINNs ( X P I N N s ), further pushes the boundaries of both PINNs as well as conservative PINNs (cPINNs), which is a recently proposed domain decomposition approach in the PINN framework tailored to conservation laws. Compared to PINN, the XPINN method has large representation and parallelization capacity due to the inherent property of deployment of multiple neural networks in the smaller subdomains. Unlike cPINN, XPINN can be extended to any type of PDEs. Moreover, the domain can be decomposed in any arbitrary way (in space and time), which is not possible in cPINN. Thus, XPINN offers both space and time parallelization, thereby reducing the training cost more effectively. In each subdomain, a separate neural network is employed with optimally selected hyperparameters, e.g., depth/width of the network, number and location of residual points, activation function, optimization method, etc. A deep network can be employed in a subdomain with complex solution, whereas a shallow neural network can be used in a subdomain with relatively simple and smooth solutions. We demonstrate the versatility of XPINN by solving both forward and inverse PDE problems, ranging from one-dimensional to three-dimensional problems, from time-dependent to time-independent problems, and from continuous to discontinuous problems, which clearly shows that the XPINN method is promising in many practical problems. The proposed XPINN method is the generalization of PINN and cPINN methods, both in terms of applicability as well as domain decomposition approach, which efficiently lends itself to parallelized computation. The XPINN code is available on h t t p s : / / g i t h u b . c o m / A m e y a J a g t a p / X P I N N s .

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Algebraic Algorithms for Betweenness and Percolation Centrality

Abstract In this paper, we explored different ways to write the algebraic version of betweenness centrality algorithm. Particularly, we focused on Brandes' algorithm. We aimed for algebraic betweenness centrality that can be parallelized easily. We proposed 3-tuple geodetic semiring as an extension to the usual geodetic semiring with 2-tuples. Using the 3-tuple geodetic semiring, Dijkstra's and Brandes' algorithm, we wrote more concise and general algebraic betweenness centrality (ABC) algorithm which is valid for weighted and directed graphs. We also proposed an alternative version of ABC using the usual geodetic semiring with 2-tuple where we used a simple way to construct shortest path tree after computing shortest path distances in the usual geodetic semiring. This allows us to avoid computational complexity of ABC implementation using 3-tuple geodetic semiring. We used numba to optimize and parallelize ABC. We evaluated the performance of ABC using 2-tuple geodetic semiring as compared to NetworkX, a common python package for graph algorithms. We did scalability experiments on parallel ABC and showed its total speedup. We also showed that with small modification, ABC can be adapted to algebraicly compute other centrality measures such as percolation centrality.

97 MATHEMATICS AND COMPUTING↗

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 OSTI2020

Vertex Reordering for Real-world Graphs and Applications: An Empirical Evaluation

Vertex reordering is a way to improve locality in graph computations. Given an input (or ``natural'') order, reordering aims to compute an alternate permutation of the vertices that is aimed at maximizing a locality-based objective. Given decades of research on this topic, there are tens of graph reordering schemes, and there are also several linear arrangement ``gap'' measures for treatment as objectives. However, a comprehensive empirical analysis of the efficacy of the ordering schemes against the different gap measures, and against real-world applications is currently lacking. In this study, we present an extensive empirical evaluation of up to 11 ordering schemes, taken from different classes of approaches, on a set of 34 real-world graphs emerging from different application domains. Our study is presented in two parts: a) a thorough comparative evaluation of the different ordering schemes on their effectiveness to optimize different linear arrangement gap measures, relevant to preserving locality; and b) extensive evaluation of the impact of the ordering schemes on two real-world, parallel graph applications, namely, community detection and influence maximization. Our studies show a significant divergence among the ordering schemes (up to $40\times$ between the best and the poor) in their effectiveness to reduce the gap measures; and a wide ranging impact of the ordering schemes on various aspects including application runtime (up to $4\times$), memory and cache use, load balancing, and parallel work and efficiency. The comparative study also help reveal the nuances of a parallel environment (compared to serial) on the ordering schemes and their role in optimizing applications.

Barik, Reet↗

DOE OSTI2020

TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graph analytics has emerged as an important tool in the analysis of large scale data from diverse application domains such as social networks, cyber security and bioinformatics. Counting the number of triangles in a graph is a fundamental kernel with several applications such as detecting the community structure of a graph or in identifying important vertices in a graph. The ubiquity of massive datasets is driving the need to scale graph analytics on parallel systems. However, numerous challenges exist in efficiently parallelizing graph algorithms, especially on distributed-memory systems. Irregular memory accesses and communication patterns, low computation to communication ratios, and the need for frequent synchronization are some of the leading challenges. In this paper, we present TriC, our distributed-memory implementation of triangle counting in graphs using the Message Passing Interface (MPI), as a submission to the 2020 GraphChallenge competition. Using a set of synthetic and real-world inputs from the challenge, we demonstrate a speedup of up to 90x relative to previous work on 32 processor-cores of a NERSC Cori node. We also provide details from distributed runs with up to8192 processes along with strong scaling results. The observations presented in this work provide an understanding of the system-level bottlenecks at scale that specifically impact sparse-irregular workloads and will therefore benefit other efforts to parallelize graph algorithms.

Halappanavar, Mahantesh↗

DOE OSTI2020

Scalable Deep-Learning-Accelerated Topology Optimization for Additively Manufactured Materials

Topology optimization (TO) is a popular and powerful computational approach for designing novel structures, materials, and devices. Two computational challenges have limited the applicability of TO to a variety of industrial applications. First, a TO problem often involves a large number of design variables to guarantee sufficient expressive power. Second, many TO problems require a large number of expensive physical model simulations, and those simulations cannot be parallelized. To address these issues, we propose a general scalable deep-learning (DL) based TO framework, referred to as SDL-TO, which utilizes parallel schemes in high performance computing (HPC) to accelerate the TO process for designing additively manufactured (AM) materials. Unlike the existing studies of DL for TO, our framework accelerates TO by learning the iterative history data and simultaneously training on the mapping between the given design and its gradient. The surrogate gradient is learned by utilizing parallel computing on multiple CPUs incorporated with a distributed DL training on multiple GPUs. The learned TO gradient enables a fast online update scheme instead of an expensive update based on the physical simulator or solver. Using a local sampling strategy, we achieve to reduce the intrinsic high dimensionality of the design space and improve the training accuracy and the scalability of the SDL-TO framework. The method is demonstrated by benchmark examples and AM materials design for heat conduction. The proposed SDL-TO framework shows competitive performance compared to the baseline methods but significantly reduces the computational cost by a speed up of around 8.6x over the standard TO implementation.

Bi, Sirui↗

DOE OSTI2021

PandAna: A Python Analysis Framework for Scalable High Performance Computing in High Energy Physics

Modern experiments in high energy physics analyze millions of events recorded in particle detectors to select the events of interest and make measurements of physics parameters. These data can often be stored as tabular data in files with detector information and reconstructed quantities. Current techniques for event selection in these files lack the scalability needed for high performance computing environments. We describe our work to develop a high energy physics analysis framework suitable for high performance computing. This new framework utilizes modern tools for reading files and implicit data parallelism. Framework users analyze tabular data using standard, easy-to-use data analysis techniques in Python while the framework handles the file manipulations and parallelism without the user needing advanced experience in parallel programming. In future versions, we hope to provide a framework that can be utilized on a personal computer or a high performance computing cluster with little change to the user code.

Groh, Micah↗

DOE OSTI2021

Progress on Optimizing Wind Farms and Rotor Designs Using Adjoints

Modern wind plants are increasingly tasked with multiple performance objectives. In addition to designing plants that maximize power output and minimize the levelized cost of energy (LCOE), the design and operation of wind plants is increasingly influenced by challenges regarding grid integration of variable generation renewables. This places a growing emphasis on making wind plants more controllable and predictable. WindSE is a Reynolds-averaged Navier-Stokes (RANS) model designed around analytical gradient and adjoint methods, with the ability to capture terrain-induced effects, as shown in Figure 1. The recent addition of an unsteady solver with an actuator line method (ALM) and ongoing work to enable massively parallel optimizations gives it a unique niche to explore coupled plant-level controls and design problems. This code is an open source python package built on the FEniCS framework that utilizes fast, parallel PETSc solvers to model fluid flow throughout wind-farm scale domains. Two recent studies performed using WindSE demonstrate the capability to optimize under a wide variety of flow conditions and objective functions. In the first, we present an optimization focused on modifying the layout of a wind farm with a fixed number of turbines for maximum total power output [1]. This study highlights the ability to quickly perform simulations using the steady Navier-Stokes solver combined with rotors represented as actuator disks while also stressing the importance of capturing terrain-induced effects. Gradient-based optimization using the RANS equations is viable due to the inclusion of efficiently computed adjoint derivatives. We interpret the physical results of the optimal layout and also discuss the computational cost of scaling to larger problems. In the second study, we present the capabilities of the unsteady Navier-Stokes solver, where rotor-blade profiles represented by actuator lines are optimized to enhance wake steering effects and overall power production [2]. We quantify the wind plant performance gains obtained from this type of simultaneous control co-design optimization as compared to optimizing the blade design and yaw independently. Figure 2 shows the differences between a baseline two-turbine system and an optimized system where we fine-tune the blade chord profile. Results and challenges from each study are quickly summarized and used to motivate the current development efforts within WindSE. Current and future work is focused on enabling higher-resolution studies with more degrees of freedom through parallelization of both the simulation and optimization algorithms. We present benchmarking results to show that WindSE performs well in both weak- and strong-scaling tests and further demonstrate that the optimizer obtains the same convergence rates in both shared- and distributed-memory environments. Using larger wind farms, we can study deep-array effects within an optimization context, allowing the use of objective functions that have been previously unstudied. As an example, we present ongoing work on a blockage metric which characterizes the loss of available kinetic energy due to wake effects from multiple upstream turbines.

adjoint optimization↗

DOE OSTI2021

Linear delta systems with additional degrees of freedom and related methods

A linear delta system includes a frame, rails secured to the frame, linear actuators, each linear actuator coupled to a respective rail and configured to translate along a longitudinal length of the respective rail, pairs of parallel rods each operably coupled to a respective linear actuator, a platform coupled to the pairs of parallel rods, structure configured to movable couple an object to the platform; and at least one degree of freedom imparting assembly including a profiled rod extending in a direction parallel to the rails and a drive unit configured to rotate the profiled rod, wherein the at least one degree of freedom imparting assembly is configured to impart a degree of freedom to the object.

Crawford, Anthony L.↗

DOE OSTI2021

Low inductance bus assembly and power converter apparatus including the same

An apparatus, such as a power converter, includes first, second and third core bus plates arranged in parallel. The apparatus also includes a first bus extension plate joined to the first core bus plate and extending therefrom at a first angle and a second bus extension plate joined to the second core bus plate and extending therefrom at a second angle. The apparatus further includes a third bus extension plated joined with the third core bus plate and disposed parallel to the first bus extension plate and a fourth bus extension plate joined with the third core bus plate and disposed parallel to the second bus extension plate.

Nojima, Geraldo↗

DOE OSTI2022

An Impartial Perspective for Superconducting Nb$_3$Sn coated Copper RF Cavities for Future Linear Accelerators

This Snowmass21 Contributed Paper encourages the Particle Physics community in fostering R&D in Superconducting Nb3Sn coated Copper RF Cavities instead of costly bulk Niobium. It describes the pressing need to devote effort in this direction, which would deliver higher gradient and higher temperature of operation and reduce the overall capital and operational costs of any future collider. It is unlikely that an ILC will be built in the next ten years with Nb as one of the main cost drivers of SRFs. This paper provides strong arguments on the benefits of using this time for R&D on producing Nb3Sn on inexpensive and thermally efficient metals such as Cu or bronze, while pursuing in parallel the novel U.S. concept of parallel-feed RF accelerator structures. A technology that synergistically uses both of these advanced tools would make an ILC or equivalent machines more affordable and more likely to be built. Such a successful enterprise would readily apply to other HEP accelerators, for instance a Muon Collider, and to accelerators beyond HEP. We present and assess current efforts in the U.S. on the novel concept of parallel-feed RF accelerator structures, and in the U.S. and abroad in producing Nb3Sn films on either Cu or bronze despite minimal funding.

43 PARTICLE ACCELERATORS↗

DOE OSTI2023

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

DOE OSTI2024

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗