Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computers”

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

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

Wind farm structural response and wake dynamics for an evolving stable boundary layer: computational and experimental comparisons

Abstract. The wind turbine design process requires performing thousands of simulations for a wide range of inflow and control conditions, which necessitates computationally efficient yet time-accurate models, especially when considering wind farm settings. To this end, FAST.Farm is a dynamic-wake-meandering-based mid-fidelity engineering tool developed by the National Renewable Energy Laboratory targeted at accurately and efficiently predicting wind turbine power production and structural loading in wind farm settings, including wake interactions between turbines. This work is an extension of a study that addressed constructing a diurnal cycle evolution based on experimental data (Quon, 2024). Here, this inflow is used to validate the turbine structural and wake-meandering response between experimental data, FAST.Farm simulation results, and high-fidelity large-eddy simulation results from the coupled Simulator fOr Wind Farm Applications (SOWFA)–OpenFAST tool. The validation occurs within the nocturnal stable boundary layer when corresponding meteorological and turbine data are available. To this end, we compared the load results from FAST.Farm and SOWFA–OpenFAST to multi-turbine measurements from a subset of a full-scale wind farm. Computational predictions of blade-root and tower-base bending loads are compared to 10 min statistics of strain gauge measurements during 3.5 h of the evolving stable boundary layer, generally with good agreement. This time period coincided with an active wake-steering campaign of an upstream turbine, resulting in time-varying yaw positions of all turbines. Wake meandering was also compared between the computational solutions, generally with excellent agreement. Simulations were based on a high-fidelity precursor constructed from inflow measurements and using state-of-the-art mesoscale-to-microscale coupling.

17 WIND ENERGY↗

Improving Computational Efficiency of Mechanical Finite Element Method Simulations for PV Modules: Preprint

In this work we have elucidated the trade off between structural mechanics FEM model accuracy and computation time by employing lower fidelity viscoelastic models. Results indicate that computation time can easily be cut in half while only expecting a potential maximum error of 10 % by considering lower fidelity models. A novel approach to produce the Prony Series fit for viscoelastic characterization has also been presented. Employing this approach, we were able to achieve a further 10 % reduction in computation time without further sacrificing simulation accuracy.

41 EE - Solar Energy Technologies Office (EE-4S)↗

A Study on Computational Cost Reduction of Simulations of Phase-Change Material (PCM) Embedded Heat Exchangers

Thermal storage can be implemented using Phase-Change Materials (PCM), which absorb significant latent heat with a relatively small temperature change. PCM phase-change processes are transient and are driven by thermal diffusion and natural convection – the latter, especially for melting process. Modeling and simulation of PCM heat exchangers (HX’s) is typically computationally intensive due to the relatively complex time-dependent physics. Most of the PCM modeling work in the literature uses high-order modeling tools such as Computational Fluid Dynamics (CFD) and Lattice-Boltzmann Method (LBM). For design purposes, the existing PCM modeling approaches are not practical, limiting researchers in their ability to investigate new ideas and different PCM’s with faster turnarounds. This paper presents a study investigating the reduction of computational cost of PCM embedded HX’s CFD models by evaluating the feasibility of spatial reduction without losing accuracy. The analysis consists of comparing full and partial domain under full melting conditions. The subject of this study is a single straight tube with circular transverse fins in the vertical orientation, using PCM’s with 35oC nominal melting temperature. Different tube and fin dimensions are investigated. Results indicate that the reduced domain reproduces - in half the run time - the same behavior as the full domain since the buoyancy effects are localized and patterned. The outputs from the partial domain simulation were used to build a non-general correlation for the PCM heat transfer characteristics and demonstrated how it can be implemented in a Finite Control Volume Reduced Order Model (ROM). The ROM can accurately reproduce the CFD simulations at 4 to 5 orders of magnitude faster.

25 ENERGY STORAGE↗

A Computationally Improved Heuristic Algorithm for Transmission Switching Using Line Flow Thresholds for Load Shed Reduction

