Search NASA⌕ Search

SEARCH · Search NASA

Results for “lookup”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Addition of tabulated equation of state and neutrino leakage support to illinoisgrmhd

Here we have added support for realistic, microphysical, finite-temperature equations of state (EOS) and neutrino physics via a leakage scheme to illinoisgrmhd, an open-source GRMHD code for dynamical spacetimes in the einstein toolkit. These new features are provided by two new, nrpy+-based codes: nrpyeos, which performs highly efficient EOS table lookups and interpolations, and nrpyleakage, which implements a new, adaptive mesh refinement (AMR)-capable neutrino leakage scheme in the einstein toolkit. We have performed a series of strenuous validation tests that demonstrate the robustness of these new codes, particularly on the Cartesian AMR grids provided by carpet. Furthermore, we show results from fully dynamical GRMHD simulations of single unmagnetized neutron stars, and magnetized binary neutron star mergers. This new version of illinoisgrmhd, as well as nrpyeos and nrpyleakage, is pedagogically documented in jupyter notebooks and fully open source. The codes will be proposed for inclusion in an upcoming version of the einstein toolkit.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Interaction models and configurational entropies of binary MoTa and the MoNbTaW high entropy alloy

We introduce a simplified method to model the interatomic interactions of high entropy alloys based on a lookup table of cluster energies. Furthermore, these interactions are employed in replica exchange Monte Carlo simulations with histogram analysis to obtain thermodynamic properties across a broad temperature range. Kikuchi's cluster variation method entropy formalism is applied to directly calculate entropy from statistics on short- and long-range chemical order, and we discuss the convergence of the entropy as clusters of differing size are included. A high temperature series expansion aids in our understanding of the convergence. Computer codes implementing these methods, and supporting data, are freely available on the internet.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Genetic Algorithm-Based Commutation Angle Control for Torque Ripple Mitigation in Switched Reluctance Motor Drives

This work addresses the application of the Genetic Algorithm (GA) technique to optimize the commutation angles of a 2 kW 8/6 switched reluctance machine (SRM). The primary goal is to reduce the well-known drawback of SRMs: the torque ripple. Firstly, the machine was modeled in Matlab /Simulink ® using lookup tables obtained via finite element method (FEM) simulations. Subsequently, the model was used to perform the GA routine aiming to find the optimal phase commutation angles that minimize the torque ripple factor. Notably, the torque performance of the SRM was significantly affected by the commutation angles during the search for the optimal solution. Afterwards, the GA results for four different operation points were verified experimentally through a developed drive platform with digital signal processor-based (DSP) control and an asymmetric bridge converter. As showed by the experiments, the proposed approach was suitable to reduce the torque ripple by more than 50% for one of the evaluated operating points. Furthermore, it was confirmed that the torque ripple mitigation led to acoustic noise improvement.

42 ENGINEERING↗
DOE OSTI2024

Fail-Safe Logic Design Strategies Within Modern FPGA Architectures

Fail-safe computing refers to computing systems that revert to a non-operational safe state when a fault occurs. In this paper, we investigate a circuit level technique as mitigation for single event upsets (SEUs) and fault injection attacks on field programmable gate arrays (FPGAs), and analyze the effectiveness of the technique as a fail-safe monitor for an encryption algorithm. The propagation of fault effects through FPGA primitives including lookup tables (LUTs) and programmable interconnect points (PIPs) is assessed within an FPGA architecture created using an open source tool, and validated using fault injection experiments on an FPGA. The analysis reveals additional vulnerabilities exist within reconfigurable architectures over those in equivalent fail-safe application specific integrated circuit (ASIC), thus requiring a more elaborate network of redundant circuits and checking logic. The configuration memory bits (CMBs), which configure routing and designate logic functions within the LUTs of the FPGA, add complexity to fail-safe design strategies by introducing additional fault conditions and fault propagation paths. A resource-efficient fail-safe circuit design technique called DEsign for Fail-safe in reCONfigurable systems (DEFCON) is proposed. The benefits and limitations associated with DEFCON are described in the context of fault injection experiments carried out as simulations and in FPGA hardware.

