Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Heterogeneous computing”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Modelling Sonic Boom Propagation through Planetary Boundary Layer Turbulence near the Lateral Extent of the Carpet

Nonlinear acoustic propagation of sonic booms in the atmospheric boundary layer is considered in the context of a one-way solution to a third order wave equation. A split-step approach is utilized to compute different physical effects efficiently. Unlike previous approaches, the diffraction effects are computed exactly in the forward direction with no restriction on the angle of propagation. This results in more accurate modelling of sonic boom near the carpet edge. Heterogenous flow effects are incorporated with a wide-angle parabolic approximation. Nonlinear propagation is computed with a Burgers-Hayes method. Turbulence in the medium is constructed by the method of random Fourier modes. The turbulence spectra are constructed using an altitude dependent 3-dimensional von Karman spectrum. The turbulence field is considered frozen, as the eddy turnover time in the atmospheric boundary layer is generally much larger than the propagation time of the acoustic wave. Comparisons with benchmark predictions from the PCBoom software are conducted. The benchmark cases provide insight into the accuracy of the current prediction code for non-turbulent atmospheres. Future work is discussed regarding the prediction of shaped booms, boundary conditions, and predictions near the lateral extent of the boom carpet where previous approaches fail to capture the diffraction effects.

sonic boom↗
DOE OSTI2019

Grafting metal complexes onto amorphous supports: from elementary steps to catalyst site populations via kernel regression

Ab initio computational studies have made tremendous progress in describing the behavior of molecular (homogeneous) catalysts and crystalline versions of heterogeneous catalysts, but not for amorphous heterogeneous catalysts. Even widely used industrial amorphous catalysts like atomically dispersed Cr on silica remain poorly understood and largely intractable to computational investigation. The central problems are that (i) the amorphous support presents an unknown quenched disordered structure, (ii) metal atoms attach to various surface grafting sites with different rates, and (iii) the resulting grafted sites have different activation and catalytic reaction kinetics. This study combines kernel regression and importance sampling techniques to efficiently model grafting of metal ions onto a non-uniform ensemble of support environments. Our analysis uses a simple model of the quenched disordered support environment, grafting chemistry, and catalytic activity of the resulting grafted sites.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

SU-C-201-04: Quantification of Perfusion Heterogeneity Based On Texture Analysis for Fully Automatic Detection of Ischemic Deficits From Myocardial Perfusion Imaging

Purpose: Texture-based quantification of image heterogeneity has been a popular topic for imaging studies in recent years. As previous studies mainly focus on oncological applications, we report our recent efforts of applying such techniques on cardiac perfusion imaging. A fully automated procedure has been developed to perform texture analysis for measuring the image heterogeneity. Clinical data were used to evaluate the preliminary performance of such methods. Methods: Myocardial perfusion images of Thallium-201 scans were collected from 293 patients with suspected coronary artery disease. Each subject underwent a Tl-201 scan and a percutaneous coronary intervention (PCI) within three months. The PCI Result was used as the gold standard of coronary ischemia of more than 70% stenosis. Each Tl-201 scan was spatially normalized to an image template for fully automatic segmentation of the LV. The segmented voxel intensities were then carried into the texture analysis with our open-source software Chang Gung Image Texture Analysis toolbox (CGITA). To evaluate the clinical performance of the image heterogeneity for detecting the coronary stenosis, receiver operating characteristic (ROC) analysis was used to compute the overall accuracy, sensitivity and specificity as well as the area under curve (AUC). Those indices were compared to those obtained from the commercially available semi-automatic software QPS. Results: With the fully automatic procedure to quantify heterogeneity from Tl-201 scans, we were able to achieve a good discrimination with good accuracy (74%), sensitivity (73%), specificity (77%) and AUC of 0.82. Such performance is similar to those obtained from the semi-automatic QPS software that gives a sensitivity of 71% and specificity of 77%. Conclusion: Based on fully automatic procedures of data processing, our preliminary data indicate that the image heterogeneity of myocardial perfusion imaging can provide useful information for automatic determination of the myocardial ischemia.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2019

Inner Approximation of Minkowski Sums: A Union-Based Approach and Applications to Aggregated Energy Resources: Preprint

This paper develops and compares algorithms to compute the inner approximation of Minkowski sum of convex polytopes. We consider flexibility from distributed re- sources, such as solar photovoltaic (PV) inverters, demand side resources, etc. A polytopic representation of a single inverter's feasible operating region is proposed first. The aggregate flexibility can be computed using the Minkowski sum. Homothet and Zonotope-based approaches have been explored in literature. We show that as heterogeneity increases, such approaches lead to conservative estimates. Hence, we show how to exploit union-based Minkowski sum computation through successive homothetic decomposition of polytopes. While the union-based approach can lead to dimensionality issues, we show how to limit the complexity by predefining a candidate set. Efficiency, accuracy and trade-offs have been analyzed. Numerical examples have been presented to illustrate the effectiveness of the proposed algorithm.

