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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Hybrid RANS-LES of the Atmospheric Boundary Layer for Wind Farm Simulations: Preprint

Wind farm simulations often do not accurately represent wake-atmospheric boundary layer (ABL) interactions, blade boundary layer (BL) dynamics, and turbine-turbine interactions. In this work, we use Active Model Split (AMS), a new hybrid Reynolds-Averaged Navier Stokes (RANS)-large eddy simulation (LES) model, which is well suited to capture these effects because the model can (i) accurately simulate the ABL with the Coriolis effect, (ii) is accurate in adverse pressure gradients such as those near wind turbine blades, and (iii) has sufficiently low computational cost to simulate multiple turbines while resolving the blade BL. For simplicity and consistency we develop AMS to be used throughout the domain rather than in a zonal method. We implement our work in the massively parallel flow solver, Nalu-Wind, so that our model can access the compute resources needed for blade-resolved simulations of multiple wind turbines. To accomplish these aims, we modify the baseline AMS by changing the RANS contribution to SST k - omega with a length scale limiter, adding the Coriolis effect, and developing an appropriate wall treatment. We show that AMS of the ABL with the Coriolis effect matches LES reference results better than those obtained with RANS. We describe our plans to add buoyancy effects and wind turbines to our AMS simulations.

atmospheric boundary layer↗
DOE OSTI2023

Subspace recursive Fermi-operator expansion strategies for large-scale DFT eigenvalue problems on HPC architectures

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. Here, these calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency.

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

A computationally efficient parallel Levenberg-Marquardt algorithm for highly parameterized inverse model analyses

Inverse modeling seeks model parameters given a set of observations. However, for practical problems because the number of measurements is often large and the model parameters are also numerous, conventional methods for inverse modeling can be computationally expensive. We have developed a new, computationally-efficient parallel Levenberg-Marquardt method for solving inverse modeling problems with a highly parameterized model space. Levenberg-Marquardt methods require the solution of a linear system of equations which can be prohibitively expensive to compute for moderate to large-scale problems. Our novel method projects the original linear problem down to a Krylov subspace, such that the dimensionality of the problem can be significantly reduced. Furthermore, we store the Krylov subspace computed when using the first damping parameter and recycle the subspace for the subsequent damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved using these computational techniques. We apply this new inverse modeling method to invert for random transmissivity fields in 2D and a random hydraulic conductivity field in 3D. Our algorithm is fast enough to solve for the distributed model parameters (transmissivity) in the model domain. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). By comparing with Levenberg-Marquardt methods using standard linear inversion techniques such as QR or SVD methods, our Levenberg-Marquardt method yields a speed-up ratio on the order of ~10 1 to ~10 2 in a multi-core computational environment. Furthermore, our new inverse modeling method is a powerful tool for characterizing subsurface heterogeneity for moderate- to large-scale problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Multi-jagged: A scalable parallel spatial partitioning algorithm

Geometric partitioning is fast and effective for load-balancing dynamic applications, particularly those requiring geometric locality of data (particle methods, crash simulations). We present, to our knowledge, the first parallel implementation of a multidimensional-jagged geometric partitioner. In contrast to the traditional recursive coordinate bisection algorithm (RCB), which recursively bisects subdomains perpendicular to their longest dimension until the desired number of parts is obtained, our algorithm does recursive multi-section with a given number of parts in each dimension. By computing multiple cut lines concurrently and intelligently deciding when to migrate data while computing the partition, we minimize data movement compared to efficient implementations of recursive bisection. We demonstrate the algorithm's scalability and quality relative to the RCB implementation in Zoltan on both real and synthetic datasets. Our experiments show that the proposed algorithm performs and scales better than RCB in terms of run-time without degrading the load balance. Lastly, our implementation partitions 24 billion points into 65,536 parts within a few seconds and exhibits near perfect weak scaling up to 6K cores.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Magnetic nanotube composite membranes

The invention provides a membrane comprising tubes extending through a polymer, wherein substantially all of the tubes are parallel with each other. Also provided is a method for producing a membrane, the method comprising: placing tubes on a substrate, subjecting the tubes to a magnetic field for a time and at a magnetic field strength to cause the tubes to align parallel with each other while simultaneously causing depending ends of the tubes to embed within the substrate; applying polymer to the tubes and substrate in an amount to affix the tubes relative to each other and relative to the substrate, and applying an etchant that cleaves a specific type of the bonds within the polymer to unblock the upstream ends of the nanotubes.

