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 1,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Computer simulation of nonstationary thermal fields in design and operation of northern oil and gas fields

A mathematical model, numerical algorithm and program code for simulation and long-term forecasting of changes in permafrost as a result of operation of a multiple well pad of northern oil and gas field are presented. In the model the most significant climatic and physical factors are taken into account such as solar radiation, determined by specific geographical location, heterogeneous structure of frozen soil, thermal stabilization of soil, possible insulation of the objects, seasonal fluctuations in air temperature, and freezing and thawing of the upper soil layer. Results of computing are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

A Novel Algorithm for Solving the Multidimensional Neutron Transport Equation on Massively Parallel Architectures

We employ the Integral Transport Matrix Method (ITMM) as the kernel of new parallel solution methods for the discrete ordinates approximation of the within-group neutron transport equation. The ITMM abandons the repetitive mesh sweeps of the traditional source iterations (SI) scheme in favor of constructing stored operators that account for the direct coupling factors among all the cells' fluxes and between the cells' and boundary surfaces' fluxes. The main goals of this work are to develop the algorithms that construct these operators and employ them in the solution process, determine the most suitable way to parallelize the entire procedure, and evaluate the behavior and parallel performance of the developed methods with increasing number of processes, P. The fastest observed parallel solution method, Parallel Gauss-Seidel (PGS), was used in a weak scaling comparison with the PARTISN transport code, which uses the source iteration (SI) scheme parallelized with the Koch-baker-Alcouffe (KBA) method. Compared to the state-of-the-art SI-KBA with diffusion synthetic acceleration (DSA), this new method- even without acceleration/preconditioning-is completitive for optically thick problems as P is increased to the tens of thousands range. For the most optically thick cells tested, PGS reduced execution time by an approximate factor of three for problems with more than 130 million computational cells on P = 32,768. Moreover, the SI-DSA execution times's trend rises generally more steeply with increasing P than the PGS trend. Furthermore, the PGS method outperforms SI for the periodic heterogeneous layers (PHL) configuration problems. The PGS method outperforms SI and SI-DSA on as few as P = 16 for PHL problems and reduces execution time by a factor of ten or more for all problems considered with more than 2 million computational cells on P = 4.096.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2010

Active-Space N -Representability Constraints for Variational Two-Particle Reduced Density Matrix Calculations

The ground-state energy of a system of fermions can be calculated by minimizing a linear functional of the two-particle reduced density matrix (2-RDM) if an accurate set of N-representability conditions is applied. In this Letter we introduce a class of linear N-representability conditions based on exact calculations on a reduced active space. Unlike wave-function-based approaches, the 2-RDM methodology allows us to combine information from calculations on different active spaces. By adding active-space constraints, we can iteratively improve our estimate for the ground-state energy. Applying our methodology to a 1D Hubbard model yields a significant improvement over traditional 2-positivity constraints with the same computational scaling.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2017

A Least-Squares-Based Weak Galerkin Finite Element Method for Second Order Elliptic Equations

Here, in this article, we introduce a least-squares-based weak Galerkin finite element method for the second order elliptic equation. This new method is shown to provide very accurate numerical approximations for both the primal and the flux variables. In contrast to other existing least-squares finite element methods, this new method allows us to use discontinuous approximating functions on finite element partitions consisting of arbitrary polygon/polyhedron shapes. We also develop a Schur complement algorithm for the resulting discretization problem by eliminating all the unknowns that represent the solution information in the interior of each element. Optimal order error estimates for both the primal and the flux variables are established. An extensive set of numerical experiments are conducted to demonstrate the robustness, reliability, flexibility, and accuracy of the least-squares-based weak Galerkin finite element method. Finally, the numerical examples cover a wide range of applied problems, including singularly perturbed reaction-diffusion equations and the flow of fluid in porous media with strong anisotropy and heterogeneity.

nite element methods↗
DOE OSTI2015

Unit Price Scaling Trends for Chemical Products

To facilitate early-stage life-cycle techno-economic modeling of emerging technologies, here we identify scaling relations between unit price and sales quantity for a variety of chemical products of three categories - metal salts, organic compounds, and solvents. We collect price quotations for lab-scale and bulk purchases of chemicals from both U.S. and Chinese suppliers. We apply a log-log linear regression model to estimate the price discount effect. Using the median discount factor of each category, one can infer bulk prices of products for which only lab-scale prices are available. We conduct out-of-sample tests showing that most of the price proxies deviate from their actual reference prices by a factor less than ten. We also apply the bootstrap method to determine if a sample median discount factor should be accepted for price approximation. We find that appropriate discount factors for metal salts and for solvents are both -0.56, while that for organic compounds is -0.67 and is less representative due to greater extent of product heterogeneity within this category.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Sensitivity Analysis and Emulation for Functional Data using Bayesian Adaptive Splines

