Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed computation”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Coupled‐cluster singles, doubles and perturbative triples with density fitting approximation for massively parallel heterogeneous platforms

Abstract A high‐performance implementation of the coupled‐cluster singles, doubles, and perturbative triples [CCSD(T)] is developed in the Massively Parallel Quantum Chemistry program. Novel features include: (1) reduced memory requirements via a density‐fitting (DF) CCSD implementation utilizing distributed lazy evaluation for tensors with more than two unoccupied indices and (2) the ability to utilize efficiently many‐core nodes (Intel Xeon Phi) and heterogeneous nodes with multiple NVIDIA GPUs on each node. All data that are greater than quadratic in the system size are distributed among processes. Excellent strong scaling is observed on distributed‐memory computers equipped with conventional CPUs, Intel Xeon Phi processors, and heterogeneous nodes with multiple NVIDIA GPUs Canonical CCSD(T) energies can be evaluated for systems containing 200 electrons and 1000 basis functions in a few days using a small size commodity cluster, with even larger computations possible on leadership‐class computing resources.

Peng, Chong↗
DOE OSTI2021

Three practical workflow schedulers for easy maximum parallelism

Runtime scheduling and workflow systems are an increasingly popular algorithmic component in HPC because they allow full system utilization with relaxed synchronization requirements. There are so many special-purpose tools for task scheduling, one might wonder why more are needed. Use cases seen on the Summit supercomputer needed better integration with MPI and greater flexibility in job launch configurations. Preparation, execution, and analysis of computational chemistry simulations at the scale of tens of thousands of processors revealed three distinct workflow patterns. A separate job scheduler was implemented for each one using extremely simple and robust designs: file-based, task-list based, and bulk-synchronous. Comparing to existing methods shows unique benefits of this work, including simplicity of design, suitability for HPC centers, short startup time, and well-understood per-task overhead. All three new tools have been shown to scale to full utilization of Summit, and have been made publicly available with tests and documentation. This work presents a complete characterization of the minimum effective task granularity for efficient scheduler usage scenarios. Here, these schedulers have the same bottlenecks, and hence similar task granularities as those reported for existing tools following comparable paradigms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The MolSSI QCArchive project: An open-source platform to compute, organize, and share quantum chemistry data

The Molecular Sciences Software Institute's (MolSSI) Quantum Chemistry Archive (QCArchive) project is an umbrella name that covers both a central server hosted by MolSSI for community data and the Python-based software infrastructure that powers automated computation and storage of quantum chemistry (QC) results. The MolSSI-hosted central server provides the computational molecular sciences community a location to freely access tens of millions of QC computations for machine learning, methodology assessment, force-field fitting, and more through a Python interface. Facile, user-friendly mining of the centrally archived quantum chemical data also can be achieved through web applications found at the website. The software infrastructure can be used as a standalone platform to compute, structure, and distribute hundreds of millions of QC computations for individuals or groups of researchers at any scale. The QCArchiveInfrastructure is open-source (BSD-3C), code repositories can be found at github, and releases can be downloaded via PyPI and Conda. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry Data Science > Computer Algorithms and Programming

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

${\Lambda}_c^{+}$ polarimetry using the dominant hadronic mode

The polarimeter vector field for multibody decays of a spin-half baryon is intro duced as a generalisation of the baryon asymmetry parameters. Using a recent amplitude analysis of the ${\Lambda}_c^{+}$ → $pK^-π^+$ decay performed at the LHCb experiment, we compute the distribution of the kinematic-dependent polarimeter vector for this process in the space of Mandelstam variables to express the polarised decay rate in a model-agnostic form. The obtained representation can facilitate polarisation measurements of the ${\Lambda}_c^{+}$ baryon and eases inclusion of the ${\Lambda}_c^{+}$ → $pK^-π^+$ decay mode in hadronic amplitude analyses.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Threshold resummation for computing large-x parton distribution through large-momentum effective theory

