Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “performance gain”

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

Enhanced Catalyst Durability and Sulfur Tolerance by Atomic Layer Deposition (CRADA Final Report)

This CRADA advanced the use of atomic layer deposition (ALD) catalyst coatings to improve sulfur tolerance and demonstrate improved catalyst durability for biomass conversion chemistries. This project leveraged National Laboratory and industry expertise for ALD catalyst coating development between NREL, ALD NanoSolutions, Inc. ("ALD NanoSolutions"), and Johnson Matthey PLC ("Johnson Matthey"). To better understand the role of ALD coatings on catalyst activity and durability, a joint experimental and computational effort combined bench-scale ALD catalyst synthesis, material characterization, catalyst testing, and modeling of catalyst surface energetics. In addition, to demonstrate the commercial relevance of this technology, scaled ALD coated catalysts were subjected to continuous testing and accelerated aging to validate performance gains. Results were used to inform ALD catalyst coating manufacturing cost models, as well as biobased chemical process cost models.

09 BIOMASS FUELS↗
DOE OSTI2022

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current stateof-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Gaussian process for calibration and control of GlueX Central Drift Chamber

We have developed and implemented a machine learning based system to calibrate and control the GlueX Central Drift Chamber at Jefferson Lab, VA, in near real-time. The system monitors environmental and experimental conditions during data taking and uses those as inputs to a Gaussian process (GP) with learned prior. The GP predicts calibration constants in order to recommend a high voltage (HV) setting for the detector that maintains consistent detector performance (gain and resolution) throughout data taking. This approach is in stark contrast to traditional detector operations in which the detector operates at fixed HV and its calibration parameters vary quite considerably with time. Additionally, the ML based system utilizes uncertainty quantification to correct the recommended control parameters when appropriate. We will present results from the ML system autonomously during the Charged Pion Polarizability (CPP) experiment conducted in Hall D at Jefferson Lab.

McSpadden, Helen↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Rheo–Electric Foundations and Engineering of Carbon Slurry Flow Electrodes

Flowable carbon slurry electrodes promise continuous, scalable electrochemical desalination and energy storage when their rheology (flow and stability) and electronic connectivity are jointly optimized. This report integrates six complementary thrusts that we executed under the Laboratory Directed Research and Development (LDRD) project: (i) a fast, ex situ, centrifuge-compatible method to quantify pellet (packed slurry) electronic conductivity, with a validated cell constant (“shape factor”) and quantitative structure–property insights for carbon mixtures; (ii) a controlled circulation study showing that peristaltic pumping can irreversibly alter particle size and morphology over laboratory-relevant durations; (iii) development of a miniature jet pump that preserves particle integrity while achieving entrainment ratios of 2–4 at practical flow rates; (iv) a comprehensive mapping of how a representative non-ionic surfactant (Tween 20) collapses the carbon gel network, separating network-percolation losses from intrinsic particle contact resistance; (v) in-situ visualization revealing how gravitational settling and flow-driven mixing compete to control charge transport, with dynamic bed layers preventing saturation while achieving 30-fold local concentration enhancement; and (vi) a simple, widely adoptable fabrication route to structured, gas-nitrided titanium nitride (TiN) titanium current collectors that dramatically lower interfacial losses and enable geometry-driven performance gains. Together, these results provide a coherent toolchain and design rules to accelerate formulation screening, de-risk device prototyping, and standardize characterization for carbon slurry electrodes in flow-electrode capacitive deionization (FCDI), electrochemical flow capacitor (EFC), and related systems.

25 ENERGY STORAGE↗
DOE OSTI2025

Accelerating Floating-Point Computations with Intel AMX

Intel AMX is a built-in component of recent Intel CPU architectures, first supported by the Intel Sapphire Rapids in 2023, that enables efficient dense matrix multiplications using mixed precision with low-precision data types. The popularity of mixed-precision algorithms has grown recently, primarily due to their use on GPUs to enhance the efficiency of HPC applications, particularly for the training of large language models. The availability of mixed precision on CPUs represents a cost-effective solution for applications where high speed is not critical. This report shows how to use the Intel AMX accelerator through examples in C++ and Python. The examples will focus on mixed-precision floating-point operations obtained by the use of bfloat16 (or BF16) to accelerate code in single precision. We employ a bottom-up methodology, starting from specific register instructions (TMUL operation) to higher-level applications in libraries such as Intel MKL, PyTorch, and TensorFlow, ensuring a comprehensive understanding of the accelerator's potential. Additionally, we provide insights into the expected performance gains when leveraging the accelerator on the Kestrel HPC machine at the National Renewable Energy Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Moderator Test Station at ORNL