When a computer code is used to simulate a complex system, one of the fundamental tasks is to assess the sensitivity of the simulator to the different input parameters. In the case of computationally expensive simulators, this is often accomplished via a surrogate statistical model, a statistical output emulator. An effective emulator is one that provides good approximations to the computer code output for wide ranges of input values. In addition, an emulator should be able to handle large dimensional simulation output for a relevant number of inputs; it should flexibly capture heterogeneities in the variability of the response surface; it should be fast to evaluate for arbitrary combinations of input parameters, and it should provide an accurate quantification of the emulation uncertainty. In this paper we discuss the Bayesian approach to multivariate adaptive regression splines (BMARS) as an emulator for a computer model that outputs curves. We introduce modifications to traditional BMARS approaches that allow for fitting large amounts of data and allow for more efficient MCMC sampling. We emphasize the ease with which sensitivity analysis can be performed in this situation. We present a sensitivity analysis of a computer model of the deformation of a protective plate used in pressure-driven experiments. Our example serves as an illustration of the ability of BMARS emulators to fulfill all the necessities of computability, flexibility and reliable calculation on relevant measures of sensitivity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

A numerical homogenization method for heterogeneous, anisotropic elastic media based on multiscale theory

The development of reliable methods for upscaling fine scale models of elastic media has long been an important topic for rock physics and applied seismology. Several effective medium theories have been developed to provide elastic parameters for materials such as finely layered media or randomly oriented or aligned fractures. In such cases, the analytic solutions for upscaled properties can be used for accurate prediction of wave propagation. However, such theories cannot be applied directly to homogenize elastic media with more complex, arbitrary spatial heterogeneity. We therefore propose a numerical homogenization algorithm based on multiscale finite element methods for simulating elastic wave propagation in heterogeneous, anisotropic elastic media. Specifically, our method used multiscale basis functions obtained from a local linear elasticity problem with appropriately defined boundary conditions. Homogenized, effective medium parameters were then computed using these basis functions, and the approach applied a numerical discretization that is similar to the rotated staggered-grid finite difference scheme. Comparisons of the results from our method and from conventional, analytical approaches for finely layered media showed that the homogenization reliably estimated elastic parameters for this simple geometry. Additional tests examined anisotropic models with arbitrary spatial heterogeneity where the average size of the heterogeneities ranged from several centimeters to several meters, and the ratio between the dominant wavelength and the average size of the arbitrary heterogeneities ranged from 10 to 100. Comparisons to finite-difference simulations proved that the numerical homogenization was equally accurate for these complex cases.

58 GEOSCIENCES↗
DOE OSTI2022

Demonstrating the viability of Lagrangian in situ reduction on supercomputers

Performing exploratory analysis and visualization of large-scale time-varying computational science applications is challenging due to inaccuracies that arise from under-resolved data. In recent years, Lagrangian representations of the vector field computed using in situ processing are being increasingly researched and have emerged as a potential solution to enable exploration. However, prior works have offered limited estimates of the encumbrance on the simulation code as they consider “theoretical” in situ environments. Further, the effectiveness of this approach varies based on the nature of the vector field, benefitting from an in-depth investigation for each application area. With this study, an extended version of Sane et al. (2021), we contribute an evaluation of Lagrangian analysis viability and efficacy for simulation codes executing at scale on a supercomputer. We investigated previously unexplored cosmology and seismology applications as well as conducted a performance benchmarking study by using a hydrodynamics mini-application targeting exascale computing. Here, to inform encumbrance, we integrated in situ infrastructure with simulation codes, and evaluated Lagrangian in situ reduction in representative homogeneous and heterogeneous HPC environments. To inform post hoc accuracy, we conducted a statistical analysis across a range of spatiotemporal configurations as well as a qualitative evaluation. Additionally, our study contributes cost estimates for distributed-memory post hoc reconstruction. In all, we demonstrate viability for each application — data reduction to less than 1% of the total data via Lagrangian representations, while maintaining accurate reconstruction and requiring under 10% of total execution time in over 90% of our experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Towards scaling community detection on distributed-memory heterogeneous systems

Distributed multi-GPU systems pose significant challenges and opportunities for efficient execution of parallel applications. Graph algorithms are generally characterized by irregular memory accesses, low computation to communication ratios, and load balancing problems that are especially hard to address on multi-GPU systems. Graph community detection is an important problem in the emerging domain of graph analytics with numerous applications. In this paper, we present our ongoing work on distributed-memory multi-GPU implementation for graph community detection. Our work parallelizes the widely used (albeit serial) Louvain method on distributed multi-GPU platforms. Supported by an extensive set of experiments on a multi-GPU enabled supercomputer (OLCF Summit) and a single compute node (Nvidia DGX-2®), we demonstrate competitive performance to existing distributed-memory CPU-based implementation, and up to 6.5 better results than Nvidia RAPIDS® CUGRAPH. To the best of our knowledge, this work represents the first effort for community detection on distributed multi-GPU systems. Our approach and related findings can be extended to numerous other iterative graph algorithms on multi-GPU systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Multiscale simulations for multi-continuum Richards equations