14 SOLAR ENERGY↗
DOE OSTI2015

An Analysis Platform for Multiscale Hydrogeologic Modeling with Emphasis on Hybrid Multiscale Methods

One of the most significant challenges facing hydrogeologic modelers is the disparity between those spatial and temporal scales at which fundamental flow, transport and reaction processes can best be understood and quantified (e.g., microscopic to pore scales, seconds to days) and those at which practical model predictions are needed (e.g., plume to aquifer scales, years to centuries). While the multiscale nature of hydrogeologic problems is widely recognized, technological limitations in computational and characterization restrict most practical modeling efforts to fairly coarse representations of heterogeneous properties and processes. For some modern problems, the necessary level of simplification is such that model parameters may lose physical meaning and model predictive ability is questionable for any conditions other than those to which the model was calibrated. Recently, there has been broad interest across a wide range of scientific and engineering disciplines in simulation approaches that more rigorously account for the multiscale nature of systems of interest. In this paper, we review a number of such approaches and propose a classification scheme for defining different types of multiscale simulation methods and those classes of problems to which they are most applicable. Our classification scheme is presented in terms of a flow chart (Multiscale Analysis Platform or MAP), and defines several different motifs of multiscale simulation. Within each motif, the member methods are reviewed and example applications are discussed. We focus attention on hybrid multiscale methods, in which two or more models with different physics described at fundamentally different scales are directly coupled within a single simulation. Very recently these methods have begun to be applied to groundwater flow and transport simulations, and we discuss these applications in the context of our classification scheme. As computational and characterization capabilities continue to improve, we envision that hybrid multiscale modeling will become more common and may become a viable alternative to conventional single-scale models in the near future.

Environmental Molecular Sciences Laboratory↗
DOE OSTI2016

A computationally efficient parallel Levenberg-Marquardt algorithm for highly parameterized inverse model analyses

Inverse modeling seeks model parameters given a set of observations. However, for practical problems because the number of measurements is often large and the model parameters are also numerous, conventional methods for inverse modeling can be computationally expensive. We have developed a new, computationally-efficient parallel Levenberg-Marquardt method for solving inverse modeling problems with a highly parameterized model space. Levenberg-Marquardt methods require the solution of a linear system of equations which can be prohibitively expensive to compute for moderate to large-scale problems. Our novel method projects the original linear problem down to a Krylov subspace, such that the dimensionality of the problem can be significantly reduced. Furthermore, we store the Krylov subspace computed when using the first damping parameter and recycle the subspace for the subsequent damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved using these computational techniques. We apply this new inverse modeling method to invert for random transmissivity fields in 2D and a random hydraulic conductivity field in 3D. Our algorithm is fast enough to solve for the distributed model parameters (transmissivity) in the model domain. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). By comparing with Levenberg-Marquardt methods using standard linear inversion techniques such as QR or SVD methods, our Levenberg-Marquardt method yields a speed-up ratio on the order of ~10 1 to ~10 2 in a multi-core computational environment. Furthermore, our new inverse modeling method is a powerful tool for characterizing subsurface heterogeneity for moderate- to large-scale problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Convergence analysis of single rate and multirate fixed stress split iterative coupling schemes in heterogeneous poroelastic media

Recently, the accurate modeling of flow–structure interactions has gained more attention and importance for both petroleum and environmental engineering applications. Of particular interest is the coupling between subsurface flow and reservoir geomechanics. Different single rate and multirate iterative and explicit coupling schemes have been proposed and analyzed in the past. In addition, Banach fixed point contraction results were obtained for iterative coupling schemes, and conditionally stable results were obtained for explicit coupling schemes. In this work, we will consider the mathematical analysis of the single rate and multirate fixed stress split iterative coupling schemes for spatially heterogeneous poroelastic media. We will re–establish the contractivity for both schemes in the localized case, and we will show that heterogeneities come at the expense of imposing more restricted conditions on the number of fine flow time steps that can be taken within one coarse mechanics time step in the multirate case. Our mathematical analysis is supplemented by numerical simulations validating our derived upper bounds. Finally, to the best of our knowledge, this is the first rigorous mathematical analysis of the multirate fixed–stress split iterative coupling scheme in heterogeneous poroelastic media.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Capturing Surface Coverage Effects in Heterogeneous Catalysis