Oak Ridge National Laboratory (ORNL) hosts two world-leading slow neutron sources, the Spallation Neutron Source (SNS) and the High Flux Isotope Reactor (HFIR), and is currently developing the technical design for a Second Target Station (STS) for the SNS. Upon completion of the STS project, ORNL will be uniquely positioned to optimize each of its three neutron sources, the SNS First Target Station (FTS), the STS, and HFIR, in a complementary way. Among the essential aspects of a reimagined FTS and the current STS concept are high-brightness parahydrogen moderators—moderators which are optimized for high per-unit-area neutron brightness rather than integrated-across-large-area neutron intensity. The high-brightness moderators proposed for the STS will significantly outperform the coupled moderators currently on the FTS for appropriately optimized neutron beamlines, provided the moderating hydrogen is converted to near-equilibrium levels of parahydrogen (approximately 99.8% at 20 K). The original FTS moderators, by contrast, were conservatively designed to be relatively insensitive to the exact ortho:para ratio, with a consequent loss in performance. As a result, a redesign of the FTS moderators assuming fully converted parahydrogen could result in significant performance improvements on the FTS coupled moderators, and more consistent performance over time for all hydrogen moderators. This “parahydrogen problem” is a long-standing challenge for the effective implementation of hydrogen cold moderators at high-power neutron sources. In addition, the development of new moderator concepts, whether based on previously unused materials, structured heterogeneous arrays, or even simply on changes in overall shape and size is significantly restricted at a large-scale production facility intended to use the neutron beams so produced. Accordingly, moderators for production neutron sources are often designed in a very conservative, low-risk fashion, even though this compromises the absolute neutronic performance. Advanced moderator concepts worthy of study include features that could not be tested without redesigning and redeploying the entire existing reflector, shielding, and neutron beamline installation, making such development efforts far more expensive than building a stand-alone test facility. We propose a Moderator Test Station (MTS) at the SNS with which we will verify such performance gains and test new moderator concepts. These concepts include both high-brightness and large-volume parahydrogen moderators, as well as moderators with tailored ortho:para hydrogen levels, heterogeneous moderator concepts such as the convoluted moderator or pelletized moderators, and moderators made of materials like ammonia, ethane, and oxygen clathrates, which have not been widely tested let alone deployed at neutron source facilities.

42 ENGINEERING↗
DOE OSTI2023

Using Numba for GPU acceleration of Neutron Beamline Digital Twins

Digital twins of neutron instruments using Monte Carlo ray tracing have proven to be useful in neutron data analysis and verifying instrument and sample designs. However, these simulations can become quite complex and computationally demanding with tens of billions of neutrons. In this paper, we present a GPU accelerated version of MCViNE using Python and Numba to balance user extensibility with performance. Numba is an open-source just-in-time (JIT) compiler for Python using LLVM to generate efficient machine code for CPUs and GPUs with NVIDIA CUDA. The JIT nature of Numba allowed complex instrument kernels to be generated easily. Initial simulations have shown a speedup between 200-1000x over the original CPU implementation. The performance gain with Numba enables more sophisticated data analysis and impacts neutron scattering science and instrument design.

Kendrick, Coleman↗
DOE OSTI2022

Multi-Sensor Optimal Motion Planning for Radiological Contamination Surveys by Using Prediction-Difference Maps