We present a computationally improved heuristic algorithm for transmission switching (TS) to recover load shed. Research from the past showed that changing power system topology may control power flows and remove line congestion. Hence, TS may reduce the required load shed. One of the main challenges is to find a potential TS candidate in a suitable time. Here, we propose a novel heuristic method that is capable of finding the potential TS candidate faster than existing algorithms in literature. The proposed method is compatible with both the AC and DC optimal power flows (OPF). Three metrics are used to compare the proposed algorithm with the state-of-the-art from literature to show the speedup and accuracy achieved. The proposed method is implemented on the IEEE 30-bus system, PEGASE 89-bus system, IEEE 118-bus system, and Polish 2383- bus system. The results on the large-scale Polish 2383-bus system shows that the proposed algorithm is scalable to large real-world systems. Parallel computing is implemented to further improve the computational performance of the proposed algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Neuromorphic computing architecture with dynamically accessible contexts

Various technologies pertaining to allocating computing resources of a neuromorphic computing system are described herein. Subgraphs of a neural algorithm graph to be executed by the neuromorphic computing system are identified. The subgraphs are each executed by a group of neuron circuits serially. Output data generated by execution of the subgraphs are provided to the same or a second group of neuron circuits at a same time or with associated timing data indicative of a time at which the output data was generated. The same or second group of neuron circuits performs one or more processing operations based upon the output data.

Aimone, James Bradley↗

Towards a Robust Sampling Approach: A Computational Review and Design

As pointed out in several other works, the estimation of the reliability of the electrical grid can not be conducted without the estimation of the stochastic phenomena of electicity demand and electricity production by variable renewable sources. Therefore, sampling procedures have become integral in the design of engineering structures and analysis. Commonly referred to as Monte Carlo uncertainty analysis or integration, the general objective of these procedures is to establish specifics about the uncertainty of an output characteristic of such an engineering system, given uncertainty about its input characteristics. These sampling procedures are applied in a context in which establishing such specifics cannot be performed through other means. Variance-reduction techniques are designed to lessen the variability among estimators to estimate statistics of those output uncertainties. Importance-sampling techniques, on the other hand, are designed to reduce the number of samples needed to estimate a particular statistic—e.g., a tail probability. The combination of these approaches can reduce the computational burden considerably for a particular estimator and statistic. Importance sampling—geared and designed as it is toward improving a particular estimator—suffers, unfortunately, from the unintended consequence of reducing the performance of other estimators in terms of their variance. The objective of this paper is to offer an alternative sampling procedure where this variance does not grow unacceptably large for a suite of estimators. Moreover, it is anticipated that, with additional knowledge of how an engineering output characteristic responds to its input characteristics, tuning parameters of the input’s sampling procedure can be set to improve the output characteristic’s estimation. This work proves the effectiveness of the suggested alternative approach. Such positive outcome will lead to a decrease of the computational burden of performing stochastic optimization of integrated energy systems (e.g., components dispatch, and portfolio composition). In particular, capturing the contribution to the overall system cost of rare and unlikely events and patterns of the electricity demand and production will become less computationally expensive. This is due to the fact that the approach demonstrated here will allow the sampling of those rare occurrences more frequently without misrepresenting their probabilistic impacts.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The organic redox transistor for neuromorphic computing

Inspired by the in-memory computing architectures of biological systems, neuromorphic computing using crossbar arrays of artificial synapses based on non-volatile memory (NVM) devices with variable conductances has emerged as a new paradigm to enable massively parallel and ultra-low power computing hardware for data centric applications. Although inference has been demonstrated successfully using crossbars based on a variety of NMV technologies, efficient learning and scaling to large arrays (>10 6 elements) remains a challenge due to the synaptic elements' non-ideal electrical characteristics which degrades ANN accuracy. A further challenge is that in the conductive state memristors draw large currents >μA resulting in significant voltage drops in the interconnect wires and increased probability of failure in scaled arrays. We suggest the organic polymer redox transistor (RT) is an alternate approach that could solve many of these challenges, enabling both inference and parallel outer product updates, as recently demonstrated by Fuller et al. An RT consists of redox-active channel and gate electrodes in contact with a liquid or solid electrolyte. lon insertion through the electrolyte controls the channel electronic conductivity, while electron transfer through an external circuit maintains overall charge neutrality. Unlike a rechargeable battery, in the RT the voltage built-up across the electrolyte is kept to a minimum (typically <100 mV) by using the same material for the gate and channel. Elimination of the voltage offset simplifies integration of the RT into programmable arrays by enabling the use of various selectors. RTs based on inorganic and organic materials have been recently demonstrated with conductance tuning occurring at potentials of just a few mV and hundreds to thousands of linearly and symmetrically programmable conductance states, enabling near ideal accuracy in neural network simulations. Introduced in the 1980's, redox transistors with metallic gate electrodes and organic channel materials, also known as organic electrochemical transistors (OECTs), have been explored for a variety of applications such as chem- and bio-sensing, neural interfaces, and low cost printed circuits. A typical channel material for OECTs is the conducting polymer poly(3,4-ethylenedioxythiophene) doped with poly(styrene sulfonate) (PEDOT:PSS). PEDOT is a p-type semiconducting polymer with mobile positively charged polarons that hop chain-to-chain.

