Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel”

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 847 records · Page 47

HIPLZ: Enabling performance portability for exascale systems

While heterogeneous computing has emerged as a dominant trend in current and future High-Performance Computing (HPC) systems, it is also widely recognized that this shift has led to increased software complexity due to a proliferation of programming systems for different heterogeneous processors. One such example is the Heterogeneous-Compute Interface for Portability from AMD (HIP ), which is composed of a C Runtime API and C++ Kernel Language. Many HPC applications will likely use HIP on future exascale systems (e.g., Frontier and El Capitan), but HIP currently only targets AMD and NVIDIA processors. This limitation creates challenges for users who would also like to run their applications on exascale systems based on other architectures (e.g., Aurora, which is based on Intel hardware) that are currently not targeted by HIP . In this paper, we introduce the design and implementation of HIPLZ , a compiler and runtime system that uses the Intel Level Zero API to support HIP on Intel GPU architectures. We discuss the design of HIPLZ , derived from HIPCL (an implementation of HIP on top of OpenCL ), and portability issues that occur from using the Level Zero runtime as a backend. We evaluate our implementation by running several performance benchmarks and mini-apps written in HIP on Intel architectures using HIPLZ . Our results show that this approach provides competitive performance relative to Intel's OpenCL implementations on Intel Gen9 and UHD Graphics 770 GPUs, while providing good coverage of features needed by HPC applications. Overall, this approach is a promising demonstration of enabling performance portability for exascale systems.

97 MATHEMATICS AND COMPUTING↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

Spatial and temporal overlap between hatchery- and natural-origin steelhead and Chinook Salmon during spawning in the Klickitat River, Washington, USA

Abstract Objective A goal of many segregated salmonid hatchery programs is to minimize potential interbreeding between hatchery- and natural-origin fish. Our objective was to assess this on the Klickitat River, Washington, USA. Methods We used radiotelemetry to evaluate spatiotemporal spawning overlap between hatchery- and natural-origin steelhead Oncorhynchus mykiss and spring Chinook Salmon O. tshawytscha. We estimated percentages of tagged fish that spawned naturally in the Klickitat River subbasin, emigrated from the Klickitat River, or died before spawning. A kernel density analysis was used to estimate probability of spatiotemporal overlap between hatchery- and natural-origin spawners. Result For steelhead, 12% of hatchery-origin and 50% of natural-origin fish spawned naturally. For spring Chinook Salmon, 18% of hatchery-origin and 44% of natural-origin fish spawned naturally. Tag loss may result in underestimates in these percentages. Most hatchery-origin steelhead (90%) spawned downstream of river kilometer (rkm) 32, and 75% spawned from November to mid-March. The majority of natural-origin steelhead (64%) spawned upstream of rkm 32, and 75% spawned from mid-March to late May. Spawn timing of hatchery-origin Chinook Salmon (early August to mid-September) overlapped with that of natural-origin Chinook Salmon (late July to late September), and fish of both origins spawned in the same 30-km reach of the river. We estimated the percentage of hatchery-origin spawners (pHOS) on the natural spawning grounds to be 12% for steelhead and 40% for spring Chinook Salmon across all study years. For steelhead, we estimated the overlap probability to be 25% (95% CI = 22.5–28%). For spring Chinook Salmon, tight spatial clustering of hatchery-origin fish resulted in a lower overlap estimate of 21% (13–31%). Conclusion We suggest adjusting pHOS estimates using these overlap estimates or similar spatiotemporal data on actual spawner proximity and possible interactions, and that these types of analyses be used in conjunction with gene flow analysis to accurately evaluate effects of individual hatchery programs.

Zendt, Joseph S.↗

Lagrangian–Eulerian multidensity topology optimization with the material point method

Abstract In this paper, a hybrid Lagrangian–Eulerian topology optimization (LETO) method is proposed to solve the elastic force equilibrium with the Material Point Method (MPM). LETO transfers density information from freely movable Lagrangian carrier particles to a fixed set of Eulerian quadrature points. This transfer is based on a smooth radial kernel involved in the compliance objective to avoid the artificial checkerboard pattern. The quadrature points act as MPM particles embedded in a lower‐resolution grid and enable a subcell multidensity resolution of intricate structures with a reduced computational cost. A quadrature‐level connectivity graph‐based method is adopted to avoid the artificial checkerboard issues commonly existing in multiresolution topology optimization methods. Numerical experiments are provided to demonstrate the efficacy of the proposed approach.