Parton distribution functions (PDFs) at large x are poorly constrained by high-energy experimental data, but extremely important for probing physics beyond standard model at colliders. We study the calculation of PDFs at large-x through large-momentum P z expansion of the lattice quasi PDFs. Similar to deep-inelastic scattering, there are two distinct perturbative scales in the threshold limit where the matching coefficient can be factorized into a space-like jet function at scale P z |1 – y| and a pair of heavy-light Sudakov form factors at scale P z . The matching formula allows us to derive a full renormalization group resummation of large threshold logarithms, and the result is consistent with the known calculation to the next-to-next to leading order (NNLO). This paves the way for direct large-x PDFs calculations in lattice QCD. As by-products, we find that the space-like jet function is related to a time-like version calculated previously through analytic continuation, and the heavy-light Sudakov form factor, calculated here to NNLO, is a universal object appearing as well in the large momentum expansion of quasi transverse-momentum-dependent PDFs and quasi wave-function amplitudes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Using $X(3823)\to J/\psi\pi^+\pi^-$ to Identify Coupled-Channel Effects

Very recently, a new charmonium-like state X(3823) was observed by the Belle and BESIII experiments, which is a good candidate of D-wave charmonium ψ(13D2). Since the X(3872) is just below the DD¯ * threshold, the decay X(3823) → J/ψπ + π - can be a golden channel to test the significance of coupled-channel effects. In this work, this decay is considered including both the hidden-charm dipion and the usual QCDME contributions. The partial decay width, the dipion invariant mass spectrum distribution dΓ[X(3823) → J/ψπ + π - ]/dmπ + π - , and the corresponding dΓ[X(3823) → J/ψπ + π - ]/d cos θ distribution are computed. Many parameters are determined from existing experimental data, leaving the results mainly dependent on only one unknown phase between the QCDME and hidden-charm dipion amplitudes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Efficiency of Uncertainty Propagation Methods for Estimating Output Moments

Uncertainty propagation methods are used to estimate the distribution of model outputs resulting from a set of uncertain model outputs. There are a number of uncertainty propagation methods available in literature. This paper compares six non-intrusive uncertainty propagation methods, Latin Hypercube Sampling, Full Factorial Integration, Univariate Dimension Reduction, Halton series, Sobol series, and Polynomial Chaos Expansion, in terms of their efficiency for estimating the first four moments of the output distribution using computational experiments. Here, the results suggest employing FFNI if there are few uncertain inputs, up to three. Uncertainty propagation methods that utilize Halton and Sobol series are found to be robust for estimating output moments as the number of uncertain inputs increases. In general, higher order polynomial chaos expansion approximations (3rd-5th order) obtained accurate estimates of model outputs with fewer model evaluations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Evanescent modes and step-like acoustic black holes

We consider a model of an acoustic black hole formed by a quasi-one dimensional Bose–Einstein condensate with a step-like horizon. This system is analyzed by solving the corresponding Bogoliubov–de Gennes equation with an appropriate matching condition at the jump. When the step is between a subsonic and supersonic flow, a sonic horizon develops and in addition to the scattering coefficients we compute the distribution of the accompanying analogue Hawking radiation. Additionally, in response to the abrupt variation in flow and non-linear Bogoliubov dispersion relation, evanescent solutions of the Bogoliubov–de Gennes equation also appear and decay out from the horizon. We bound this decay length and show that these modes produce a modulation of observables outside the event horizon by their interference with outgoing Hawking flux. We go further and find specific superpositions of ingoing eigenmodes which exhibit coherent cancellation of the Hawking flux outside the horizon but nevertheless have evanescent support outside the black hole. We conclude by speculating that when quasiparticle interactions are included, evanescent modes may yield a leakage of information across the event horizon via interactions between the real outgoing Hawking flux and the virtual evanescent modes, and that we may expect this as a generic feature of models which break Lorentz invariance at the UV (Planck) scale.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

The role of correlation and solvation in ion interactions with B-DNA

Ionic atmosphere around nucleic acids plays important roles in biological function. Large-scale explicit solvent simulations coupled to experimental assays such as anomalous small-angle X-ray scattering (ASAXS) can provide important insights into the structure and energetics of the ionic atmosphere but are time- and resource-intensive. In this paper, we demonstrate the use of classical density functional theory to model DNA-ion interactions and explore the balance between ion-DNA, ion-water, and ion-ion interactions. In particular, we compute the distribution of RbCl, SrCl2, and CoHexCl3 (cobalt hexammine chlo- ride) around a B-form DNA molecule. The accuracy of the DFT calculations was assessed by comparison between simulated and experimental ASAXS curves. As expected, these calculations revealed significant differences between the monovalent, divalent, and trivalent cations. About half of the DNA-bound Rb+ ions penetrate into the minor groove of the DNA and half adsorb on the DNA strands. The fraction of cations in the minor groove decreases for the larger Sr2+ ions and becomes zero for CoHex3+ ions, which all adsorb on the DNA strands. The distribution of CoHex3+ ions is mainly determined by Coulomb interactions, while ion-correlation forces play a central role in the monovalent Rb+ distribution and a combination of ion-correlation and hydration forces affect the Sr2+ distribution around DNA.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2014