Chen, Xing↗
DOE OSTI2016

Architecture and method for a burst buffer using flash technology

A parallel supercomputing cluster includes compute nodes interconnected in a mesh of data links for executing an MPI job, and solid-state storage nodes each linked to a respective group of the compute nodes for receiving checkpoint data from the respective compute nodes, and magnetic disk storage linked to each of the solid-state storage nodes for asynchronous migration of the checkpoint data from the solid-state storage nodes to the magnetic disk storage. Each solid-state storage node presents a file system interface to the MPI job, and multiple MPI processes of the MPI job write the checkpoint data to a shared file in the solid-state storage in a strided fashion, and the solid-state storage node asynchronously migrates the checkpoint data from the shared file in the solid-state storage to the magnetic disk storage and writes the checkpoint data to the magnetic disk storage in a sequential fashion.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Low profile, highly configurable, current sharing paralleled wide band gap power device power module

A method of making a power module includes providing a base plate defining a topology pattern, providing a power substrate above the base plate, providing at least two power contacts and arranging solder catches in the at least two power contacts, soldering the at least two power contacts to the power substrate utilizing the solder catches, and securing a housing to the power substrate.

42 ENGINEERING↗
DOE OSTI2022

On the perturbation effect and LET dependence of beam quality correction factors in carbon ion beams

Background: In a recent study, we reported beam quality correction factors, f Q , in carbon ion beams using Monte Carlo (MC) methods for a cylindrical and a parallel-plate ionization chamber (IC). A non-negligible perturbation effect was observed; however, the magnitude of the perturbation correction due to the specific IC subcomponents was not included. Furthermore, the stopping power data presented in the International Commission on Radiation Units and Measurements (ICRU) report 73 were used, whereas the latest stopping power data have been reported in the ICRU report 90. Purpose: The aim of this study was to extend our previous work by computing f Q correction factors using the ICRU 90 stopping power data and by reporting IC-specific perturbation correction factors. Possible energy or linear energy transfer (LET) dependence of the f Q correction factor was investigated by simulating both pristine beams and spread-out Bragg peaks (SOBPs). Methods: The TOol for PArticle Simulation (TOPAS)/GEANT4 MC code was used in this study. A 30 × 30 × 50 cm 3 water phantom was simulated with a uniform 10 × 10 cm 2 parallel beam incident on the surface. A Farmer-type cylindrical IC (Exradin A12) and two parallel-plate ICs (Exradin P11 and A11) were simulated in TOPAS using the manufacturer-provided geometrical drawings. The f Q correction factor was calculated in pristine carbon ion beams in the 150–450 MeV/u energy range at 2 cm depth and in the middle of the flat region of four SOBPs. The k Q correction factor was calculated by simulating the f Qo correction factor in a 60 Co beam at 5 cm depth. The perturbation correction factors due to the presence of the individual IC subcomponents, such as the displacement effect in the air cavity, collecting electrode, chamber wall, and chamber stem, were calculated at 2 cm depth for monoenergetic beams only. Additionally, the mean dose-averaged and track-averaged LET was calculated at the depths at which the f Q was calculated. Results: The ICRU 90 f Q correction factors were reported. The p dis correction factor was found to be significant for the cylindrical IC with magnitudes up to 1.70%. The individual perturbation corrections for the parallel-plate ICs were <1.0% except for the A11 p cel correction at the lowest energy. The f Q correction for the P11 IC exhibited an energy dependence of >1.00% and displayed differences up to 0.87% between pristine beams and SOBPs. Conversely, the f Q for A11 and A12 displayed a minimal energy dependence of <0.50%. The energy dependence was found to manifest in the LET dependence for the P11 IC. A statistically significant LET dependence was found only for the P11 IC in pristine beams only with a magnitude of <1.10%. Conclusions: The perturbation and k Q correction factor should be calculated for the specific IC to be used in carbon ion beam reference dosimetry as a function of beam quality.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2023

A New Semistructured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Development of a New Fixed-source Sensitivity Tally Capability in the MCNP ® Code [Slides]

Current work includes FSEN capability development, continued verification of adjoint-weighted sensitivity method, and improvement of algorithm speed and parallelism capability. Future work is forecasted to include extensions to non-Boltzmann responses, adding more responses and particle types, and connection to new MCNP6.3 tally backend.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Highly Efficient Compensation-Based Parallelism for Wavefront Loops on GPUs

