Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “PROCESSOR”

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,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

NWChem: Quantum Chemistry Simulations at Scale

Methods based on quantum mechanics equations have been developed since the 1930's with the purpose of accurately studying the electronic structure of molecules. However, it is only during the last two decades that intense development of new computational algorithms has opened the possibility of performing accurate simulations of challenging molecular processes with high-order many-body methods. A wealth of evidence indicates that the proper inclusion of instantaneous interactions between electrons (or the so-called electron correlation effects) is indispensable for the accurate characterization of chemical reactivity, molecular properties, and interactions of light with matter. The availability of reliable methods for benchmarking of medium-size molecular systems provides also a unique chance to propagate high-level accuracy across spatial scales through the multiscale methodologies. Some of these methods have potential to utilize computational resources in an effi*cient way since they are characterized by high numerical complexity and appropriate level of data granularity, which can be effi*ciently distributed over multi-processor architectures. The broad spectrum of coupled cluster (CC) methods falls into this class of methodologies. Several recent CC implementations clearly demonstrated the scalability of CC formalisms on architectures composed of hundreds thousand computational cores. In this context NWChem provides a collection of Tensor Contraction Engine (TCE) generated parallel implementations of various coupled cluster methods capable of taking advantage of many thousand of cores on leadership class parallel architectures.

chemistry↗
DOE OSTI2026

Accelerating laser ray tracing in high fidelity physics simulations of laser melting using squeeze U-net

Laser melting is a core component of the ongoing industrial revolution, dubbed Industry 4.0, as lasers facilitate fast and precise melting and fusion in advanced manufacturing. There is a strong need to optimize the laser process using simulations. However, this has proven challenging as high fidelity simulations are needed for predictive modeling and this is currently prohibitively expensive even when run on hundreds of processors on high performance computers. The challenge is capturing complex physics of laser material interaction, fluid dynamics, thermal physics and material phase transformations at various length and time scales. To close this technological gap, we modified a squeeze U-net to accelerate the laser ray tracing component of such high fidelity models by ~4x–40x while preserving the core physics principle of conservation of energy with 97% accuracy. This approach enables the accurate modeling of global laser energy absorption as a function of local surface temperatures and complex surface topologies, which govern the reflection directions and energy losses of laser rays upon interacting with the material surface.

Computer science↗
DOE OSTI2022

Deep learning to estimate permeability using geophysical data

Time-lapse electrical resistivity tomography (ERT) is a popular geophysical method to estimate three-dimensional (3D) permeability fields from electrical potential difference measurements. Traditional inversion and data assimilation methods are used to ingest this ERT data into hydrogeophysical models to estimate permeability. Due to ill-posedness and the curse of dimensionality, existing inversion strategies provide poor estimates and low resolution of the 3D permeability field. Recent advances in deep learning provide us with powerful algorithms to overcome this challenge. This paper presents a deep learning (DL) framework to estimate the 3D subsurface permeability from time-lapse ERT data. To test the feasibility of the proposed framework, we train DL-enabled inverse models on simulation data. Each measurement in both synthetic and field data is standardized by removing the mean and scaling the time-series to unit variance. This pre-processing step is necessary to bring simulation data closer to field observations. Subsurface process models based on hydrogeophysics are used to generate this synthetic data. Training performed on limited simulation data resulted in the DL model over-fitting. An advanced data augmentation based on mixup is implemented to generate additional training samples to overcome this issue. This mixup technique creates weakly labeled (low-fidelity) samples from strongly labeled (high-fidelity) data. The weakly labeled training data is then used to develop DL-enabled inverse models and reduce over-fitting. As both time-lapse ERT (1133048 features/realization) and 3D permeability (585453 features/realization) data samples are from a high-dimensional space, principal component analysis (PCA) is employed to reduce dimensionality. Encoded ERT and encoded permeability are generated using the trained PCA estimators. A deep neural network is then trained to map the encoded ERT to encoded permeability. This mixup training and unsupervised learning allowed us to build a fast and reasonably accurate DL-based inverse model under limited simulation data. Results show that proposed weak supervised learning can capture salient spatial features in the 3D permeability field. Quantitatively, the average mean squared error (in terms of the natural log) on the strongly labeled training, validation, and test datasets is less than 0.5. The R 2 -score (global metric) is greater than 0.75, and the percent error in each cell (local metric) is less than 10%. Finally, an added benefit in terms of computational cost is that the proposed DL-based inverse model is at least O(10 4 ) times faster than running a forward model once it is trained. Data generation, DL model training, and hyperparameter tuning to identify optimal neural network architectures utilized high-performance computing resources while the DL inference is performed on a standard laptop. Approximately, O(10 5 ) processor hours are used for generating data and DL tuning and training. We acknowledge that the data generation and DL model development are expensive. But once a DL model is trained, it can be re-used for inversion rapidly for the given system, with set physics and domain. Note that traditional inversion may require multiple forward model simulations (e.g., in the order of 10 to 1000), which are very expensive. This computational savings ≈ O(10 5 ) – O(10 7 )) makes the proposed DL-based inverse model attractive for subsurface imaging and real-time ERT monitoring applications due to fast and yet reasonably accurate estimations of permeability field.