Li, Yue↗

A duality-based coupling of Cosserat crystal plasticity and phase field theories for modeling grain refinement

High-rate deformation processes of metals entail intense grain refinement and special attention needs to be paid to capture the evolution of microstructure. In this article, a new formulation for coupling Cosserat crystal plasticity and phase field is developed. A common approach is to penalize kinematic incompatibility between lattice orientation and displacement-based elastic rotation. However, this can lead to significant solution sensitivity to the penalty parameter, resulting in low accuracy and convergence rates. To address these issues, a duality-based formulation is developed which directly imposes the rotational kinematic compatibility. A weak inf-sup-based skew-symmetric stress projection is introduced to suppress instabilities present in the dual formulation. An additional least squares stabilization is introduced to suppress the spurious lattice rotation with a suitable parameter range derived analytically and validated numerically. The required high-order continuity is attained by the reproducing kernel approximation. It is observed that equal order displacement-rotation-phase field approximations are stable, which allows efficient employment of the same set of shape functions for all independent variables. The proposed formulation is shown to yield superior accuracy and convergence with marginal parameter sensitivity compared to the penalty-based approach and successfully captures the dominant rotational recrystallization mechanism including block dislocation structures and grain boundary migration.

42 ENGINEERING↗

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗

Non-uniform active learning for Gaussian process models with applications to trajectory informed aerodynamic databases

The ability to non-uniformly weight the input space is desirable for many applications, and has been explored for space-filling approaches. Increased interests in linking models, such as in a digital twinning framework, increases the need for sampling emulators where they are most likely to be evaluated. In particular, here we apply non-uniform sampling methods for the construction of aerodynamic databases. This paper combines non-uniform weighting with active learning for Gaussian Processes (GPs) to develop a closed-form solution to a non-uniform active learning criterion. We accomplish this by utilizing a kernel density estimator as the weight function. We demonstrate the need and efficacy of this approach with an atmospheric entry example that accounts for both model uncertainty as well as the practical state space of the vehicle, as determined by forward modeling within the active learning loop.

42 ENGINEERING↗

Surface analysis insight note: Differentiation methods applicable to noisy data for determination of sp2‐ versus sp3‐hybridization of carbon allotropes and AES signal strengths

The derivatives of the spectra are commonly used for quantification in Auger Electron Spectroscopy (AES) spectra, while the derivative of the KLL C Auger line has proven to be valuable in obtaining a measure of the relative proportions of sp 2 ‐ and sp 3 ‐hybridization using the D‐parameter in both AES and X‐ray Photoelectron Spectroscopy (XPS). Differentiation of X‐ray Photoelectron Spectroscopy (XPS) and Auger Electron Spectroscopy (AES) spectra by numerical means is presented and illustrated for polymeric, such as PEEK and Nylon, as well as for graphitic materials including highly ordered pyrolytic graphite and graphene oxide. The most commonly available Savitzky–Golay method is explained mathematically and developed through the case of constructing a 5‐point quadratic polynomial convolution kernel suitable for differentiating spectra of adequate signal to noise. The concept of differentiation of spectra where signal to noise is less than adequate is also developed. Two alternative strategies to Savitzky–Golay differentiation are presented, which fit curves to data that allow derivatives to be obtained where Savitzky–Golay would otherwise fail. These alternative methods involve constructing a parametric curve that fits data over the entire energy interval of interest. Derivatives of spectra are then obtained by differentiating these parametric curves directly. A comparison of results for different materials for which specific sp 2 ‐ vs sp 3 ‐hybridized carbon proportions are of interest is used to emphasize the importance of characterizing methods used to differentiate spectra and understanding the characteristics of instrumentation used to measure spectra. The case for using Principal Component Analysis noise reduction with C KLL spectra is made for spectra collected from a heterogeneous graphene oxide sample.

Fairley, Neal↗

Automated Experiments of Local Non–Linear Behavior in Ferroelectric Materials

