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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Clustering at Massive Scale

ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.

Stanley, ThomasA [Lawrence Livermore National Labo↗
DOE OSTI2026

Particle Filter Based Inference Testing

The primary intent of PAR-FIT (Particle Filter based Inference Testing) is to provide hard inductive evidence that a machine learning model is capable and proven for an individual test input. By examining training data used to form the underlying model functional correlation, an estimate of the reliability that a model will make the correct prediction can be made. The Sequential Probability Ratio Test is used to derive a qualitative evaluation for reliability based on hypothesis testing. The PAR-FIT framework achieves this by implementing a particle filter and the sequential probability ratio test algorithms on the machine learning model training data to determine relevancy of new individual test samples to the training dataset. The kernel function evaluates the local proximity and density of training data used to derive a prediction outcome. Particles are used to probabilistically determine which training data to evaluate for proximity. For test samples that are within a close proximity to and surrounded by multiple training data points, the evaluated reliability of the prediction is high. For test samples that are anomalies not represented by the training dataset, in low density data clusters, or are far from existing data points, the evaluated reliability is low as insufficient training evidence exists to suggest the model is capable of making the correct prediction. Sequential Probability Ratio Test is further used to determine when a hypothesis on whether a signal can be rejected or accepted for use. The ratio test collects sequence information from the particle filter to test whether the signal is anomalous or normal via hypothesis testing of the underlying distributions.

Chen, Edward [Idaho National Laboratory (INL), Ida↗
DOE OSTI2024

ENDF/B-VIII.1

The ENDF/B-VIII.1 release is the newest evaluated nuclear data library produced, distributed, and recommended by CSEWG for use in nuclear science and technology applications. Among the many key advances, relative to the previous version ENDF/B-VIII.0, are: re-evaluation of 239Pu file by a joint international effort; updated 16,18O, 19F, 28-30Si, 50-54Cr, 55Mn, 54,56,57Fe, 63,65Cu, 139La, 233,235,238U, and 240,241Pu neutron nuclear data by the IAEA-coordinated INDEN collaboration; significant changes for 3He, 6Li, 9Be, 51V, 88Sr, 103Rh, 140,142Ce, Dy, 181Ta, Pt, 206-208Pb, and 234,236U neutron data; new nuclear data for the photo-nuclear, being 196 adopted from the IAEA2019 Photonuclear Data Library and one new file from JENDL-5; and new evaluations for the charged-particle and atomic sublibraries. Numerous thermal neutron scattering kernels were re-evaluated or provided for the very first time. Additionally, new covariance testing was implemented. ENDF/B-VIII.1 reduced bias in the simulations of many integral experiments with particular progress noted for fluorine, copper and stainless steel containing benchmarks. Data issues which had hindered the deployment of ENDF/B-VIII.0 for commercial nuclear power applications in high burn-up situations, were addressed. ENDF/B-VIII.1 data are distributed in both ENDF-6 and GNDS formats.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

DRB-ML-Dataset

This datastet contains kernels extracted from OpenMP microbenchmarks collected in DataRaceBench. The purpose of this dataset is to serve as training data for machine learning with programming language processing (PLP).

Lin, Pei-Hung↗
DOE OSTI2020

Sensitivity of surface temperature to oceanic forcing via q-Flux Green’s function experiments. Part III: asymmetric response to warming and cooling

Climate response is often assumed to be linear in climate sensitivity studies. However, by examining the surface temperature (TS) response to pairs of oceanic forcings of equal amplitude but opposite sign in a large set of local q-flux perturbation experiments with CAM5 coupled to a slab, we find strong asymmetry in TS responses to the heating and cooling forcings, indicating a strong nonlinearity intrinsic to the climate system examined. Regardless of where the symmetric forcing is placed, the cooling response to the negative forcing always exceeds the warming to the positive forcing, implying an intrinsic inclination towards cooling of our current climate. Thus, the ongoing global warming induced by increasing greenhouse gases may have already been alleviated by the asymmetric component of the response. The common asymmetry in TS response peaks in high latitudes, especially along sea ice edges, with notable seasonal dependence. Decomposition into different radiative feedbacks through a radiative kernel indicates that the asymmetry in the TS response is realized largely through lapse rate and albedo feedbacks. Further process interference experiments disabling the seasonal cycle and/or sea ice reveal that the asymmetry originates ultimately from the presence of the sea ice component and is further amplified by the seasonal cycle. The fact that a pair of opposite tropical q-flux forcings can excite very similar asymmetric response as a pair placed at 55°S strongly suggests the asymmetric response is a manifestation of an internal mode of the climate model system.

Liu, Fukai↗
DOE OSTI2025

Tropical High Cloud Feedback Relationships to Climate Sensitivity

Clouds constitute a large portion of uncertainty in predictions of equilibrium climate sensitivity (ECS). While low cloud feedbacks have been the focus of intermodel studies due to their high variability among global climate models, tropical high cloud feedbacks also exhibit considerable uncertainty. Here, we apply the cloud radiative kernel technique of Zelinka et al. to 22 models across the CMIP5 and CMIP6 ensembles to survey tropical high cloud feedbacks and analyze their relationship to ECS. We find that the net high cloud feedback and its altitude and optical depth feedback components are significantly positively correlated with ECS in the tropical mean. On the other hand, the tropical mean high cloud amount feedback is not correlated with ECS. These relationships are most pronounced outside of areas of strong climatological ascent, suggesting the importance of thin cirrus feedbacks. Finally, we explore connections between high cloud feedbacks, climate sensitivity, and mean state high cloud properties. In general, high ECS models are cloudier in the upper troposphere but have a thinner high cloud population. Furthermore, we find that having more thin cirrus in the mean state relates to more positive high cloud altitude and optical depth feedbacks, and it either amplifies or dampens the high cloud amount feedback depending on the large-scale dynamical regime (amplifying in descent and dampening in ascent). In summary, our analysis highlights the importance of tropical high cloud feedbacks for driving intermodel spread in ECS and suggests that mean state high cloud characteristics might provide a unique opportunity for observationally constraining high cloud feedbacks.

atmosphere↗
DOE OSTI2021

Unprecedented cloud resolution in a GPU-enabled full-physics atmospheric climate simulation on OLCF’s summit supercomputer

Clouds represent a key uncertainty in future climate projection. While explicit cloud resolution remains beyond our computational grasp for global climate, we can incorporate important cloud effects through a computational middle ground called the Multi-scale Modeling Framework (MMF), also known as Super Parameterization. This algorithmic approach embeds high-resolution Cloud Resolving Models (CRMs) to represent moist convective processes within each grid column in a Global Climate Model (GCM). The MMF code requires no parallel data transfers and provides a self-contained target for acceleration. This study investigates the performance of the Energy Exascale Earth System Model-MMF (E3SM-MMF) code on the OLCF Summit supercomputer at an unprecedented scale of simulation. Hundreds of kernels in the roughly 10K lines of code in the E3SM-MMF CRM were ported to GPUs with OpenACC directives. A high-resolution benchmark using 4600 nodes on Summit demonstrates the computational capability of the GPU-enabled E3SM-MMF code in a full physics climate simulation.

58 GEOSCIENCES↗
DOE OSTI2021

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Numerical eigen-spectrum slicing, accurate orthogonal eigen-basis, and mixed-precision eigenvalue refinement using OpenMP data-dependent tasks and accelerator offload

Performing a variety of numerical computations efficiently and, at the same time, in a portable fashion requires both an overarching design followed by a number of implementation strategies. All of these are exemplified below as we present transitioning the PLASMA numerical library from relying on dependence-driven large tasks to achieving utilization of fine grain tasking and offload to hardware accelerators while keeping its core dependence sets: OpenMP source code pragmas and runtime for most system-level functionality and basic low-level numerical kernels provided directly by hardware vendors or open source projects with vendor contributions. We also present new algorithmic methods and their efficient parallel implementations including fine grained tasking for eigen-spectrum slicing and offload for mixed-precision eigenvalue refinement. We provide performance, scaling, and numerical results showing sizable gains over the available solutions from either the open source and vendor-provided packages.

Luszczek, Piotr↗
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

UMap: An application-oriented user level memory mapping library

Exploiting the prominent role of complex memories in exascale node architecture, the UMap page fault handler offers new capabilities to access large memory-mapped data sets directly. UMap provides flexible configuration options to customize page handling to each application, including analysis of massive observational and simulation data sets. The high-performance design features I/O decoupling, dynamic load balancing, and application-level controls. Page faults triggered by application threads and processes accessing data mapped to a UMapp’ed region are handled via the Linux userfaultfd protocol, an asynchronous message-oriented kernel-user communication mechanism that avoids the context switch penalty of traditional signal fault handlers. UMap is fully open source. In this paper, we give an overview of the UMap library architecture, its extensible plugin architecture, and the use/performance of UMap in emerging heterogeneous memory hierarchies such as near-node Non-volatile Memory (NVM) and network attached memories. We highlight new capabilities in two pagefault management plugins, the NetworkStore and SparseStore. We demonstrate the integration between UMap and multiple ECP products including Caliper, Metall, ZFP, Mochi, and Ripples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A two-level GPU-accelerated incomplete LU preconditioner for general sparse linear systems

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block-Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors by targeting an algebraically smooth vector. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods on challenging anisotropic diffusion problems and a collection of general sparse matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Numerical investigation of a fueled pre-chamber spark-ignition natural gas engine

Pre-chamber spark-ignition (PCSI) is a leading advanced ignition concept for internal combustion engines with the potential to enable diesel-like efficiency in medium-duty/heavy-duty (MD/HD) natural gas (NG) engines. By leveraging distributed ignition sources from multiple turbulent jets, the PCSI technology can deliver extremely short combustion duration in ultra-lean mixtures and significantly improve the engine thermal efficiency. However, in the automotive industry there is a lack of adequate science base and predictive simulation tools required for commercial development of PCSI engines. Here, in this study, Reynolds-Average Navier-Stokes simulations are carried out to describe the combustion process in lean-burn NG engines, focusing on the combustion modeling approach. Two combustion models, multi-zone well-stirred reactor (MZ-WSR) and G-equation, are used to simulate the combustion process in an MD NG engine equipped with a fueled-PCSI system for four operating conditions close to the lean operating limit. A skeletal chemical mechanism and a laminar flame speed tabulation are used to compute the combustion accurately. Simulation results are compared with experimental data regarding measured cylinder pressure, heat release rate, and combustion duration. By dividing the PCSI combustion process into four distinct phases, the difference between the two models’ results for each phase is analyzed in detail. The MZ-WSR model overestimates the combustion duration for early flame kernel growth in the pre-chamber due to the lack of a specific formulation to take turbulence-chemistry interaction into account. Despite the prolonged combustion duration and low pressure built-up inside the pre-chamber, the model matches the combustion rate in the main-chamber. In contrast, the G-equation model delivers good agreements for the pre-chamber combustion and turbulent jet-driven combustion processes. However, the model starts to underestimate the combustion rate in the main-chamber, especially under ultra-lean mixture conditions. Finally, improvements are needed for both models to simulate the later combustion stage that occurred in the near-wall regions.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

An FPGA-based hardware accelerator supporting sensitive sequence homology filtering with profile hidden Markov models

Abstract Background Sequence alignment lies at the heart of genome sequence annotation. While the BLAST suite of alignment tools has long held an important role in alignment-based sequence database search, greater sensitivity is achieved through the use of profile hidden Markov models (pHMMs). Here, we describe an FPGA hardware accelerator, called HAVAC, that targets a key bottleneck step (SSV) in the analysis pipeline of the popular pHMM alignment tool, HMMER. Results The HAVAC kernel calculates the SSV matrix at 1739 GCUPS on a $$\sim$$ ∼ $3000 Xilinx Alveo U50 FPGA accelerator card, $$\sim$$ ∼ 227× faster than the optimized SSV implementation in nhmmer . Accounting for PCI-e data transfer data processing, HAVAC is 65× faster than nhmmer’s SSV with one thread and 35× faster than nhmmer with four threads, and uses $$\sim$$ ∼ 31% the energy of a traditional high end Intel CPU. Conclusions HAVAC demonstrates the potential offered by FPGA hardware accelerators to produce dramatic speed gains in sequence annotation and related bioinformatics applications. Because these computations are performed on a co-processor, the host CPU remains free to simultaneously compute other aspects of the analysis pipeline.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Disparities in the air quality monitoring stations and PM₂.₅ in Chicago’s air quality landscape

Fine particulate matter (PM₂.₅) poses significant public and environmental health risks in urban areas. Chicago’s dense industry and traffic create variable air quality, yet monitoring is unevenly distributed, resulting in undersampling of air quality data in some city areas. This study applied a hybrid approach using GIS-based kernel density mapping, interpolation modeling (IDW, Spline, Kriging) of USEPA monitoring data, multi-scale temporal trend analyses (hourly to annual), and ESDA. Accordingly, the density surface showed that monitors are concentrated in the affluent north, northwest, and southwest sides of Chicago (up to ~ 0.07 stations per sq mile), while the south and southeast regions, with predominantly minority communities, have virtually no coverage. Overall, citywide coverage is minimal (~ 4–5 monitors total; ~0.02 per sq mile; ≈1 per 600,000 residents). Temporal analyses showed that the city’s mean annual PM₂.₅ (~ 10.8 µg/m³) exceeds USEPA/WHO standards (9 µg/m³), with summer means (~ 17.1 µg/m³) significantly higher than other seasons. Diurnally, a clear pattern was observed, with PM₂.₅ concentrations peaking overnight (00:00–03:00) and during the morning rush hours, and dipping during midday to late afternoon. Spatial distribution of PM₂.₅ identified hotspots near O’Hare Airport, the downtown Loop area, and south-side neighborhoods, contrasting with lower concentrations on the north side, revealing Chicago’s socioeconomic divides and resulting environmental inequities. The findings underscore the need for expanded monitoring and targeted interventions in under-monitored, high-pollution communities to advance equitable community health.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Modeling spatial patterns of longleaf pine needle dispersal using long-term data

Abstract Background Predicting patterns of fire behavior and effects in frequent fire forests relies on an understanding of fine-scale spatial patterns of available fuels. Leaf litter is a significant canopy-derived fine fuel in fire-maintained forests. Litter dispersal is dependent on foliage production, stand structure, and wind direction, but the relative importance of these factors is unknown. Results Using a 10-year litterfall dataset collected within eighteen 4-ha longleaf pine ( Pinus palustris Mill.) plots varying in canopy spatial pattern, we compared four spatially explicit models of annual needle litter dispersal: a model based only on basal area, an overstory abundance index (OAI) model, both isotropic and anisotropic litter kernel models, and a null model that assumed no spatial relationship. The best model was the anisotropic model (R 2 = 0.656) that incorporated tree size, location, and prevailing wind direction, followed by the isotropic model (R 2 = 0.612), basal area model (R 2 = 0.488), OAI model (R 2 = 0.416), and the null model (R 2 = 0.08). Conclusions As with previous studies, the predictive capability of the litter models was robust when internally validated with a subset of the original dataset (R 2 = 0.196–0.549); however, the models were less robust when challenged with an independent dataset (R 2 = 0.122–0.319) from novel forest stands. Our model validation underscores the need for rigorous tests with independent, external datasets to confirm the validity of litter dispersal models. These models can be used in the application of prescribed fire to estimate fuel distribution and loading, as well as aid in the fine tuning of fire behavior models to better understand fire outcomes across a range of forest canopy structures.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Three-dimensional nanoscale reduced-angle ptycho-tomographic imaging with deep learning (RAPID)

X-ray ptychographic tomography is a nondestructive method for three dimensional (3D) imaging with nanometer-sized resolvable features. The size of the volume that can be imaged is almost arbitrary, limited only by the penetration depth and the available scanning time. Here we present a method that rapidly accelerates the imaging operation over a given volume through acquiring a limited set of data via large angular reduction and compensating for the resulting ill-posedness through deeply learned priors. The proposed 3D reconstruction method “RAPID” relies initially on a subset of the object measured with the nominal number of required illumination angles and treats the reconstructions from the conventional two-step approach as ground truth. It is then trained to reproduce equal fidelity from much fewer angles. After training, it performs with similar fidelity on the hitherto unexamined portions of the object, previously not shown during training, with a limited set of acquisitions. In our experimental demonstration, the nominal number of angles was 349 and the reduced number of angles was 21, resulting in a x140 aggregate speedup over a volume of 4.48 x 93.18 x 3.92 μm 3 and with (14nm) 3 feature size, i.e. ~ 10 8 voxels. RAPID’s key distinguishing feature over earlier attempts is the incorporation of atrous spatial pyramid pooling modules into the deep neural network framework in an anisotropic way. We found that adjusting the atrous rate improves reconstruction fidelity because it expands the convolutional kernels’ range to match the physics of multi-slice ptychography without significantly increasing the number of parameters.

47 OTHER INSTRUMENTATION↗