Talin, Albert Alec↗

Apparatus and method for providing workload distribution of threads among multiple compute units

In some examples, thermal aware optimization logic determines a characteristic (e.g., a workload or type) of a wavefront (e.g., multiple threads). For example, the characteristic indicates whether the wavefront is compute intensive, memory intensive, mixed, and/or another type of wavefront. The thermal aware optimization logic determines temperature information for one or more compute units (CUs) in one or more processing cores. The temperature information includes predictive thermal information indicating expected temperatures corresponding to the one or more CUs and historical thermal information indicating current or past thermal temperatures of at least a portion of a graphics processing unit (GPU). The logic selects the one or more compute units to process the plurality of threads based on the determined characteristic and the temperature information. The logic provides instructions to the selected subset of the plurality of CUs to execute the wavefront.

Rao, Karthik↗

Snowmass Computational Frontier: Topical Group Report on Experimental Algorithm Parallelization

The substantial increase in data volume and complexity expected from future experiments will require significant investment to prepare experimental algorithms. These algorithms include physics object reconstruction, calibrations, and processing of observational data. In addition, the changing computing architecture landscape, which will be primarily composed of heterogeneous resources, will continue to pose major challenges with regard to algorithmic migration. Portable tools need to be developed that can be shared among the frontiers (e.g., for code execution on different platforms) and opportunities, such as forums or cross-experimental working groups, need to be provided where experiences and lessons learned can be shared between experiments and frontiers. At the same time, individual experiments also need to invest considerable resources to develop algorithms unique to their needs (e.g., for facilities dedicated to the experiment), and ensure that their specific algorithms will be able to efficiently exploit external heterogeneous computing facilities. Common software tools represent a cost-effective solution, providing ready-to-use software solutions as well as a platform for R&D work. These are particularly important for small experiments which typically do not have dedicated resources needed to face the challenges imposed by the evolving computing technologies. Workforce development is a key concern across frontiers and experiments, and additional support is needed to provide career opportunities for researchers working in the field of experimental algorithm development. Finally, cross-discipline collaborations going beyond high-energy physics are a key ingredient to address the challenges ahead and more support for such collaborations needs to be created. This report targets future experiments, observations and experimental algorithm development for the next 10-15 years.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Oscillator for adiabatic computational circuitry

An adiabatic resonator, an adiabatic oscillator, and an adiabatic oscillator system are disclosed. An adiabatic system is one that ideally transfers no heat outside of the system, thereby reducing the required operating power. The adiabatic resonator, which includes a plurality of tank circuits, acts as an energy reservoir, the missing aspect of previously attempted adiabatic computational systems. By using the adiabatic resonator as a feedback element with an amplifier, an adiabatic oscillator is formed. An adiabatic oscillator system is formed with a primary adiabatic oscillator feeding a plurality of secondary adiabatic oscillators. In this manner, the adiabatic oscillator system may be used to generate the multiple clock signals required of adiabatic computational logic elements, such as Split-level Charge Recovery Logic and 2-Level Adiabatic Logic. The adiabatic oscillator system stores enough energy to drive many individual adiabatic computational logic elements, permitting implementation of complex logic circuits.

Brocato, Robert W.↗

Apparatus and method for providing workload distribution of threads among multiple compute units