An automated experiment in multimodal imaging to probe structural, chemical, and functional behaviors in complex materials and elucidate the dominant physical mechanisms that control device function is developed and implemented. Here, the emergence of non-linear electromechanical responses in piezoresponse force microscopy (PFM) is explored. Non-linear responses in PFM can originate from multiple mechanisms, including intrinsic material responses often controlled by domain structure, surface topography that affects the mechanical phenomena at the tip-surface junction, and the presence of surface contaminants. Using an automated experiment to probe the origins of non-linear behavior in ferroelectric lead titanate (PTO) and ferroelectric Al 0.93 B 0.07 N films, it is found that PTO shows asymmetric nonlinear behavior across a/c domain walls and a broadened high nonlinear response region around c/c domain walls. In contrast, for Al 0.93 B 0.07 N, well-poled regions show high linear piezoelectric responses, when paired with low non-linear responses regions that are multidomain show low linear responses and high nonlinear responses. It is shown that formulating dissimilar exploration strategies in deep kernel learning as alternative hypotheses allows for establishing the preponderant physical mechanisms behind the non-linear behaviors, suggesting that automated experiments can potentially discern between competing physical mechanisms. Furthermore, this technique can also be extended to electron, probe, and chemical imaging.

36 MATERIALS SCIENCE↗

Sparse Matrix-Based HPC Tomography

Tomographic imaging has benefited from advances in X-ray sources, detectors and optics to enable novel observations in science, engineering and medicine. These advances have come with a dramatic increase of input data in the form of faster frame rates, larger fields of view or higher resolution, so high performance solutions are currently widely used for analysis. Tomographic instruments can vary significantly from one to another, including the hardware employed for reconstruction: from single CPU workstations to large scale hybrid CPU/GPU supercomputers. Furthermore, flexibility on the software interfaces and reconstruction engines are also highly valued to allow for easy development and prototyping. This paper presents a novel software framework for tomographic analysis that tackles all aforementioned requirements. The proposed solution capitalizes on the increased performance of sparse matrix-vector multiplication and exploits multi-CPU and GPU reconstruction over MPI. Furthermore, the solution is implemented in Python and relies on CuPy for fast GPU operators and CUDA kernel integration, and on SciPy for CPU sparse matrix computation. As opposed to previous tomography solutions that are tailor-made for specific use cases or hardware, the proposed software is designed to provide flexible, portable and high-performance operators that can be used for continuous integration at different production environments, but also for prototyping new experimental settings or for algorithmic development. The experimental results demonstrate how our implementation can even outperform state-of-the-art software packages used at advanced X-ray sources worldwide.

97 MATHEMATICS AND COMPUTING↗

MatRIS: Addressing the Challenges for Portability and Heterogeneity Using Tasking for Matrix Decomposition (Cholesky)

The ubiquitous in-node heterogeneity of HPC and cloud computing platforms makes software portability and performance optimization extremely challenging. Described here, the MatRIS multilevel math library abstraction framework employs tasking to alleviate these difficulties. MatRIS includes the IRIS task-based runtime on the bottom level and exposes different layers of abstraction to render algorithms architecturally agnostic. MatRIS ensures the decomposition and creation of tasks that represent the necessary encapsulation of the optimized kernels from both vendor and open-source math libraries. Once built, MatRIS can select different combinations of accelerators at runtime, making it portable even on diverse heterogeneous architectures. By leveraging the IRIS runtime’s features for managing heterogeneity, MatRIS deploys algorithms that remove the need to specify orchestration and data transfer. This study describes how the serial task abstraction of a tiled Cholesky factorization is made portable and scalable in the case of multi-device and multi-vendor heterogeneity on a node with NVIDIA and AMD GPUs by using MatRIS. First, we demonstrate that Cholesky in MatRIS provides multi-GPU scalability that offers competitive performance versus cuSolverMG. Then, we present the challenges and opportunities for heterogeneous execution.

Monil, M. A. H.↗

Benchmarking Operators in Deep Neural Networks for Improving Performance Portability of SYCL