Sampling-based Uncertainty Quantification in Deconvolution of X-ray Radiographs

In imaging applications that focus on quantitative analysis{such as X-ray radiography in the security sciences--it is necessary to be able to reliably estimate the uncertainties in the processing algorithms applied to the image data, and deconvolving the system blur out of the image is usually an essential step. In this work we solve the deconvolution problem within a Bayesian framework for edge-enhancing reconstruction with uncertainty quantification. The likelihood is a normal approximation to the Poisson likelihood, and the prior is generated from a classical total variation regularized Poisson deconvolution. Samples from the corresponding posterior distribution are computed using a Markov chain Monte Carlo approach, giving a pointwise measure of uncertainty in the final, deconvolved signal. We demonstrate the results on real data used to calibrate a high-energy X-ray source and show that this approach gives reconstructions as good as classical regularization methods, while mitigating many of their drawbacks.

Deconvolution, Inverse Problems, Markov Chain Mont↗
DOE OSTI2025

Toucan: A performance portable, scalable implementation of the DECA algorithm

In the field of additive manufacturing (AM), cellular automata (CA) is extensively used to simulate microstructural evolution during solidification. However, while traditional CA approaches are relatively fast, they still require a substantial number of time steps, are limited to moderate volumes, and are relatively difficult to improve through parallelism due to the highly localized nature of the solidification front. Here, to address these issues of time to solution and load balancing, we introduce Toucan, a parallel, performance-portable, and scalable code written in C++ with the Kokkos library that leverages the discrete event inspired cellular automata (DECA) algorithm to perform parallel-in-time (PinT) grain growth simulations. Toucan effectively mitigates load balancing issues by distributing the computational workload more evenly across processors, enhancing scalability and efficiency. We conduct both strong and weak scaling studies on up to 64 GPUs on the Frontier supercomputer, demonstrating that Toucan significantly outperforms the current state-of-the-art, time-stepped CA code, ExaCA, on both single and multi-GPU simulations. Even in AM-specific weak scaling scenarios, Toucan maintains near-ideal scaling, in contrast to the linear increase observed with ExaCA due to the moving laser raster pattern. This study highlights Toucan’s potential to transform microstructural simulations in AM by radically improving both efficiency and scalability over existing methods.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Software-Defined Network for End-to-end Networked Science at the Exascale

Domain science applications and workflow processes are currently forced to view the network as an opaque infrastructure into which they inject data and hope that it emerges at the destination with an acceptable Quality of Experience. There is little ability for applications to interact with the network to exchange information, negotiate performance parameters, discover expected performance metrics, or receive status/troubleshooting information in real time. The work we presen here is motivated by a vision for a new smart network and smart application ecosystem that will provide a more deterministic and interactive environment for domain science workflows. The Software-Defined Network for End-to-end Networked Science at Exascale (SENSE) system includes a model-based architecture, implementation, and deployment which enables automated end-to-end network service instantiation across administrative domains. An intent based interface allows applications to express their high-level service requirements, an intelligent orchestrator and resource control systems allow for custom tailoring of scalability and real-time responsiveness based on individual application and infrastructure operator requirements. This allows the science applications to manage the network as a first-class schedulable resource as is the current practice for instruments, compute, and storage systems. Deployment and experiments on production networks and testbeds have validated SENSE functions and performance. Emulation based testing verified the scalability needed to support research and education infrastructures. Key contributions of this work include an architecture definition, reference implementation, and deployment. This provides the basis for further innovation of smart network services to accelerate scientific discovery in the era of big data, cloud computing, machine learning and artificial intelligence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A framework to enhance disaster debris estimation with AI and aerial photogrammetry

This study addresses the critical need to enhance disaster preparedness and response, focusing on hurricane impact assessment and debris estimation. Accurate assessments in this context are critical for post-event search-and-rescue (SAR) operations and resource distribution. Recent computing advancements are revealing the potential of unmanned aerial vehicles (UAVs) and artificial intelligence (AI) technologies in collecting data and assisting with post-hurricane reconnaissance. However, the use of AI and UAV photogrammetry for accurate disaster impact analysis remains underexplored. To this end, this study proposes a damage and debris analysis framework harnessing reality capture through aerial imagery and photogrammetry. Within this framework, a region-based neural network is leveraged to detect debris locations in aerial imagery with favorable performance. In a testbed within the Beaumont-Port Arthur region, in Southeast Texas, this study performs 3D reality captures of the built environment. Since the accuracy of the 3D reality capture is of importance in research areas associated with time-sensitive disaster response, we further investigate the optimal 2D aerial imagery overlap ratio required to generate a sufficiently accurate 3D model for disaster impact analysis and debris volume estimation. Results indicate that, in the case of aerial imagery for infrastructure systems, a minimum of 60 % overlap is recommended for damage assessment and debris analysis. In contrast, for flat green areas, a minimum of 50 % overlap is adequate. Overall, for disaster response applications, our study reveals that an overlap ratio between 60 % and 70 % is optimal for achieving a balance between time efficiency and data quality in aerial data collection. Furthermore, these quantitative recommendations are crucial for enabling efficient disaster response efforts. Additionally, our study outcomes will improve disaster impact analysis and facilitating timely and effective response strategies.

Artificial intelligence↗
DOE OSTI2014

Quantifying the influence of twin boundaries on the deformation of nanocrystalline copper using atomistic simulations

Over the past decade, numerous efforts have sought to understand the influence of twin boundaries on the behavior of polycrystalline materials. Early results suggested that twin boundaries within nanocrystalline face-centered cubic metals have a considerable effect on material behavior by altering the activated deformation mechanisms. In this work, we employ molecular dynamics simulations to elucidate the role of twin boundaries on the deformation of <100> columnar nanocrystalline copper at room temperature under uniaxial strain. We leverage non-local kinematic metrics, formulated from continuum mechanics theory, to compute atomically-resolved rotational and strain fields during plastic deformation. These results are then utilized to compute the distribution of various nanoscale mechanisms during straining, and quantitatively resolve their contribution to the total strain accommodation within the microstructure, highlighting the fundamental role of twin boundaries. Our results show that nanoscale twins influence nanocrystalline copper by altering the cooperation of fundamental deformation mechanisms and their contributed role in strain accommodation, and we present new methods for extracting useful information from atomistic simulations. The simulation results suggest a tension–compression asymmetry in the distribution of deformation mechanisms and strain accommodation by either dislocations or twin boundary mechanisms. In highly twinned microstructures, twin boundary migration can become a significant deformation mode, in comparison to lattice dislocation plasticity in non-twinned columnar microstructures, especially during compression.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2022

Spectral quadrature for the first principles study of crystal defects: Application to magnesium

In this work, we present an accurate and efficient finite-difference formulation and parallel implementation of Kohn-Sham Density (Operator) Functional Theory (DFT) for non periodic systems embedded in a bulk environment. Specifically, employing non-local pseudopotentials, local reformulation of electrostatics, and truncation of the spatial Kohn-Sham Hamiltonian, and the Linear Scaling Spectral Quadrature method to solve for the pointwise electronic fields in real-space and the non-local component of the atomic force, we develop a parallel finite difference framework suitable for distributed memory computing architectures to simulate non-periodic systems embedded in a bulk environment. Choosing examples from magnesium-aluminum alloys, we first demonstrate the convergence of energies and forces with respect to spectral quadrature polynomial order, and the width of the spatially truncated Hamiltonian. Next, we demonstrate the parallel scaling of our framework, and show that the computation time and memory scale linearly with respect to the number of atoms. Next, we use the developed framework to simulate isolated point defects and their interactions in magnesium-aluminum alloys. Our findings conclude that the binding energies of divacancies, Al solute-vacancy and two Al solute atoms are anisotropic and are dependent on cell size. Furthermore, the binding is favorable in all three cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Performance of asynchronous optimized Schwarz with one-sided communication

In asynchronous iterative methods on distributed-memory computers, processes update their local solutions using data from other processes without an implicit or explicit global synchronization that corresponds to advancing the global iteration counter. Here in this work, we test the asynchronous optimized Schwarz domain-decomposition iterative method using various one-sided (remote direct memory access) communication schemes with passive target completion. The results show that when one-sided communication is well-supported, the asynchronous version of optimized Schwarz can outperform the synchronous version even for perfectly balanced partitionings of the problem on a supercomputer with uniform nodes.

97 MATHEMATICS AND COMPUTING↗