58 GEOSCIENCES↗
DOE OSTI2022

Multi-level impacts of climate change and supply disruption events on a potato supply chain: An agent-based modeling approach

Context: The world is experiencing frequent extreme weather events like droughts, snowstorms, and shifting of seasons due to climate change. Increased frequency and severity of these extreme weather events threaten food security because agriculture depends on climate conditions. Impacts of climate change on the agricultural system not only occur at the grower’s level, but also cascade to other levels along the supply chain. Objective: In this study, we aim to quantify a wide range of economic impacts of different extreme climate events on different stages of a food supply chain. Methods: We chose the potato supply chain in Idaho as a case study. We developed a multi-echelon supply chain simulation model using an agent-based modeling (ABM) approach with five types of agents—farmers, shippers, processors, retailers, and logistics companies. In addition to the business-as-usual (BAU) scenario, we designed two climate-related disruption events—drought and snowstorm. We quantified the heterogeneous impacts at different stages of the supply chain for both fresh and processed potatoes using key performance indicators (KPIs) including revenues, prices, lead times, traded quantities, and food waste quantity. Results and Conclusion: The impacts of the disruption events are different on different agents in the supply chain for different product categories. The price hike of fresh potatoes is far higher than processed potatoes during disruption events. This price hike makes consumers switch to processed potatoes, which require more fresh potatoes as an input that further reinforces the price hike. However, because processed potatoes have an elastic demand, once their prices go up due to higher input cost, their demand drops. Non-contracted farmers gain additional revenues from the disruption events, whereas contracted farmers incur a loss due to lock-in price and lower than usual harvest. Significance: The methodology developed in this study could be applied to other food and agricultural supply chains for understanding the vulnerabilities at agent levels due to climate change disruption events. Furthermore, the findings would help develop mitigation strategies or policies to improve the well-being of the overall supply chain.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Domain decomposition in the GPU-accelerated Shift Monte Carlo code

The GPU solver within the Shift continuous-energy Monte Carlo neutron transport code has been extended to provide domain decomposition in addition to domain replication to enable the solution of problems with memory requirements exceeding the capacity of a single GPU. The strategy follows the Multiple Set, Overlapping Domain (MSOD) approach that is used in Shift’s CPU solver and integrates into the event-based algorithm used for Shift’s GPU solver. Furthermore, the ability to assign processors to spatial domains non-uniformly has been maintained. In this work, two different approaches for communicating particle data between domains are considered, and multiple criteria for load balancing problems have been investigated. Numerical results are presented for both fresh and depleted small modular nuclear reactor (SMR) cores. A parallel efficiency of approximately 80% was achieved with up to 16 spatial domains measured relative to full domain replication. A scaling study on the Summit supercomputer demonstrates a weak scaling parallel efficiency of over 90% on over 24000 GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A spherical aberration-free microscopy system for live brain imaging