In this paper, we study a multiscale method for simulating a dual-continuum unsaturated flow problem within complex heterogeneous fractured porous media. Mathematically, each of the dual continua is modeled by a multiscale Richards equation (for pressure head), and these equations are coupled to one another by transfer terms. On its own, Richards equation is already a nonlinear partial differential equation, and it is exceedingly difficult to solve numerically due to the extra nonlinear dependencies involving the soil water. To deal with multiple scales, our strategy is that starting from a microscopic scale, we upscale the coupled system of dual-continuum Richards equations via homogenization by the two-scale asymptotic expansion, to obtain a homogenized system, at an intermediate scale (level). Based on a hierarchical approach, the homogenization’s effective coefficients are computed through solving the arising cell problems. Furthermore, to tackle the nonlinearity, after time discretization, we use Picard iteration procedure for linearization of the homogenized Richards equations. At each Picard iteration, some degree of multiscale still remains from the intermediate level, so we utilize the generalized multiscale finite element method (GMsFEM) combining with a multi-continuum approach, to upscale the homogenized system to a macroscopic (coarse-grid) level. This scheme involves building uncoupled and coupled multiscale basis functions, which are used not only to construct coarse-grid solution approximation with high accuracy but also (with the coupled multiscale basis) to capture the interactions among continua. These prospects and convergence are demonstrated by several numerical results for the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Efficient Heterogeneous Execution on Large Multicore and Accelerator Platforms: Case Study Using a Block Tridiagonal Solver

The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing block-level linear algebra operations in the overall, distributed solver algorithm. Optimizations incorporated include: (1) an efficient memory mapping and synchronization interface to minimize data movement, (2) multi-process sharing of the accelerator within a node to obtain balanced load with multicore processors, and (3) an automatic memory management system to efficiently utilize accelerator memory when sub-matrices spill over the limits of device memory. Results are reported from our novel implementation that uses MAGMA and CUBLAS accelerator software systems simultaneously with ACML for multithreaded execution on processors. Overall, using 940 nVidia Tesla X2090 accelerators and 15,040 cores, the best heterogeneous execution delivers a 10.9-fold reduction in run time relative to an already efficient parallel multicore-only baseline implementation that is highly optimized with intra-node and inter-node concurrency and computation-communication overlap. Detailed quantitative results are presented to explain all critical runtime components contributing to hybrid performance.

Park, Alfred J↗
DOE OSTI2022

Ten questions concerning agent-based modeling of occupant behavior for energy and environmental performance of buildings

We report the complexity of occupant behavior is one of the major contributors to uncertainty in building performance simulation. Agent-based modeling (ABM), a computational simulation technique, has gained attention in the occupant modeling field due to its capability and flexibility to capture the heterogeneity and dynamics of human behavior and the emergent effects. While multiple efforts in the past decade have demonstrated the usefulness of the ABM approach for simulating occupants and their impacts on building performance, several crucial matters in the ABM research still remain unexplored. This paper presents ten questions that highlight the most important issues regarding ABM research and applications for occupant behavior in the context of building performance simulation. The questions and answers aim to provide insights into current and future ABM research, and more importantly to inspire new significant questions from young researchers in the field. This research is part of the IEA EBC Annex 79 project, occupant-centric building design and operation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Liquid Structure and Transport Properties of the Deep Eutectic Solvent Ethaline

A range of techniques including physical property measurements, neutron scattering experiments, ab initio molecular dynamics, and classical molecular dynamics simulations are used to probe the structural, thermodynamic, and transport properties of a deep eutectic solvent comprised of a 1:2 molar ratio of choline chloride and ethylene glycol. This mixture, known as Ethaline, has many desirable properties for use in a range of applications, and therefore, understanding its liquid structure and transport properties is of interest. Simulation results are able to capture experimental densities, diffusivities, viscosities, and structure factors extremely well. Here, the solvation environment is dynamic and dominated by different hydrogen bonding interactions. Dynamic heterogeneities resulting from hydrogen bonding interactions are quantified. Rotational dynamics of molecular dipole moments of choline and ethylene glycol are computed and found to exhibit a fast and slow mode.

25 ENERGY STORAGE↗
DOE OSTI2022

Anomalous size effect on yield strength enabled by compositional heterogeneity in high-entropy alloy nanoparticles