Adsorbate–adsorbate lateral interactions at relevant surface coverages have a significant effect on chemical kinetics, thereby influencing the activity of a heterogeneous catalyst. Coverage-dependent kinetic and thermodynamic parameters therefore must be included in studies of such complex systems to properly predict the turnover frequencies and kinetic trends. Thus, it becomes extremely important to accurately capture the strength of lateral interactions between neighboring species under realistic reaction conditions. In this Perspective, we discuss the various existing computational and experimental methods for determining adspecies coverage and configurational effects. The choice of the tools and methods employed in such studies depends on factors such as time, length scales, computational cost, the presence of solvents, and reaction conditions. The applications of each method and the respective challenges are also discussed here. As a result, we discuss the recent developments and future of the state-of-the-art for inclusion of surface coverage and configuration into a holistic picture for accurate predictions of catalytic behavior.

09 BIOMASS FUELS↗
DOE OSTI2024

Physics-informed heterogeneous graph neural networks for DC blocker placement

The threat of geomagnetic disturbances (GMDs) to the reliable operation of the bulk energy system has spurred the development of effective strategies for mitigating their impacts. One such approach involves placing transformer neutral blocking devices, which interrupt the path of geomagnetically induced currents (GICs) to limit their impact. The high cost of these devices and the sparsity of transformers that experience high GICs during GMD events, however, calls for a sparse placement strategy that involves high computational cost. To address this challenge, we developed a physics-informed heterogeneous graph neural network (PIHGNN) for solving the graph-based dc-blocker placement problem. Our approach combines a heterogeneous graph neural network (HGNN) with a physics-informed neural network (PINN) to capture the diverse types of nodes and edges in ac/dc networks and incorporates the physical laws of the power grid. We train the PIHGNN model using a surrogate power flow model and validate it using case studies. Results demonstrate that PIHGNN can effectively and efficiently support the deployment of GIC dc-current blockers, ensuring the continued supply of electricity to meet societal demands. Furthermore, our approach has the potential to contribute to the development of more reliable and resilient power grids capable of withstanding the growing threat that GMDs pose.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

The role of machine learning in scientific workflows

Machine learning (ML) is being applied in a number of everyday contexts from image recognition, to natural language processing, to autonomous vehicles, to product recommendation. In the science realm, ML is being used for medical diagnosis, new materials development, smart agriculture, DNA classification, and many others. In this article, we describe the opportunities of using ML in the area of scientific workflow management. Scientific workflows are key to today’s computational science, enabling the definition and execution of complex applications in heterogeneous and often distributed environments. We describe the challenges of composing and executing scientific workflows and identify opportunities for applying ML techniques to meet these challenges by enhancing the current workflow management system capabilities. We foresee that as the ML field progresses, the automation provided by workflow management systems will greatly increase and result in significant improvements in scientific productivity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Application health monitoring for extreme-scale resiliency using cooperative fault management

Resiliency is and will be a critical factor in determining scientific productivity on current and exascale supercomputers, and beyond. Applications oblivious to and incapable of handling transient soft and hard errors could waste supercomputing resources or, worse, yield misleading scientific insights. In this work, we introduce a novel application-driven silent error detection and recovery strategy based on application health monitoring. Our methodology uses application output that follows known patterns, as indicators of an application's health and knowledge that violation of these patterns could be indication of faults. Information from system monitors that report hardware and software health status is used to corroborate faults. Collectively, this information is used by a fault coordinator agent to take preventive and corrective measures by applying computational steering to an application between checkpoints. This cooperative fault management system uses the Fault Tolerance Backplane as a communication channel. The benefits of this framework are demonstrated with two real application case studies, molecular dynamics, and quantum chemistry simulations, on scalable clusters with simulated memory and I/O corruptions. Lastly, the developed approach is general and can be easily applied to other applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Portable Data-Parallel Surface Reconstruction on a Uniform Rectilinear Grid

With the increasing heterogeneity and on-node parallelism of high-performance computing hardware, a major challenge is to develop portable and efficient algorithms and software. In this work, we present our implementation of a portable code to perform surface reconstruction using NVIDIA's Thrust library. Surface reconstruction is a technique commonly used in volume tracking methods for simulations of multimaterial flow with interfaces. Here, we have designed a 3D mesh data structure that is easily mapped to the 1D vectors used by Thrust and at the same time is simple to use and uses familiar data structure terminology (such as cells, faces, vertices, and edges). With this new data structure in place, we have implemented a piecewise linear interface reconstruction algorithm in 3 dimensions that effectively exploits the symmetry present in a uniform rectilinear computational cell. Finally, we report performance results, which show that a single implementation of these algorithms can be compiled to multiple backends (specifically, multi-core CPUs, NVIDIA GPUs, and Intel Xeon Phi processors), making efficient use of the available parallelism on each. We also compare performance of our implementation to a legacy FORTRAN implementation in Message Passing Interface (MPI) and show performance parity on single and multi-core CPU and achieved good parallel speed-ups on GPU. In conclusion, our research demonstrates the advantage of performance portability of the underlying data-parallel programming model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