SYCL is a portable programming model for heterogeneous computing, so it is important to obtain reasonable performance portability of SYCL. Towards the goal of better understanding and improving performance portability of SYCL for machine learning workloads, we have been developing benchmarks for basic operators in deep neural networks (DNNs). These operators could be offloaded to heterogeneous computing devices such as graphics processing units (GPUs) to speed up computation. In this paper, we introduce the benchmarks, evaluate the performance of the operators on GPU-based systems, and describe the causes of the performance gap between the SYCL and Compute Unified Device Architecture (CUDA) kernels. We find that the causes are related to the utilization of the texture cache for read-only data, optimization of the memory accesses with strength reduction, use of local memory, and register usage per thread. We hope that the efforts of developing benchmarks for studying performance portability will stimulate discussion and interactions within the community.

Jin, Zheming [ORNL] (ORCID:000000027197780X)↗

Constraints on a massive double-copy and applications to massive gravity

We propose and study a BCJ double-copy of massive particles, showing that it is equivalent to a KLT formula with a kernel given by the inverse of a matrix of massive bi-adjoint scalar amplitudes. For models with a uniform non-zero mass spectrum we demonstrate that the resulting double-copy factors on physical poles and that up to at least 5-particle scattering, color-kinematics duality satisfying numerators always exist. For the scattering of 5 or more particles, the procedure generically introduces spurious singularities that must be cancelled by imposing additional constraints. When massive particles are present, color-kinematics duality is not enough to guarantee a physical double-copy. As an example, we apply the formalism to massive Yang-Mills and show that up to 4-particle scattering the double-copy construction generates physical amplitudes of a model of dRGT massive gravity coupled to a dilaton and a two-form with dilaton parity violating couplings. We show that the spurious singularities in the 5-particle double-copy do not cancel in this example, and the construction fails to generate physically sensible amplitudes. We conjecture sufficient constraints on the mass spectrum, which in addition to massive BCJ relations, guarantee the absence of spurious singularities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parton distribution function for topological charge at one loop

We present results for the gg-part of the one-loop corrections to the recently introduced “topological charge” GPD F~(x, q 2 ). In particular, we give expression for its evolution kernel. To enforce strict compliance with the gauge invariance requirements, we have used on-shell states for external gluons, and have obtained identical results both in Feynman and light-cone gauges. No “zero mode” δ(x) terms were found for the twist-4 gluon GPD F~(x, q 2 ).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The reflected entanglement spectrum for free fermions

We consider the reflected entropy and the associated entanglement spectrum for free fermions reduced to two intervals in 1 + 1 dimensions. Working directly in the continuum theory the reflected entropy can be extracted from the spectrum of a singular integral equation whose kernel is determined by the known free fermion modular evolved correlation function. We find the spectrum numerically and analytically in certain limits. For intervals that almost touch the reflected entanglement spectrum approaches the spectrum of the thermal density matrix. This suggests that the reflected entanglement spectrum is well suited to the task of extracting physical data of the theory directly from the ground state wave function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Index-like theorem for massless fermions in spherically symmetric monopole backgrounds

In this paper we study massless fermions coupled to spherically symmetric SU(N) monopoles without Yukawa couplings between the Higgs and fermion fields. The corresponding Dirac operator is not Fredholm and the associated eigenfunctions are not L 2 -normalizable. Here we derive a formula for the dimension of the plane-wave normalizable kernel of such a Dirac operator for fermions of any representation of SU(N) in the presence of any spherically symmetric monopole background. Notably, our results also apply to fermions coupled to monopoles that preserve non-abelian gauge symmetry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effects of threshold resummation for large-x PDF in large momentum effective theory

Parton distribution functions (PDFs) at large x are challenging to extract from experimental data, yet they are essential for understanding hadron structure and searching for new physics beyond the Standard Model. Within the framework of the large momentum P z expansion of lattice quasi-PDFs, we investigate large x PDFs, where the matching coefficient is factorized into the hard kernel, related to the active quark momentum xP z , and the threshold soft function, associated with the spectator momentum (1 − x)P z . The renormalization group equation of the soft function enables the resummation of the threshold double logarithms α k ln 2k (1 − x), which is crucial for a reliable and controllable calculation of large x PDFs. Our analysis with pion valence PDFs indicates that perturbative matching breaks down when the spectator momentum (1 − x)P z approaches Λ QCD , but remains valid when both xP z and (1 − x)P z are much larger than Λ QCD . Additionally, we incorporate leading renormalon resummation within the threshold framework, demonstrating good perturbative convergence in the region where both spectator and active quark momenta are perturbative scales.

factorization↗