SEARCH · Engineering Papers

Results for “IMPLEMENTATION”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,477 records · Page 82

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Development and Validation of Passive Yaw in the Open-Source WEC-Sim Code

A passive yaw implementation is developed, validated, and explored for the WEC-Sim, an open-source wave energy converter modeling tool that works within MATLAB/Simulink. The Reference Model 5 (RM5) is selected for this investigation, and a WEC-Sim model of the device is modified to allow yaw motion. A boundary element method (BEM) code was used to calculate the excitation force coefficients for a range of wave headings. An algorithm was implemented in WEC-Sim to determine the equivalent wave heading from a body’s instantaneous yaw angle and interpolate the appropriate excitation coefficients to ensure the correct time-domain excitation force. This approach is able to determine excitation force for a body undergoing large yaw displacement. For the mathematically simple case of regular wave excitation, the dynamic equation was integrated numerically and found to closely approximate the results from this implementation in WEC-Sim. A case study is presented for the same device in irregular waves. In this case, computation time is increased by 32x when this interpolation is performed at every time step. To reduce this expense, a threshold yaw displacement can be set to reduce the number of interpolations performed. A threshold of 0.01° was found to increase computation time by only 22x without significantly affecting time domain results. Similar amplitude spectra for yaw force and displacements are observed for all threshold values less than 1°, for which computation time is only increased by 2.2x.