IRIS Reimagined: Advancements in Intelligent Runtime System for Task-Based Programming

Task-based programming models are gaining traction in scientific computing. IRIS is a portable runtime system that exploits multiple heterogeneous programming systems and can discover available resources and manage multiple diverse programming systems (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, and OpenMP) simultaneously. It accounts for the constraints of task dependencies and provides customizable scheduling policies to map those tasks to heterogeneous devices. In this paper, we present new capabilities added to IRIS to improve its portability for heterogeneous programming, build-friendliness, and performance efficiency. The new additions include vendor-specific kernel support, a runtime system with a foreign function interface to eliminate writing wrapper or boilerplate code for heterogeneous kernels, an easy-to-use and configurable CMake-based build environment, automatic and efficient data transfers and orchestration, and the Hunter and DAGGER toolchains to evaluate IRIS’s task scheduling algorithms.

Miniskar, Narasinga Rao↗
DOE OSTI2024

Interface PINNs (I-PINNs): A physics-informed neural networks framework for interface problems

Here, we present a novel physics-informed neural networks (PINNs) framework for modeling interface problems, termed Interface PINNs (I-PINNs). I-PINNs uses different neural networks for any two subdomains separated by a sharp interface such that the neural networks differ only through their activation functions while the other parameters remain identical. The performance of I-PINNs, conventional PINNs, and other existing domain-decomposition PINNs methods such as extended PINNs (XPINNs) and multi-domain PINN (M-PINN) is compared through several one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems. The results demonstrate that I-PINNs provides a root-mean-square-error accuracy, at least two orders of magnitude better than conventional PINNs and XPINNs at approximately one-tenth of the computational cost of conventional PINNs and half the cost of XPINNs. Additionally, while I-PINNs and M-PINN provide comparable accuracies, M-PINN is found to be approximately 50% more expensive.

42 ENGINEERING↗
DOE OSTI2023

Ontologizing health systems data at scale: making translational discovery a reality

Common data models solve many challenges of standardizing electronic health record (EHR) data but are unable to semantically integrate all of the resources needed for deep phenotyping. Open Biological and Biomedical Ontology (OBO) Foundry ontologies provide computable representations of biological knowledge and enable the integration of heterogeneous data. However, mapping EHR data to OBO ontologies requires significant manual curation and domain expertise. We introduce OMOP2OBO, an algorithm for mapping Observational Medical Outcomes Partnership (OMOP) vocabularies to OBO ontologies. Using OMOP2OBO, we produced mappings for 92,367 conditions, 8611 drug ingredients, and 10,673 measurement results, which covered 68–99% of concepts used in clinical practice when examined across 24 hospitals. When used to phenotype rare disease patients, the mappings helped systematically identify undiagnosed patients who might benefit from genetic testing. By aligning OMOP vocabularies to OBO ontologies our algorithm presents new opportunities to advance EHR-based deep phenotyping.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2015

First principles study on electrochemical and chemical stability of solid electrolyte–electrode interfaces in all-solid-state Li-ion batteries

All-solid-state Li-ion batteries based on ceramic solid electrolyte materials are a promising next-generation energy storage technology with high energy density and enhanced cycle life. The poor interfacial conductance is one of the key limitations in enabling all-solid-state Li-ion batteries. However, the origin of this poor conductance has not been understood, and there is limited knowledge about the solid electrolyte–electrode interfaces in all-solid-state Li-ion batteries. In this paper, we performed first principles calculations to evaluate the thermodynamics of the interfaces between solid electrolyte and electrode materials and to identify the chemical and electrochemical stabilities of these interfaces. Our computation results reveal that many solid electrolyte–electrode interfaces have limited chemical and electrochemical stability, and that the formation of interphase layers is thermodynamically favorable at these interfaces. These formed interphase layers with different properties significantly affect the electrochemical performance of all-solid-state Li-ion batteries. The mechanisms of applying interfacial coating layers to stabilize the interface and to reduce interfacial resistance are illustrated by our computation. This study demonstrates a computational scheme to evaluate the chemical and electrochemical stability of heterogeneous solid interfaces. Finally, the enhanced understanding of the interfacial phenomena provides the strategies of interface engineering to improve performances of all-solid-state Li-ion batteries.

25 ENERGY STORAGE↗