Distributed and networked mobile sensor platforms using unmanned aerial and/or ground vehicles to survey areas of interest offer a safer and more efficient method for radiological contamination mapping; however, most applications rely on uniformly sweeping of the area in a raster-type motion without utilizing the information available in a dynamic sense. We have developed a fully autonomous optimal motion planning procedure for networks with two or more mobile sensors. The procedure utilizes well-established concepts of Gaussian processes in combination with control laws based on centroidal Voronoi tessellations to achieve optimal next-iteration sensor movements. A new method of informing optimal motion planning is proposed, whereby the absolute difference between the prior and current full-map prediction, referred to as the prediction-difference map, is used as the spatial density function within each Voronoi cell, providing immediate and iterative feedback for dynamic use of available information. The Gaussian process regression model used to estimate the contamination in unvisited locations also provides prediction uncertainties, and can be used as a quantitative metric to assess the confidence in the calculated contamination map; these estimates and prediction uncertainties are unavailable for standard uniform survey routines as they can only produce maps in the vicinity of observed locations. We present through simulation the achievable performance gains from using this new method by directly comparing to a uniform survey method. Results show that using the prediction-difference maps to inform motion planning procedures offers a faster rate of producing an accurate and convergent map relative to a uniform survey route.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

A Novel Algorithm for CAD to CSG Conversion in McCAD

Modeling and simulation lie at the heart of the design process of any nuclear application. An accurate representation of the radiation environment ensures not only the feasibility of new technologies, but it also aids in operation, maintenance, and even decommissioning. With increasingly complex designs, high-fidelity models have become a necessity for design maturity. McCAD has been under development for many years at Karlsruhe Institute of Technology (KIT) to facilitate the process of generating suitable models for nuclear analyses. In this paper, an overview of the major advances in the new version of the code is presented. A novel conversion algorithm has proven to be robust in significantly reducing the processing time to generate radiation transport models, making it easier to iterate on design details. A first-of-a-kind capability to generate hierarchical void cells is also discussed with preliminary analysis showing performance gains for particle tracking.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Deep Convolutional Neural Networks Exploit High-Spatial- and -Temporal-Resolution Aerial Imagery to Phenotype Key Traits in Miscanthus

Miscanthus is one of the most promising perennial crops for bioenergy production, with high yield potential and a low environmental footprint. The increasing interest in this crop requires accelerated selection and the development of new screening techniques. New analytical methods that are more accurate and less labor-intensive are needed to better characterize the effects of genetics and the environment on key traits under field conditions. We used persistent multispectral and photogrammetric UAV time-series imagery collected 10 times over the season, together with ground-truth data for thousands of Miscanthus genotypes, to determine the flowering time, culm length, and biomass yield traits. We compared the performance of convolutional neural network (CNN) architectures that used image data from single dates (2D-spatial) versus the integration of multiple dates by 3D-spatiotemporal architectures. The ability of UAV-based remote sensing to rapidly and non-destructively assess large-scale genetic variation in flowering time, height, and biomass production was improved through the use of 3D-spatiotemporal CNN architectures versus 2D-spatial CNN architectures. The performance gains of the best 3D-spatiotemporal analyses compared to the best 2D-spatial architectures manifested in up to 23% improvements in R2, 17% reductions in RMSE, and 20% reductions in MAE. The integration of photogrammetric and spectral features with 3D architectures was crucial to the improved assessment of all traits. In conclusion, our findings demonstrate that the integration of high-spatiotemporal-resolution UAV imagery with 3D-CNNs enables more accurate monitoring of the dynamics of key phenological and yield-related crop traits. This is especially valuable in highly productive, perennial grass crops such as Miscanthus, where in-field phenotyping is especially challenging and traditionally limits the rate of crop improvement through breeding.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

TCF Base Technology-Specific Final Report: Negative Cracked Film Lithography for PERC CdTe

NLR worked with the world's leading thin-film photovoltaic manufacturer - First Solar, an American company - to develop electrical contacting methods that improve the power conversion efficiency of First Solar's cells by 0.5% absolute. We met this milestone but contrary to our hypothesis, these performance gains are not passivation (PERC)-based. Instead, we identified another mechanism by which our micropatterned Al 2 O 3 contacts improve efficiency. Using the results of this project, we will adapt NLR's cracked film lithography intellectual property (IP) toward the application we identified, which is a new route to commercialization.

14 SOLAR ENERGY↗
DOE OSTI2020

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N. One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an “intelligent” mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗
DOE OSTI2020

Improving Performance of M-to-N Processing and Data Redistribution in In Transit Analysis and Visualization