In some examples, thermal aware optimization logic determines a characteristic (e.g., a workload or type) of a wavefront (e.g., multiple threads). For example, the characteristic indicates whether the wavefront is compute intensive, memory intensive, mixed, and/or another type of wavefront. The thermal aware optimization logic determines temperature information for one or more compute units (CUs) in one or more processing cores. The temperature information includes predictive thermal information indicating expected temperatures corresponding to the one or more CUs and historical thermal information indicating current or past thermal temperatures of at least a portion of a graphics processing unit (GPU). The logic selects the one or more compute units to process the plurality of threads based on the determined characteristic and the temperature information. The logic provides instructions to the selected subset of the plurality of CUs to execute the wavefront.

Rao, Karthik↗

Devices and methods for increasing the speed or power efficiency of a computer when performing machine learning using spiking neural networks

A method for increasing a speed and efficiency of a computer when performing machine learning using spiking neural networks. The method includes computer-implemented operations; that is, operations that are solely executed on a computer. The method includes receiving, in a spiking neural network, a plurality of input values upon which a machine learning algorithm is based. The method also includes correlating, for each input value, a corresponding response speed of a corresponding neuron to a corresponding equivalence relationship between the input value to a corresponding latency of the corresponding neuron. Neurons that trigger faster than other neurons represent close relationships between input values and neuron latencies. Latencies of the neurons represent data points used in performing the machine learning. A plurality of equivalence relationships are formed as a result of correlating. The method includes performing the machine learning using the plurality of equivalence relationships.

Vineyard, Craig Michael↗

Computationally Aided Design of a Small-Scale Waste-Glass Melter - 20452

To provide mission support to the WTP for the vitrification of legacy nuclear tank waste at the Hanford site, a reduced-scale vitrification pilot system is being designed to process simulated and actual radioactive tank wastes. The waste stored in underground tanks will be separated into HLW and LAW fractions, where the majority is LAW by mass (approximately 90%) and HLW by activity (greater than 95%). The first tank waste to be processed at the WTP will be LAW. Because Hanford tank waste and the resultant melter feed compositions are known to vary widely, pilot-scale operations are essential to identify potential problems, provide needed data, confirm assumptions, and determine impacts to full-scale melters and off-gas systems from these different feeds. In addition, the reduced-scale melter system must be capable of quickly providing results to operations without the typically high cost of full-scale radioactive operations and to provide an engineering platform in close proximity to local operations staff. The objectives of this computational modeling effort are to produce process conditions like those encountered in the WTP LAW melters and to minimize the volume of radioactive waste necessary for the evaluations. To this end, melter design features are being explored to increase production without significantly increasing surface area or melter-glass volumes or compromising data quality. In support of these objectives, a set of computational fluid dynamic models was developed to provide insight into the flow patterns within these small melters and evaluate design features to increase production without significantly increasing glass inventory. Computed velocities were evaluated at the interface between the cold cap and the molten-glass pool and within the bulk-glass pool. Since melt rate correlates with the velocity underneath the cold cap, this information can be used to select design features that produce the highest gains. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Data-Driven Computation of Probabilistic Marching Cubes for Efficient Visualization of Level-Set Uncertainty

Uncertainty visualization is an important emerging research area. Being able to visualize data uncertainty can help scientists improve trust in analysis and decision-making. However, visualizing uncertainty can add computational overhead, which can hinder the efficiency of analysis. In this paper, we propose novel data-driven techniques to reduce the computational requirements of the probabilistic marching cubes (PMC) algorithm. PMC is an uncertainty visualization technique that studies how uncertainty in data affects level-set positions. However, the algorithm relies on expensive Monte Carlo (MC) sampling for the multivariate Gaussian uncertainty model because no closed-form solution exists for the integration of multivariate Gaussian. In this work, we propose the eigenvalue decomposition and adaptive probability model techniques that reduce the amount of MC sampling in the original PMC algorithm and hence speed up the computations. Our proposed methods produce results that show negligible differences compared with the original PMC algorithm demonstrated through metrics, including root mean squared error, maximum error, and difference images. We demonstrate the performance and accuracy evaluations of our data-driven methods through experiments on synthetic and real datasets.

Athawale, Tushar↗

Computational Approaches for Clean Energy Materials