Wavefront loops are widely used in many scientific applications, e.g., partial differential equation (PDE) solvers and sequence alignment tools. However, due to the data dependencies in wavefront loops, it is challenging to fully utilize the abundant compute units of GPUs and to reuse data through their memory hierarchy. Existing solutions can only optimize for these factors to a limited extent. For example, tiling-based methods optimize memory access but may result in load imbalance; while compensation-based methods, which change the original order of computation to expose more parallelism and then compensate for it, suffer from both global synchronization overhead and limited generality. In this paper, we first prove under which circumstances that breaking data dependencies and properly changing the sequence of computation operators in our compensation-based method does not affect the correctness of results. Based on this analysis, we design a highly efficient compensation-based parallelism on GPUs. Our method provides weighted scan-based GPU kernels to optimize the computation and combines with the tiling method to optimize memory access and synchronization. The performance results on the NVIDIA K80 and P100 GPU platforms demonstrate that our method can achieve significant improvements for four types of real-world application kernels over the state-of-the-art research.

Hou, Kaixi↗
DOE OSTI2023

Hydrodynamic irreversibility of non-Brownian suspensions in highly confined duct flow

The irreversible behaviour of a highly confined non-Brownian suspension of spherical particles at low Reynolds number in a Newtonian fluid is studied experimentally and numerically. In the experiment, the suspension is confined in a thin rectangular channel that prevents complete particle overlap in the narrow dimension and is subjected to an oscillatory pressure-driven flow. In the small cross-sectional dimension, particles rapidly separate to the walls, whereas in the large dimension, features reminiscent of shear-induced migration in bulk suspensions are recovered. Furthermore, as a consequence of the channel geometry and the development and application of a single-camera particle tracking method, three-dimensional particle trajectories are obtained that allow us to directly associate relative particle proximity with the observed migration. Companion simulations of a steadily flowing suspension highly confined between parallel plates are conducted using the force coupling method, which also show rapid migration to the walls as well as other salient features observed in the experiment. While we consider relatively low volume fractions compared to most prior work in the area, we nevertheless observe significant and rapid migration, which we attribute to the high degree of confinement.

42 ENGINEERING↗
DOE OSTI2018

Computing the ankle-brachial index with parallel computational fluid dynamics

The ankle-brachial index (ABI), a ratio of arterial blood pressure in the ankles and upper arms, is used to diagnose and monitor circulatory conditions such as coarctation of the aorta and peripheral artery disease. Computational simulations of the ABI can potentially determine the parameters that produce an ABI indicative of ischemia or other abnormalities in blood flow. However, 0- and 1-D computational methods are limited in describing a 3-D patient-derived geometry. Thus, we present a massively parallel framework for computational fluid dynamics (CFD) simulations in the full arterial system. Additionally, using the lattice Boltzmann method to solve the Navier–Stokes equations, we employ highly parallelized and scalable methods to generate the simulation domain and efficiently distribute the computational load among processors. For the first time, we compute an ABI with 3-D CFD. In this proof-of-concept study, we investigate the dependence of ABI on the presence of stenoses, or narrowed regions of the arteries, by directly modifying the arterial geometry. As a result, our framework enables the computation a hemodynamic factor characterizing flow at the scale of the full arterial system, in a manner that is extensible to patient-specific imaging data and holds potential for treatment planning.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Error Propagation for Response Matrix Methods in the Many Node Limit

The response matrix method has been a useful solution method for radiation transport problems for decades. The method is desirable for many reasons. It can be extended to both fixed source and eigenvalue problems. In addition, a key aspect of the method is a shift of computational expense to a precomputation phase. Methods and codes employing response matrix or response matrix-like methods have enjoyed formidable computational efficiency while solving large problems. However, current applications of the method rely on large node sizes and few nodes to maximize computational efficiency. As part of a desire to make these methods more amenable to applications such as parallel computing in the future, the number of nodes in problems may increase, and node size will decrease. The effect of this change has not been well studied except for a few cases. In the past, it was determined that a poor approximation of angular dependence of flux on node interfaces could lead to large error propagation for fixed source problems, but a newer study indicates that changing node sizes as well as number of nodes poses little challenge for response methods in the eigenvalue case. This paper presents the unintuitive result that for response matrix methods increasing the spatial resolution of the problem may dramatically decrease accuracy - this effect is demonstrated on a simple analytic 1-D benchmark problem. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