In an in transit setting, a parallel data producer, such as a numerical simulation, runs on one set of ranks M, while a data consumer, such as a parallel visualization application, runs on a different set of ranks N: One of the central challenges in this in transit setting is to determine the mapping of data from the set of M producer ranks to the set of N consumer ranks. This is a challenging problem for several reasons, such as the producer and consumer codes potentially having different scaling characteristics and different data models. The resulting mapping from M to N ranks can have a significant impact on aggregate application performance. In this work, we present an approach for performing this M-to-N mapping in a way that has broad applicability across a diversity of data producer and consumer applications. We evaluate its design and performance with a study that runs at high concurrency on a modern HPC platform. By leveraging design characteristics, which facilitate an ''intelligent'' mapping from M-to-N, we observe significant performance gains are possible in terms of several different metrics, including time-to-solution and amount of data moved.

Loring, Burlen↗
DOE OSTI2021

Topological Machine Learning Methods for Power System Responses to Contingencies: Preprint

While deep learning tools, coupled with the emerging machinery of topological data analysis, are proven to deliver various performance gains in a broad range of applications, from image classification to biosurveillance to blockchain fraud detection, their utility in areas of high societal importance such as power system modeling and, particularly, resilience quantification in the energy sector yet remain untapped. To provide fast acting synthetic regulation and contingency reserve services to the grid while having minimal disruptions on customer quality of service, we propose a new topologybased system that depends on neural network architecture for impact metrics classification and prediction in power systems. This novel topology-based system allows one to evaluate the impact of three power system contingency types, namely, in conjunction with transmission lines, transformers, and transmission lines combined with transformers. We show that the proposed new neural network architecture equipped with local topological measures facilitates both more accurate classification of unserved load as well as the amount of unserved load. In addition, we are able to learn complex relationships between electrical properties and local topological measurements on the simulated response to contingencies for NREL-SIIP power system.

graph theory↗
DOE OSTI2022

Improving the Performance of DGEMM with MoA and Cache-Blocking: Preprint

The goal of this paper is to demonstrate performance enhancements of the high performance dense linear algebra matrix-matrix multiply DGEMM kernel, widely implemented by vendors in the basic linear algebra subroutine BLAS library. The mathematics of arrays (MoA) paradigm due to Mullin (1988) results in contiguous memory accesses in combination with Church-Rosser complete language constructs optimized for target processor architectures [3]. Our performance studies demonstrate that the MoA implementation of DGEMM combined with optimal cache-blocking strategies results in at least a 25% performance gain on both Intel Xeon Skylake and IBM Power-9 processors over the vendor supplied Intel MKL and IBM ESSL basic linear algebra libraries. Results are presented for the NREL Eagle and ORNL Summit supercomputers.

cache-blocking↗
DOE OSTI2022

Threaded Multi-Core GEMM with MoA and Cache-Blocking: Preprint

A threaded multi-core implementation of the high performance dense linear algebra matrix-matrix multiply GEMM kernel is described. This kernel is widely implemented by vendors in the basic linear algebra subroutine BLAS library. The mathematics of arrays (MoA) paradigm due to Mullin (1988) results in contiguous memory accesses by employing outer-product forms. Our performance studies demonstrate that the MoA implementation of double precision DGEMM combined with optimal cache-blocking strategies results in at least a 25% performance gain on the Intel Xeon Skylake processor over the vendor supplied Intel MKL basic linear algebra libraries. Results are presented for the NREL Eagle supercomputer. The multi-core DGEMM achieves over 100 GigaFlops/sec with eight openMP threads.

cache-blocking↗
DOE OSTI2021

Topological Machine Learning Methods for Power System Responses to Contingencies

While deep learning tools, coupled with the emerging machinery of topological data analysis, are proven to deliver various performance gains in a broad range of applications, from image classification to biosurveillance to blockchain fraud detection, their utility in areas of high societal importance such as power system modeling and, particularly, resilience quantification in the energy sector yet remains untapped. To provide fast acting synthetic regulation and contingency reserve services to the grid while having minimal disruptions on customer quality of service, we propose a new topology-based system that depends on a neural network architecture for impact metric classification and prediction in power systems. This novel topology-based system allows one to evaluate the impact of three power system contingency types, in conjunction with transmission lines, transformers, and transmission lines combined with transformers. We show that the proposed new neural network architecture equipped with local topological measures facilitates more accurate classification of unserved load as well as the amount of unserved load. In addition, we are able to learn more about the complex relationships between electrical properties and local topological measurements on their simulated response to contingencies for the NREL-SIIP power system.

contingency analysis↗