High-entropy alloys (HEAs), although often presumed to be random solid solutions, have recently been shown to display nanometer-scale variations in the arrangements of their multiple chemical elements. Here, we study the effects of this compositional heterogeneity in HEAs on their mechanical properties using in situ compression testing in the transmission electron microscope (TEM), combined with molecular dynamics simulations. We report an anomalous size effect on the yield strength in HEAs, arising from such compositional heterogeneity. By progressively reducing the sample size, HEAs initially display the classical “smaller-is-stronger” phenomenon, similar to pure metals and conventional alloys. However, as the sample size is decreased below a critical characteristic length (~180 nm), influenced by the size-scale of compositional heterogeneity, a transition from homogeneous deformation to a heterogeneous distribution of planar slip is observed, coupled with an anomalous “smaller-is-weaker” size effect. Atomic-scale computational modeling shows these observations arise due to compositional fluctuations over a few nanometers. These results demonstrate the efficacy of influencing mechanical properties in HEAs through control of local compositional variations at the nanoscale.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Phase field study of interfacial diffusion-driven spheroidization in a composite comprized of two mutually insoluble phases

The phase field approach is a powerful computational technique to simulate morphological and microstructural evolution at the mesoscale. Spheroidization is a frequently observed morphological change of mesoscale heterogeneous structures during annealing. In this study, we used the diffuse interface phase field method to investigate the interfacial diffusion-driven spheroidization of cylindrical rod structures in a composite comprised of two mutually insoluble phases in a two-dimensional case. Perturbation of rod radius along a cylinder's axis has long been known to cause the necessary chemical potential gradient that drives spheroidization of the rod by Lord Rayleigh's instability theory. This theory indicates that a radius perturbation wavelength larger than the initial rod circumference would lead to cylindrical spheroidization. We investigated the effect of perturbation wavelength, interfacial energy, volume diffusion, phase composition, and interfacial percentage on the kinetics of spheroidization. The results match well with both the Rayleigh's instability criterion and experimental observations.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Projected density matrix embedding theory with applications to the two-dimensional Hubbard model

Density matrix embedding theory (DMET) is a quantum embedding theory for strongly correlated systems. From a computational perspective, one bottleneck in DMET is the optimization of the correlation potential to achieve self-consistency, especially for heterogeneous systems of large size. We introduce a new approach, called projected DMET (p-DMET), which achieves self-consistency without needing to optimize the correlation potential. We demonstrate the performance of p-DMET on the two-dimensional Hubbard model.

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

Interface learning of multiphysics and multiscale systems

Complex natural or engineered systems comprise multiple characteristic scales, multiple spatiotemporal domains, and even multiple physical closure laws. To address such challenges, we introduce an interface learning paradigm and put forth a data-driven closure approach based on memory embedding to provide physically correct boundary conditions at the interface. To enable the interface learning for hyperbolic systems by considering the domain of influence and wave structures into account, we put forth the concept of upwind learning toward a physics-informed domain decomposition. The promise of the proposed approach is shown for a set of canonical illustrative problems. Here, we highlight that high-performance computing environments can benefit from this methodology to reduce communication costs among processing units in emerging machine-learning-ready heterogeneous platforms toward exascale era.

42 ENGINEERING↗
DOE OSTI2019

Learning-Based Inversion-Free Model-Data Integration to Advance Ecosystem Model Prediction

Ecosystem model prediction is important for understanding ecosystem responses to climate change and for management support. Model prediction and quantification of predictive uncertainty of ecosystems have long been investigated. The traditional workflow, which calibrates models to match observations and then uses the calibrated models for predictions, relies heavily on inverse modeling to constrain uncertain parameters in complex forward models. This inversion-based prediction approach is infeasible for complex models with heterogeneous parameter uncertainties and incapable of rapid integration of streaming and multiple sources of data because of the difficulty and computational cost in the model inversion, which is typically ill-posed and can require hundreds of thousands of expensive forward simulations to be performed iteratively. We propose to circumvent inverse modeling by precomputing an ensemble of unconstrained forward simulations and then using machine learning (ML) methods to learn the statistical relationship between simulated observation and prediction quantities. Once the ML model has learned the relationship, it can be used to make predictions of future system behavior with uncertainty quantification based on observations. The proposed learningbased inversion-free model prediction (LIMP) framework is computationally efficient which only requires a few thousands of fully parallelizable forward simulations. Additionally, LIMP can continually update predictions based on streaming observations from multiple locations and sources without necessarily requiring extra model simulations. In this study, we apply LIMP to a regional terrestrial ecosystem model with 47 parameters for testing, refining, and evaluating the approach. We demonstrate that LIMP can be used for efficient model prediction, rapid data assimilation, and cost-effective experimental design for improving robust predictive understanding of ecosystems.

Lu, Dan↗