Highlights: • Deep-C is an automatic spherical aberration compensation system for in vivo imaging. • Deep-C is composed of ZlinC and Peak-C. • ZlinC coordinates the correction collar rotation and the Z-position of an objective. • Peak-C is a scanning algorithm processor for calculation of image contrast. • Deep-C allows quantitative, reproducible analysis of fine GFP-labeled structures. The high-resolution in vivo imaging of mouse brain for quantitative analysis of fine structures, such as dendritic spines, requires objectives with high numerical apertures (NAs) and long working distances (WDs). However, this imaging approach is often hampered by spherical aberration (SA) that results from the mismatch of refractive indices in the optical path and becomes more severe with increasing depth of target from the brain surface. Whereas a revolving objective correction collar has been designed to compensate SA, its adjustment requires manual operation and is inevitably accompanied by considerable focal shift, making it difficult to acquire the best image of a given fluorescent object. To solve the problems, we have created an objective-attached device and formulated a fast iterative algorithm for the realization of an automatic SA compensation system. The device coordinates the collar rotation and the Z-position of an objective, enabling correction collar adjustment while stably focusing on a target. The algorithm provides the best adjustment on the basis of the calculated contrast of acquired images. Together, they enable the system to compensate SA at a given depth. As proof of concept, we applied the SA compensation system to in vivo two-photon imaging with a 25 × water-immersion objective (NA, 1.05; WD, 2 mm). It effectively reduced SA regardless of location, allowing quantitative and reproducible analysis of fine structures of YFP-labeled neurons in the mouse cerebral cortical layers. Interestingly, although the cortical structure was optically heterogeneous along the z-axis, the refractive index of each layer could be assessed on the basis of the compensation degree. It was also possible to make fully corrected three-dimensional reconstructions of YFP-labeled neurons in live brain samples. Our SA compensation system, called Deep-C, is expected to bring out the best in all correction-collar-equipped objectives for imaging deep regions of heterogeneous tissues.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2017

Preface to the Special Issue on TOUGH Symposium 2015

The TOUGH Symposium 2015 was held in Berkeley, California, September 28-30, 2015. The TOUGH family of codes, developed at the Energy Geosciences Division of Lawrence Berkeley National Laboratory (LBNL), is a suite of computer programs for the simulation of multiphase and multicomponent fluid and heat flows in porous and fractured media with applications in many geosciences fields, such as geothermal reservoir engineering, nuclear waste disposal, geological carbon sequestration, oil and gas reservoirs, gas hydrate research, vadose zone hydrology and environmental remediation. Since the first release in the 1980s, many modifications and enhancements have been continuously made to TOUGH and its various descendants (iTOUGH2, TOUGH+, TOUGH-MP, TOUGHREACT, TOUGH+HYDRATE, TMVOC...), at LBNL and elsewhere. Today, these codes are used worldwide in academia, government organizations and private companies in problems involving coupled hydrological, thermal, biogeochemical and geomechanical processes. The Symposia, organized every 2-3 years, bring together developers and users for an open exchange on recent code enhancements and applications. In 2015, the Symposium was attended by one hundred participants, representing thirty-four nationalities. This Special Issue in Computers & Geosciences gathers extended versions of selected Symposium proceedings related to (i) recent enhancements to the TOUGH family of codes and (ii) coupled flow and geomechanics processes modeling. In this special issue, a paper by Jung et al. provides a new base version of TOUGH, TOUGH3. This latest version addresses the computational robustness and efficiency needed for the increasing complexity of the simulated processes and the growing size of model domains. Moreover, it consolidates the serial and parallel versions into a single code, hence, inconsistencies between different versions are less likely to occur, and code maintenance and development become more efficient. Finsterle et al. present a review of the capabilities of iTOUGH2 and illustrate the workflow of an integrated simulation-optimization framework. Liu et al. present an approach to reduce the computational cost of performing Bayesian inverse modeling and demonstrate their approach using a synthetic experiment simulated with TOUGH2. Regarding the mesh generation process, the paper by Doughty presents a generalization of the grid-generation algorithm embedded in TOUGH2 (MESHMAKER) to create one-column grids with fractal dimension, useful for representing flow through fractures or highly heterogeneous media with fractal geometry, and also for inverse methods. Sentís and Gable present a module to interface the open source code Lagrit with TOUGH2, that assists in the processes of mesh generation and model setup, and that can be particularly useful for complex geometries and large models. Bonduà et al. present a pre-processing tool (VORO2MESH) that features a full 3D Voronoi approach for structured and unstructured grids, and an enhanced post-processor (TOUGH2Viewer) for the visualization of 3D Voronoi grids. The literature review shows that coupled fluid flow and geomechanics has gained increasing attention in the last years in many geosciences fields. In this context, several codes of the TOUGH family have been successfully coupled with geomechanics software. The paper by Rutqvist presents a review of some of these TOUGH-based geomechanics models, of which the TOUGH-FLAC simulator – presented for the first time in the TOUGH Symposium 2003 – is well-known worldwide and has been used in a large variety of applications, encompassing the application domains of the TOUGH codes. Blanco-Martín et al. present an extension of TOUGH-FLAC to the finite strain framework, motivated by the existence of large strains associated with rock salt deformation in the context of heat-generating nuclear waste disposal. Following a paper published in the Special Issue of the TOUGH Symposium 2012 in this journal, Kim et al. present the current status of the TOUGH-RSBN simulator for coupled hydro-mechanical modeling of hydraulic fracturing using a discrete fracture network approach, and present some validation and demonstration cases. Rinaldi and Nespoli present TOUGH-SEED, an injection-induced seismicity modeling approach using TOUGH2 and a geomechanics stochastic model, and apply it to the Basel EGS project. Finally, Rinaldi et al. use the PEST protocol implemented in iTOUGH2, combined with TOUGH-FLAC as the forward model, to perform inverse modeling for the In Salah CO2 demonstration site in Algeria. Using pore pressures and InSAR displacements as observations, this approach allows for a multi-physics joint inversion and takes advantage of the inverse capabilities of iTOUGH2 (parameter estimation, sensitivity analysis, uncertainty estimation …), applied to coupled fluid flow and geomechanics. On behalf of the members of the TOUGH Symposium 2015 Organizing Committee, I hope that this collection of papers will provide the readers of Computers & Geosciences with a recent view of the capabilities of the TOUGH family of codes, as well as with current modeling research domains in the geosciences. Last but not least, I would like to express my gratitude to all the reviewers who kindly contributed to this Special Issue, as well as the Journal staff who have made this publication possible.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2017

Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