Bhakta, Priya A. [Univ. of New Mexico, Albuquerque↗
DOE OSTI2022

Hvac: Removing I/O Bottleneck for Large-Scale Deep Learning Applications

Scientific communities are increasingly adopting deep learning (DL) models in their applications to accelerate scientific discovery processes. However, with rapid growth in the computing capabilities of HPC supercomputers, large-scale DL applications have to spend a significant portion of training time performing I/O to a parallel storage system. Previous research works have investigated optimization techniques such as prefetching and caching. Unfortunately, there exist non-trivial challenges to adopting the existing solutions on HPC supercomputers for large-scale DL training applications, which include non-performance and/or failures at extreme scale, lack of portability and generality in design, complex deployment methodology, and being limited to a specific application or dataset. To address these challenges, we propose High-Velocity AI Cache (HVAC), a distributed read-cache layer that targets and fully exploits the node-local storage or near node-local storage technology. HVAC seamlessly accelerates read I/O by aggregating node-local or near node-local storage, avoiding metadata lookups and file locking while preserving portability in the application code. We deploy and evaluate HVAC on 1,024 nodes (with over 6000 NVIDIA V100 GPUS) of the Summit supercomputer. In particular, we evaluate the scalability, efficiency, accuracy, and load distribution of HVAC compared to GPFS and XFS-on-NVMe. With four different DL applications, we observe an average 25 % performance improvement atop GPFS and 9% drop against XFS-on-NVMe, which scale linearly and are considered the performance upper bound. We envision HVAC as an important caching library for upcoming HPC supercomputers such as Frontier.

Khan, Awais↗
DOE OSTI2022

Optimal Coordination of Distributed Energy Resources Using Deep Deterministic Policy Gradient

Recent studies showed that reinforcement learning (RL) is a promising approach for coordination and control of distributed energy resources (DER) under uncertainties. Many existing RL approaches, including Q-learning and approximate dynamic programming, are based on lookup table methods, which become inefficient when the problem size is large and infeasible when continuous states and actions are involved. In addition, when modeling battery energy storage system (BESS), the loss of life is not reasonably considered into the decision-making process. This paper proposes an innovative deep RL method for DER coordination considering BESS degradation. The proposed deep RL is designed based on an adaptive actor-critic architecture and employs an off-policy deterministic policy gradient method for determining the dispatch operation that minimizes the operation cost and BESS life loss. Case studies were performed to validate the proposed method and demonstrate the effects of incorporating degradation models into control design.

Das, Avijit↗
DOE OSTI2024

Optimal Coordination of Electric Vehicles for Grid Services using Deep Reinforcement Learning

Recent research has shown the effectiveness of reinforcement learning (RL) in coordinating electric vehicles (EVs) with vehicle-to-grid capabilities for grid services. However, many of these studies rely on lookup table and deep Q-network techniques, which can be impractical when dealing with continuous states and actions. In addition, existing RL designs inadequately account for battery aging effects, EV user satisfaction, uncertain departure and arrival time, and trip distance, which may compromise effective coordination. This paper aims to bridge these gaps by developing an innovative deep deterministic policy gradient-based RL framework for optimal coordination of EVs. Case studies were carried out using a test system with 100 EVs, and numerical analysis results showed that the proposed RL framework can effectively coordinate EVs to maximize economic benefits and user satisfaction while ensuring the expected battery lifespan.

Das, Avijit↗
DOE OSTI2024

Side-by-Side Comparison of Subhourly Clipping Models

Over the past several years there have been numerous attempts at quantifying the inherent power clipping of inverters due to subhourly irradiance variability that is not captured in hourly PV performance models. Different models have been proposed to correct for these clipping losses in PV performance estimates, including matrix lookup models, distribution modeling of the PV power performance within a given hour, and machine learning methods. To date, there have been few comprehensive quantitative comparisons of these inverter clipping correction modeling approaches to evaluate the effectiveness of these approaches in predicting the actual behavior of PV system inverter clipping. In this study, we perform such a comparison, evaluating the Allen and Walker correction loss modeling approaches recently implemented in the System Advisor Model (SAM) against clipping losses modeled with 1-minute climate data. These comparisons were performed across a variety of climate locations and inverter loading ratios to thoroughly analyze the effectiveness of these modeling approaches relative to each other. Results from this analysis reveal that both clipping correction approaches improve annual energy accuracy to within 2% of 1-minute modeled energy yield. The two models predict annual clipping loss more accurately than simple hourly power limit clipping, with the Allen method typically being slightly more accurate at typical ILR values and the Walker method often being slightly more accurate at high ILR values The models can improve accuracy over the status quo clipping approach up to 3 percentage points in systems with ILR of 2.0, showing the importance of this modeling factor in energy yield estimates.

accuracy↗
DOE OSTI2022

Neural network accelerator for quantum control

Efficient quantum control is necessary for practical quantum computing implementations with current technologies. Conventional algorithms for determining optimal control parameters are computationally expensive, largely excluding them from use outside of the simulation. Existing hardware solutions structured as lookup tables are imprecise and costly. By designing a machine learning model to approximate the results of traditional tools, a more efficient method can be produced. Such a model can then be synthesized into a hardware accelerator for use in quantum systems. In this study, we demonstrate a machine learning algorithm for predicting optimal pulse parameters. This algorithm is lightweight enough to fit on a low-resource FPGA and perform inference with a latency of 175 ns and pipeline interval of 5 ns with > 0.99 gate fidelity. In the long term, such an accelerator could be used near quantum computing hardware where traditional computers cannot operate, enabling quantum control at a reasonable cost at low latencies without incurring large data bandwidths outside of the cryogenic environment.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

BCSR on GPU: A Way Forward Extreme-scale Graph Processing on Accelerator-enabled Frontier Supercomputer

Handling large graphs in a distributed environment requires effective partitioning across processors and efficient management of local partitions. In 2D partitioning, local graphs often become too sparse, making memory-efficient data structures crucial. Using the Compressed Sparse Row (CSR) format wastes space, especially for > 83% of vertices with empty edges for the sparse graphs. This study explores bit-CSR (BCSR), a modified CSR representation, on GPUs to reduce memory usage in graph computations. We achieved 16.67% memory savings on a sparse rmat dataset with 268 million vertices and 357 million edges, without performance degradation, supported by both theoretical and experimental storage savings of 33%. However, we observed a 1.7× slowdown in degree lookup times due to bitwise operations on AMD CPUs. This analysis highlights the potential of BCSR on GPUs for improving Graph500 benchmark performance on GPU-accelerated systems, such as the Frontier supercomputer.

Sattar, Naw Safrin↗
DOE OSTI2021

Qualification of 3-D Printed Mortar With Electrical Conductivity Measurements

Additive manufacturing (AM) or 3D printing of concrete allows for construction of arbitrary shape structures without a mold. Since reproducibility of 3D printed concrete is lower than that of conventional fabrication, each 3D printed structure should be monitored for proper curing. Conventional qualification of concrete is based on several tests, including destructive compressive strength measurements. Because a structure is 3-D printed layer-by-layer, the surfaces of AM concrete structures have significant surface roughness. This limits the applicability of conventional nondestructive testing methods. We investigated qualification of 3D printed mortar by monitoring curing with nondestructive electrical conductivity measurements. Bulk resistance of concrete was extracted from electrochemical impedance spectroscopy (EIS measurements made using custom flexible self-adhesive electrodes, which contour to rough surfaces. We show that bulk resistivity of concrete increases linearly with time. This allows for developing a calibration curve for compressive strength lookup from nondestructive electrical conductivity measurements. Conductivity measurements also allow for estimation of formation factor, which is an indicator of mortar permeability.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Performance Optimization for Relative-Error-Bounded Lossy Compression on Scientific Data

Scientific simulations in high-performance computing (HPC) environments generate vast volume of data, which may cause a severe I/O bottleneck at runtime and a huge burden on storage space for postanalysis. Unlike traditional data reduction schemes such as deduplication or lossless compression, not only can error-controlled lossy compression significantly reduce the data size but it also holds the promise to satisfy user demand on error control. Pointwise relative error bounds (i.e., compression errors depends on the data values) are widely used by many scientific applications with lossy compression since error control can adapt to the error bound in the dataset automatically. Pointwise relative-error-bounded compression is complicated and time consuming. In this article, we develop efficient precomputation-based mechanisms based on the SZ lossy compression framework. Our mechanisms can avoid costly logarithmic transformation and identify quantization factor values via a fast table lookup, greatly accelerating the relative-error-bounded compression with excellent compression ratios. In addition, we reduce traversing operations for Huffman decoding, significantly accelerating the decompression process in SZ. Experiments with eight well-known real-world scientific simulation datasets show that our solution can improve the compression and decompression rates (i.e., the speed) by about 40 and 80 p, respectively, in most of cases, making our designed lossy compression strategy the best-in-class solution in most cases.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2020

Numerical Investigation of a Central Fuel Property Hypothesis Under Boosted Spark-Ignition Conditions

In the present work, a central fuel property hypothesis (CFPH), which states that fuel properties are sufficient to provide an indication of a fuel’s performance irrespective of its chemical composition, was numerically investigated. In particular, the objective of the study was to determine whether Research Octane Number (RON) and Motor Octane Number (MON), as fuel properties, are sufficient to describe a fuel’s knock-limited performance under boosted spark-ignition (SI) conditions within the framework of CFPH. To this end, four TPRF-bioblendstock surrogates having different compositions but matched RON (=98) and MON (=90), were first generated using a non-linear regression model based on artificial neural network (ANN). Additionally, three unconventional bioblendstocks were included in the analysis: di-isobutylene (DIB), isobutanol, and Anisole. Skeletal reaction mechanisms were generated for the TPRF-DIB, TPRF-isobutanol, and TPRF-anisole blends from a detailed kinetic mechanism. Thereafter, numerical simulations were performed for the fuel surrogates using the skeletal mechanisms and a virtual cooperative fuel research (CFR) engine model, under a representative boosted operating condition. In the computational fluid dynamics (CFD) model, the G-equation approach was employed to track the turbulent flame front and the well-stirred reactor model combined with the multi-zone binning strategy was used to capture auto-ignition in the end-gas. In addition, laminar flame speed (LFS) was tabulated for each blend as a function of pressure, temperature, and equivalence ratio a priori, and the lookup tables were used to prescribe laminar flame speed as an input to the G-equation model. Parametric spark timing sweeps were performed for each fuel blend to determine the corresponding knock-limited spark advance (KLSA) and 50% burn point (CA50) at the respective KLSA timing. It was observed that despite same RON, MON, and engine operating conditions, the TPRF-anisole blend exhibited markedly different knock-limited performance from the other three blends. This deviation from the octane index (OI) expectation was shown to be caused by differences in laminar flame speed. However, it was found that relatively large fuel-specific differences in LFS (>20%) would have to be present to cause any appreciable deviation from the OI framework. Otherwise, RON and MON would still be robust enough to predict a fuel’s knock-limited performance.

42 ENGINEERING↗
DOE OSTI2020

Numerical Investigation of a Central Fuel Property Hypothesis under Boosted Spark-ignition Conditions

In the present work, a central fuel property hypothesis (CFPH), which states that fuel properties are sufficient to provide an indication of a fuel's performance irrespective of its chemical composition, was numerically investigated In particular, the objective of the study was to determine whether Research Octane Number (RON) and Motor Octane Number (MON), as fuel properties, are sufficient to describe a fuel's knock-limited performance under boosted spark-ignition (SI) conditions within the framework of CFPH. To this end, four TPRF-bioblendstock surrogates having different compositions but matched RON (= 98) and MON (= 90), were first generated using a non-linear regression model based on artificial neural network (ANN). Three unconventional bioblendstocks were included in the analysis: Di-isobutylene (DIB), Isobutanol and Anisole. Skeletal reaction mechanisms were generated for the TPRF-DIB, TPRF-isobutanol and TPRF-anisole blends from a detailed kinetic mechanism. Thereafter, numerical simulations were performed for the fuel surrogates using the skeletal mechanisms and a virtual cooperative fuel research (CFR) engine model, under a representative boosted operating condition. In the computational fluid dynamics (CFD) model, the G-equation approach was employed to track the turbulent flame front and the well-stirred reactor model combined with multi-zone binning strategy was used to capture auto-ignition in the end-gas. In addition, laminar flame speed was tabulated for each blend as a function of pressure, temperature and equivalence ratio a priori, and the lookup tables were used to prescribe laminar flame speed as an input to the G-equation model. Parametric spark timing sweeps were performed for each fuel blend to determine the corresponding knock-limited spark advance (KLSA) and 50% burn point (CA50) at the respective KLSA timing. It was observed that despite same RON, MON and engine operating conditions, the TPRF-Anisole blend exhibited markedly different knock-limited performance from the other three blends. This deviation from the octane index (DI) expectation was shown to be caused by differences in laminar flame speed (LFS). However; it was found that relatively large fuel-specific differences in LFS (> 20%) would have to be present to cause any appreciable deviation from the 01 framework. Otherwise, RON and MON would still be robust enough to predict a fuel's knock-limited performance.

Pal, Pinaki↗
DOE OSTI2023

Software-Hardware Co-design of Heterogeneous SmartNIC System for Recommendation Models Inference and Training

Deep Learning Recommendation Models (DLRMs) are critical applications in various domains and have evolved as one of the single largest machine learning applications. Trillions of DLRM parameters exceed the on-chip memory capacity of GPUs. Large-scale multi-node systems are required for distributed DLRM inference and training, which suffer from the all-to-all communication bottleneck, mainly limiting the scalability of ever-growing DLRMs. In recent years, SmartNICs have evolved with coupled computation and communication capabilities providing opportunities for a powerful heterogeneous device in the system. However, there isn't such a distributed system that fully leverages the abundant smartNIC resources that resolve the scalability issue of DLRMs. In this work, we proposed a software-hardware co-design of a heterogeneous smartNIC system that resolves the communication bottleneck of distributed DLRMs, mitigates the memory bandwidth pressure, and improves computation efficiency. We provide a set of smartNIC designs of cache systems (including local cache and remote cache) and smartNIC computation kernels which reduce data movement, relieve memory lookup intensity, and improve the GPU's computation efficiency. In addition, we propose a graph algorithm that improves the data locality of queries within batches which optimizes the overall system performance with higher data reuse. Our evaluation shows that our system achieves 2.1x latency speedup for inference and 1.6x throughput speedup for training.

Guo, Anqi↗
DOE OSTI2021

Fast All-sky Radiation Model for Solar applications (FARMS) [SWR-16-18]

The Fast All-sky Radiation Model for Solar applications (FARMS) is used to compute cloudy irradiance. Radiative transfer (RT) models simulating broadband solar radiation have been widely used by atmospheric scientists to model solar resources for various energy applications such as operational forecasting. Due to the complexity of solving the RT equation, the computation under cloudy conditions can be extremely time consuming though many approximations (e.g. two-stream approach and delta-M truncation scheme) have been utilized. Thus, a more efficient RT model is crucial for model developers as a new option for approximating solar radiation at the land surface with minimal loss of accuracy. We have developed a fast all-sky radiation model for solar applications (FARMS) using the simplified clear-sky RT model, REST2, and simulated cloud transmittances and reflectances from the Rapid Radiation Transfer Model (RRTM) with a sixteen-stream Discrete Ordinates Radiative Transfer (DISORT). Simulated lookup tables (LUTs) of cloud transmittances and reflectances were created by varying cloud optical thicknesses, cloud particle sizes, and solar zenith angles. Equations with optimized parameters were fitted to the cloud transmittances and reflectances to develop the model. Using this model the all-sky solar irradiance at the land surface can be computed rapidly by combining REST2 with the cloud transmittances and reflectances. This new RT model is more than 1000 times faster than those currently utilized in solar resource assessment and forecasting since it does not explicitly solve the RT equation for each individual cloud condition. Our results indicate the accuracy of the fast radiative transfer model is comparable to or better than two-stream approximation in term of computing cloud transmittance and solar radiation.

Xie, Yu↗
DOE OSTI2021

KSpaceNavigator (KSN)

Intuitive GUI for manipulating microscope stages, allowing to align crystallographic data with stages, allowing to align crystallographic data with stage coordinates and microscope images. Simulates kinematic diffraction patterns and Kikuchi line patterns. Simulated patterns can be displayed as overlay to actually measured data, allowing manual fingerprinting and angular alignment. Crystallographic data is fed to the program in form of CIF (crystallographic information file) files, which are available from many databases and cover virtually all crystal structure ever reported in any journal. Actual goniometer scales can be linearized by lookup tables, program can be used with any microscope goniometer, double tilt and tilt-rotation type. Software requirements: Win32 platform (XP); Compiler/Version: Borland C++ Builder 5; Type of files: Executable modules; Hardware requirement: PC

Duden, Thomas↗
DOE OSTI2022

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