Currently, 80% of the global final energy consumption occurs in form of fuels and only 20% as electricity. On the other hand, renewable energy additions come almost exclusively in the form of electricity (dominantly photovoltaics and wind). Thus, a successful energy transition will require enormous growth in renewables, sufficient to convert excess electricity into fuels, as well as the development of non-electricity based solar fuel technologies. As much as photovoltaic capacities have grown over the past 20 years, it is far from clear that current technologies and materials are up to the task to grow from here by yet another factor 100 until 2050. Therefore, sustained research efforts on emerging inorganic semiconductors for solar electricity and fuels are essential for facing the double challenge of climate change and energy security. Computational materials science can make important contributions, guiding and supporting research activities through both materials search and discovery and through detailed studies that help to develop a mechanistic understanding of materials performance and bottlenecks. This presentation will highlight three recent computational projects with relevance for photovoltaics and solar fuels (1) Defect graph neural networks (dGNN) for materials discovery in solar thermochemical hydrogen (STCH) [1]. The dGNN approach facilitates broad and fast materials screening for defect properties. (2) Modeling highly off-stoichiometric systems by evaluating the free energy of defect interaction [2]. This approach allows quantitative prediction of H2 production in complex STCH oxides. (3) First-principles atomic structure prediction for interfaces [3]. This work showed how an atomically thin CdCl2 interlayer phase enables in principle ideal electron transport across the incommensurate SnO2/CdTe interface. [1] M.D. Witman, A. Goyal, T. Ogitsu, A.H. McDaniel, S. Lany, Nat. Comput. Sci. (2023). https://doi.org/10.1038/s43588-023-00495-2. [2] A. Goyal, M.D. Sanders, R.P. O'Hayre, S. Lany, PRX Energy 3, 013008 (2024). https://doi.org/10.1103/PRXEnergy.3.013008. [3] A. Sharan, M. Nardone, D. Krasikov, N. Singh, S. Lany, Appl. Phys. Rev. 9, 041411 (2022). https://doi.org/10.1063/5.0104008.

density functional theory↗

Scientific computing

Our research generates a vast amount of data that scientists must gather, store, analyze and interpret. These activities require expertise and the right tools. Fermilab is home to one of the largest tape robotic systems available today, providing more than 800 petabytes of storage capability. The lab is growing the tape facilities to meet expected demands of over 1,000 petabytes of additional data per year by the end of the decade. Fermilab also has the technology and computing power to efficiently pr ocess these data to facilitate scientific discoveries. Our computation al experts work closely with experimenters and the scientific commu - nity at large to provide and facilitate the use of the cutting-edge computing tools necessary for these discoveries.

Fermilab, Fermilab↗

Large language model evaluation for high–performance computing software development

We apply AI-assisted large language model (LLM) capabilities of GPT-3 targeting high-performance computing (HPC) kernels for (i) code generation, and (ii) auto-parallelization of serial code in C ++, Fortran, Python and Julia. Our scope includes the following fundamental numerical kernels: AXPY, GEMV, GEMM, SpMV, Jacobi Stencil, and CG, and language/programming models: (1) C++ (e.g., OpenMP [including offload], OpenACC, Kokkos, SyCL, CUDA, and HIP), (2) Fortran (e.g., OpenMP [including offload] and OpenACC), (3) Python (e.g., numpy, Numba, cuPy, and pyCUDA), and (4) Julia (e.g., Threads, CUDA.jl, AMDGPU.jl, and KernelAbstractions.jl). Kernel implementations are generated using GitHub Copilot capabilities powered by the GPT-based OpenAI Codex available in Visual Studio Code given simple + + prompt variants. To quantify and compare the generated results, we propose a proficiency metric around the initial 10 suggestions given for each prompt. For auto-parallelization, we use ChatGPT interactively giving simple prompts as in a dialogue with another human including simple “prompt engineering” follow ups. Results suggest that correct outputs for C++ correlate with the adoption and maturity of programming models. For example, OpenMP and CUDA score really high, whereas HIP is still lacking. We found that prompts from either a targeted language such as Fortran or the more general-purpose Python can benefit from adding language keywords, while Julia prompts perform acceptably well for its Threads and CUDA.jl programming models. Finally, we expect to provide an initial quantifiable point of reference for code generation in each programming model using a state-of-the-art LLM. Overall, understanding the convergence of LLMs, AI, and HPC is crucial due to its rapidly evolving nature and how it is redefining human-computer interactions.

97 MATHEMATICS AND COMPUTING↗