A petascale direct numerical simulation study of the modelling of flame wrinkling for large-eddy simulations in intense turbulence

A new set of petascale direct numerical simulations (DNS) modelling lean hydrogen combustion with detailed chemistry in a temporally evolving slot-jet configuration is presented as a database for the development and validation of models for premixed turbulent combustion. The jet Reynolds number is 10,000, requiring grid numbers up to nearly seven billion, which was achieved by computation on 120,000 processor cores. In contrast to many prior DNS studies, a mean shear exists that drives strong turbulent mixing within the flame structure. Three cases are simulated with different Damköhler numbers, while Reynolds number is held fixed. Basic statistics are presented showing that integrated burning rates up to approximately six times the laminar burning rate are obtained. It is shown that increased flame surface area accounts for most of the enhanced burning while increases in the burning rate per unit area also play an important contribution. The database is then used to assess a new model of flame wrinkling intended for large-eddy simulations (LES). The approach draws on concepts from fractal geometry, requiring the modelling of an inner cut-off scale representing the smallest scale of flame wrinkling, and the fractal dimension controlling the resolution dependence of the unresolved flame surface area. In contrast to previous modelling, it is argued that the inner cut-off should be filter-size invariant in an inertial range. Then, dimensional and physical reasoning together with Damköhler’s limiting scaling laws for the turbulent flame speed are used to infer the cut-off and fractal dimension in limiting regimes. Two methods of determining the fractal dimension are proposed: a static, algebraic expression or a dynamic approach exploiting a Germano-type identity. Finally the model is compared against the DNS in a priori tests and is found to give excellent results, quantitatively capturing the trends with time, space, filter size and Damköhler number.

Energy & Fuels↗
DOE OSTI2019

PRISMS-Plasticity: An open-source crystal plasticity finite element software