50 EE - Wind and Water Power Program - Water (EE-4↗

DOE OSTI2024

UNDERSTANDING THE SEMI-PROBABILISTIC APPROACHES IN STRUCTURAL RELIABILITY USED TO SET DESIGN RELIABILITY TARGETS FOR GRAPHITE COMPONENTS USING ASME BPVC METHODS

Graphite is a quasi-brittle material, resulting in random variability in tensile strength distributions. To account for the random variability in strength, HHA-3000 of the ASME BPVC provides two semi-probabilistic methods for qualifying nuclear graphite components in the design stage, the simplified and full assessments. The full and simplified assessments apply statistical methods to engineering-based design problems. This is often referred to as reliability-based design. Reliability-based design (RBD) is a method to develop reliable designs by accounting for uncertainties and result in small chances of failure when also considering safety factors. RBDs provide reliability targets using semi-probabilistic approaches. RBD is implemented in ASME BPVC HHA-3000 for nuclear graphite components, but is not specific to that application. There has been much confusion around the methods implemented in ASME BPVC HHA-3000 for qualifying nuclear graphite components. To address the confusion, this paper takes a hierarchical approach. First, the general RBD framework is presented. Then, the semi-probabilistic methods and the underlying assumptions implemented in the assessments are presented. The semi-probabilistic methods are separated from the engineering modifications that have been made to the assessments. After building the framework and underlying assumptions, the specific methods in the full and simplified assessments are explained in three steps: inputs, methods, outputs. The methods are applied to an H-451 reflector block. Tensile strength properties for other graphite grades are provided.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2023

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

DOE OSTI2026

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

DOE OSTI2020

SMART U(1)$$_X$$: standard model with axion, right handed neutrinos, two Higgs doublets and U(1)$$_X$$ gauge symmetry

Abstract To address five fundamental shortcomings of the Standard Model (SM) of particle physics and cosmology, we propose a phenomenologically viable framework based on a $$U(1)_X \times U(1)_{PQ}$$ U ( 1 ) X × U ( 1 ) PQ extension of the SM, that we call “SMART U(1) $$_X$$ X ”. The $$U(1)_X$$ U ( 1 ) X gauge symmetry is a well-known generalization of the $$U(1)_{B-L}$$ U ( 1 ) B - L symmetry and $$U(1)_{PQ}$$ U ( 1 ) PQ is the global Peccei–Quinn (PQ) symmetry. Three right handed neutrinos are added to cancel $$U(1)_X$$ U ( 1 ) X related anomalies, and they play a crucial role in understanding the observed neutrino oscillations and explaining the observed baryon asymmetry in the universe via leptogenesis. Implementation of PQ symmetry helps resolve the strong CP problem and also provides axion as a compelling dark matter (DM) candidate. The $$U(1)_X$$ U ( 1 ) X gauge symmetry enables us to implement the inflection-point inflation scenario with $$H_{inf} \lesssim 2 \times 10^{7}$$ H inf ≲ 2 × 10 7 GeV, where $$H_{inf}$$ H inf is the value of Hubble parameter during inflation. This is crucial to overcome a potential axion domain wall problem as well as the axion isocurvature problem. The SMART U(1) $$_X$$ X framework can be successfully implemented in the presence of SU (5) grand unification, as we briefly show.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Neutrino tomography of the Earth with ORCA detector

Abstract Using PREM as a reference model for the Earth density distribution we investigate the sensitivity of ORCA detector to deviations of the Earth (i) outer core (OC) density, (ii) inner core (IC) density, (iii) total core density, and (iv) mantle density, from their respective PREM densities. The analysis is performed by studying the effects of the Earth matter on the oscillations of atmospheric $$\nu _{\mu }$$ ν μ , $$\nu _e$$ ν e , $${\bar{\nu }}_\mu $$ ν ¯ μ and $${\bar{\nu }}_e$$ ν ¯ e . We present results which illustrate the dependence of the ORCA sensitivity to the OC, IC, core and mantle densities on the type of systematic uncertainties used in the analysis, on the value of the atmospheric neutrino mixing angle $$\theta _{23}$$ θ 23 , on whether the Earth mass constraint is implemented or not, and on the way it is implemented, and on the type – with normal ordering (NO) or inverted ordering (IO) – of the light neutrino mass spectrum. We show, in particular, that in the “most favorable” NO case of implemented Earth mass constraint, “minimal” systematic errors and $$\sin ^2\theta _{23}=0.58$$ sin 2 θ 23 = 0.58 , ORCA can determine, e.g., the OC (mantle) density at $$3\sigma $$ 3 σ C.L. after 10 years of operation with an uncertainty of (− 18%)/+ 15% (of (− 6%)/+ 8%). In the “most disfavorable” NO case of “conservative” systematic errors and $$\sin ^2\theta _{23}=0.42$$ sin 2 θ 23 = 0.42 , the uncertainty on OC (mantle) density reads (− 43%)/+ 39% ((− 17%/+ 20%), while for for $$\sin ^2\theta _{23} = 0.50$$ sin 2 θ 23 = 0.50 and 0.58 it is noticeably smaller: (− 37)%/+ 30% and (− 30%)/+ 24% ((− 13%)/+ 16% and (− 11%/+ 14%)). We find also that the sensitivity of ORCA to the OC, core and mantle densities is significantly worse for IO neutrino mass spectrum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

Future Circular Collider Feasibility Study Report

Volume 3 of the FCC Feasibility Report presents studies related to civil engineering, the development of a project implementation scenario, and environmental and sustainability aspects. The report details the iterative improvements made to the civil engineering concepts since 2018, taking into account subsurface conditions, accelerator and experiment requirements, and territorial considerations. It outlines a technically feasible and economically viable civil engineering configuration that serves as the baseline for detailed subsurface investigations, construction design, cost estimation, and project implementation planning. Additionally, the report highlights ongoing subsurface investigations in key areas to support the development of an improved 3D subsurface model of the region. The report describes the development of the project scenario based on the ‘avoid-reduce-compensate’ iterative optimisation approach. The reference scenario balances optimal physics performance with territorial compatibility, implementation risks, and costs. Environmental field investigations covering almost 600 hectares of terrain—including numerous urban, economic, social, and technical aspects—confirmed the project’s technical feasibility and contributed to the preparation of essential input documents for the formal project authorisation phase. The summary also highlights the initiation of public dialogue as part of the authorisation process. The results of a comprehensive socio-economic impact assessment, which included significant environmental effects, are presented. Even under the most conservative and stringent conditions, a positive benefit-cost ratio for the FCC-ee is obtained. Finally, the report provides a summary of the studies conducted to document the current state of the environment.

Benedikt, M. [European Organization for Nuclear Re↗

DOE OSTI2023

GPU acceleration of Swendsen–Wang dynamics

When simulating a lattice system near its critical temperature, local algorithms for modeling the system’s evolution can introduce very large autocorrelation times into sampled data. Here, this critical slowing down places restrictions on the analysis that can be completed in a timely manner of the behavior of systems around the critical point. Because it is often desirable to study such systems around this point, a new algorithm must be introduced. Therefore, we turn to cluster algorithms, such as the Swendsen–Wang algorithm and the Wolff clustering algorithm. They incorporate global updates which generate new lattice configurations with little correlation to previous states, even near the critical point. We look to accelerate the rate at which these algorithm are capable of running by implementing and benchmarking a parallel implementation of each algorithm designed to run on GPUs under NVIDIA’s CUDA framework. A 17 and 90 fold increase in the computational rate was, respectively, experienced when measured against the equivalent algorithm implemented in serial code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2021

How Much Could Article 6 Enhance Nationally Determined Contribution Ambition Toward Paris Agreement Goals Through Economic Efficiency?

The Paris Agreement of 2015 uses Nationally Determined Contributions (NDCs) to achieve its goal to limit climate change to well below 2°C. Article 6 allows countries to cooperatively implement NDCs provided they do not double-count mitigation. We estimate that economic efficiency gains from cooperative implementation of existing NDC goals using Article 6 could reduce the cost of achieving NDC goals in 2030 to all parties by ~$\$300$ × 10 9 , which if reinvested in additional emissions mitigation could add 9 billion tons CO 2 /year mitigation, beyond the 8 billion tons CO 2 /year currently pledged in 2030. We estimate that more than half of the 2030 gains could come from nature-based measures, but long-term potential for nature-based measures is more limited. How much or even if this economic potential can be realized is uncertain and will depend on both the rules and their implementation.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2020

Mortar: An Open Testbed for Portable Building Analytics

Access to large amounts of real-world data has long been a barrier to the development and evaluation of analytics applications for the built environment. Open datasets exist, but they are limited in their span (how much data is available) and context (what kind of data is available and how it is described). Evaluation of such analytics is also limited by how the analytics themselves are implemented, often using hard-coded names of building components, points and locations, or unique input data formats. To advance the methodology for how such analytics are implemented and evaluated, we present Mortar: an open testbed for portable building analytics, currently spanning 90 buildings and containing over 9.1 billion data points. All buildings in the testbed are described using Brick, a recently developed metadata schema, providing rich functional descriptions of building assets and subsystems. We also propose a simple architecture for writing portable analytics applications that are robust to the diversity of buildings and can configure themselves based on context. We demonstrate the utility of Mortar by implementing 11 applications from the literature.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

Strong and Efficient Consistency with Consistency-aware Durability

We introduce consistency-aware durability or C ad , a new approach to durability in distributed storage that enables strong consistency while delivering high performance. We demonstrate the efficacy of this approach by designing cross-client monotonic reads , a novel and strong consistency property that provides monotonic reads across failures and sessions in leader-based systems; such a property can be particularly beneficial in geo-distributed and edge-computing scenarios. We build O rca , a modified version of ZooKeeper that implements C ad and cross-client monotonic reads. We experimentally show that O rca provides strong consistency while closely matching the performance of weakly consistent ZooKeeper. Compared to strongly consistent ZooKeeper, O rca provides significantly higher throughput (1.8--3.3×) and notably reduces latency, sometimes by an order of magnitude in geo-distributed settings. We also implement C ad in Redis and show that the performance benefits are similar to that of C ad ’s implementation in ZooKeeper.

Computer Science↗

DOE OSTI2021

cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPUSystems Using Trie Based Data Structure

Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism offered by the GPU hardware is well suited for solving the subgraph isomorphism. However, current GPU implementations are far from the achievable performance. Moreover, the enormous memory requirement of current approaches limits the problem size that can be handled. This work analyzes the fundamental challenges associated with processing the subgraph isomorphism on GPUs and develops an efficient GPU hardware-aware implementation. We also develop a new GPU-friendly trie-based data structure to drastically reduce the intermediate storage space requirement. Hence, our approach runs larger benchmarks than the competitors. We also develop the first distributed sub-graph isomorphism algorithm for GPUs. Our experimental evaluation section demonstrates the efficacy of our approach by comparing the execution time and number of cases that we can handle against the state-of-the-art GPU implementations.

Xiang, Lizhi↗

DOE OSTI2021

Libpanda: A High Performance Library for Vehicle Data Collection

Cyber-Physical Systems (CPS) generally involve time-critical components due to physical dynamics, therefore necessitating high-performance subsystems. This is also true in data collection scenarios to infer physical phenomena. This paper covers Libpanda as an example of a component that has been designed to address performance issues in CPS implementations. Libpanda is a C++ library that interfaces software with a Comma.ai Panda device. Pandas are used for installation in modern vehicles to read the vehicle CAN bus, providing rich sensor data and limited vehicle control through message injection. The motivation to design lib-panda stems from the lack of performance in Python-based code that runs on inexpensive hardware like a Raspberry Pi. In such situations, Python code would result in utilizing 92% CPU while also dropping around 40% of the CAN packet due to bottlenecks. Without using different tools, inconsistent data collection means a loss of time-based vehicle state interpretation. Libpanda addresses these issues through implementation in a different language and implementation of different design paradigms involving asynchronous calls and multithreading. The Panda also features a GPS module that allows multiple instances to synchronize clocks for large-scale data collection scenarios. Libpanda has been designed with time-synchronization in mind to aid in the measurement of inter-vehicle dynamics. The performance improvements of libpanda have resulted in it becoming an important component in automotive dynamics research that requires a higher technical performance in large-scale experiments.

Bunting, Matthew↗

DOE OSTI2023

Accelerating Random Forest Classification on GPU and FPGA

Random Forests (RFs) are a commonly used machine learning method for classification and regression tasks spanning a variety of application domains, including bioinformatics, business analytics, and software optimization. While prior work has focused primarily on improving performance of the training of RFs, many applications, such as malware identification, cancer prediction, and banking fraud detection, require fast RF classification. In this work, we accelerate RF classification on GPU and FPGA. In order to provide efficient support for large datasets, we propose a hierarchical memory layout suitable to the GPU/FPGA memory hierarchy. We design three RF classification code variants based on that layout, and we investigate GPU- and FPGA-specific considerations for these kernels. Our experimental evaluation, performed on an Nvidia Xp GPU and on a Xilinx Alveo U250 FPGA accelerator card using publicly available datasets on the scale of millions of samples and tens of features, covers various aspects. First, we evaluate the performance benefits of our hierarchical data structure over the standard compressed sparse row (CSR) format. Second, we compare our GPU implementation with cuML, a machine learning library targeting Nvidia GPUs. Third, we explore the performance/accuracy tradeoff resulting from the use of different tree depths in the RF. Finally, we perform a comparative performance analysis of our GPU and FPGA implementations. Our evaluation shows that for high accuracy targets, our GPU implementation yields 5-9x speedup over CSR, and up to a 2x speedup over cuML.

FPGA, Xilinx FPGA, GPU, Random Forest classificati↗

DOE OSTI2022

Automatic Differentiation of C++ Codes on Emerging Manycore Architectures with Sacado

Automatic differentiation (AD) is a well-known technique for evaluating analytic derivatives of calculations implemented on a computer, with numerous software tools available for incorporating AD technology into complex applications. However, a growing challenge for AD is the efficient differentiation of parallel computations implemented on emerging manycore computing architectures such as multicore CPUs, GPUs, and accelerators as these devices become more pervasive. In this work, we explore forward mode, operator overloading-based differentiation of C++ codes on these architectures using the widely available Sacado AD software package. In particular, we leverage Kokkos, a C++ tool providing APIs for implementing parallel computations that is portable to a wide variety of emerging architectures. Here we describe the challenges that arise when differentiating code for these architectures using Kokkos, and two approaches for overcoming them that ensure optimal memory access patterns as well as expose additional dimensions of fine-grained parallelism in the derivative calculation. We describe the results of several computational experiments that demonstrate the performance of the approach on a few contemporary CPU and GPU architectures. We then conclude with applications of these techniques to the simulation of discretized systems of partial differential equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

PERKS: a Locality-Optimized Execution Model for Iterative Memory-bound GPU Applications

Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop on the host side that invokes the GPU kernel as much as time/algorithm steps there are. The termination of each kernel implicitly acts the barrier required after advancing the solution every time step. We propose an execution model for running memory-bound iterative GPU kernels: PERsistent KernelS (PERKS). In this model, the time loop is moved inside persistent kernel, and device-wide barriers are used for synchronization. We then reduce the traffic to device memory by caching subset of the output in each time step in the unused registers and shared memory. PERKS can be generalized to any iterative solver: they largely independent of the solver's implementation. We explain the design principle of PERKS and demonstrate effectiveness of PERKS for a wide range of iterative 2D/3D stencil benchmarks (geomean speedup of 2.12x for 2D stencils and 1.24x for 3D stencils over state-of-art libraries), and a Krylov subspace conjugate gradient solver (geomean speedup of 4.86x in smaller SpMV datasets from SuiteSparse and 1.43x in larger SpMV datasets over a state-of-art library). All PERKS-based implementations available at: https://github.com/neozhang307/PERKS.

Zhang, Lingqi↗

DOE OSTI2023

Online Heatmap Generation with Both High and Low Weights

Heatmap is a common geovisualization method that interpolates and visualizes a set of point observations on a map surface. Most of online web mapping libraries implement a one-pass heatmap algorithm using HTML5 canvas or WebGL for efficient heatmap generation. However, such implementation applies additive operations that accumulate the rendering of point weights on the map surface grid, making it inappropriate for visualizations that require the highlighting of both low and high weights. We introduce \textit{hilomap}, an online heatmap algorithm that highlights surface areas where points with both low and high trends are located. An HTML5 Canvas-based reference implementation on OpenLayers is presented and evaluated.

Liu, Yan↗