An open-source parallel 3-D crystal plasticity finite element (CPFE) software package PRISMS-Plasticity is presented here as a part of PRISMS integrated framework. A highly efficient rate-independent crystal plasticity algorithm is implemented along with developing its algorithmic tangent modulus. Additionally, a twin activation mechanism is incorporated into the framework based on an integration point sensitive scheme. The integration of the software as a part of the PRISMS framework is demonstrated. To do so, the integration of the PRISMS-Plasticity software with experimental characterization techniques such as electron backscatter diffraction (EBSD) and synchrotron X-ray diffraction using available open source software packages of DREAM.3D and Neper is elaborated. The integration of the PRISMS-Plasticity software with the information repository of Materials Commons is also presented. The parallel performance of the software is characterized which demonstrates that it scales well for large problems running on hundreds of processors. Various examples of polycrystalline metals with face-centered cubic (FCC), body-centered cubic (BCC), and hexagonal close-packed (HCP) crystals structures are presented to show the capability of the software to efficiently solve crystal plasticity boundary value problems, in addition to integration with preprocessing and postprocessing tools. PRISMS-Plasticity is an important activity within the broader PRISMS Center and future enhancements to PRISMS-Plasticity are planned and will be described.

36 MATERIALS SCIENCE↗
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 OSTI2025

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Matching diverse feedstocks to conversion processes for the future bioeconomy

A wide variety of wasted or underutilized organic feedstocks can be leveraged to build a sustainable bioeconomy, ranging from crop residues to food processor residues and municipal wastes. Leveraging these feedstocks is both high-risk and high-reward. Converting mixed, variable, and/or highly contaminated feedstocks can pose engineering and economic challenges. However, converting these materials to fuels and chemicals can divert waste from landfills, reduce fugitive methane emissions, and enable more responsible forest management to reduce the frequency and severity of wildfires. Historically, low-value components, including ash and lignin, are poised to become valuable coproducts capable of supplementing cement and valuable chemicals. Here, we evaluate the challenges and opportunities associated with converting a range of feedstocks to renewable fuels and chemicals.

09 BIOMASS FUELS↗
DOE OSTI2023

Recent advances in describing and driving crystal nucleation using machine learning and artificial intelligence

With the advent of faster computer processors and especially graphics processing units (GPUs) over the last few decades, the use of data-intensive machine learning (ML) and artificial intelligence (AI) has increased greatly, and the study of crystal nucleation has been one of the beneficiaries. In this study, we outline how ML and AI have been applied to address four outstanding difficulties of crystal nucleation: how to discover better reaction coordinates (RCs) for describing accurately non-classical nucleation situations; the development of more accurate force fields for describing the nucleation of multiple polymorphs or phases for a single system; more robust identification methods for determining crystal phases and structures; and as a method to yield improved course-grained models for studying nucleation.

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

Implementing Molecular Dynamics on Hybrid High Performance Computers - Particle-Particle Particle-Mesh

The use of accelerators such as graphics processing units (GPUs) has become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high-performance computers, machines with nodes containing more than one type of floating-point processor (e.g. CPU and GPU), are now becoming more prevalent due to these advantages. In this paper, we present a continuation of previous work implementing algorithms for using accelerators into the LAMMPS molecular dynamics software for distributed memory parallel hybrid machines. In our previous work, we focused on acceleration for short-range models with an approach intended to harness the processing power of both the accelerator and (multi-core) CPUs. To augment the existing implementations, we present an efficient implementation of long-range electrostatic force calculation for molecular dynamics. Specifically, we present an implementation of the particle-particle particle-mesh method based on the work by Harvey and De Fabritiis. We present benchmark results on the Keeneland InfiniBand GPU cluster. We provide a performance comparison of the same kernels compiled with both CUDA and OpenCL. We discuss limitations to parallel efficiency and future directions for improving performance on hybrid or heterogeneous computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

A spectrum slicing method for the Kohn–Sham problem

Solving the Kohn–Sham equation, which arises in density functional theory, is a standard procedure to determine the electronic structure of atoms, molecules, and condensed matter systems. The solution of this nonlinear eigenproblem is used to predict the spatial and energetic distribution of electronic states. However, obtaining a solution for large systems is computationally intensive because the problem scales super-linearly with the number of atoms. Here we demonstrate a divide and conquer method that partitions the necessary eigenvalue spectrum into slices and computes each partial spectrum on an independent group of processors in parallel. We focus on the elements of the spectrum slicing method that are essential to its correctness and robustness such as the choice of filter polynomial, the stopping criterion for a vector iteration, and the detection of duplicate eigenpairs computed in adjacent spectral slices. Some of the more prominent aspects of developing an optimized implementation are discussed.

Computer Science↗