Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “accelerated 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 1,549 records · Page 86
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Accelerator Physics at NSLS-II: Research Accomplishments in 2019

NSLS-II Accelerator Physics group provides scientific support for user operations, as well as for improvements and developments of the accelerator systems. In parallel to the facility support, the accelerator physicists are working on studies of topical scientific problems: development of novel lattices; studies of collective effects and beaminduced heating; advanced computations including machine learning; ultrafast electron diffraction and microscopy (LDRD). The group also made important contributions to the electron-ion collider project at BNL and to the APS upgrade project (MOUs). Research accomplishments of the NSLS-II Accelerator Physics group achieved in 2019, are summarized in this report.

36 MATERIALS SCIENCE↗
DOE OSTI2022

CompF2: Theoretical Calculations and Simulation Topical Group Report

This report summarizes the work of the Computational Frontier topical group on theoretical calculations and simulation for Snowmass 2021. We discuss the challenges, potential solutions, and needs facing six diverse but related topical areas that span the subject of theoretical calculations and simulation in high energy physics (HEP): cosmic calculations, particle accelerator modeling, detector simulation, event generators, perturbative calculations, and lattice QCD (quantum chromodynamics). The challenges arise from the next generations of HEP experiments, which will include more complex instruments, provide larger data volumes, and perform more precise measurements. Calculations and simulations will need to keep up with these increased requirements. The other aspect of the challenge is the evolution of computing landscape away from general-purpose computing on CPUs and toward special-purpose accelerators and coprocessors such as GPUs and FPGAs. These newer devices can provide substantial improvements for certain categories of algorithms, at the expense of more specialized programming and memory and data access patterns.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1983

Aeroacoustic computation of cylinder wake flow

Sound generation by uniform flow over a cylinder at the Reynolds number of 200 is calculated. The incompressible, time dependent flow field is first computed by standard computational fluid dynamics techniques using a stream function/vorticity formulation. The sound radiation is then obtained by integrating over the flow field with the Coriolis acceleration as the source term and a low frequency Green's function technique. Time histories, spectra, and directivity of the radiated sound are obtained. Comparisons with experimental data, where possible, indicate the feasibility of this computational aeroacoustics approach.

Hardin, J. C.↗
DOE OSTI2023

Equation-based and data-driven modeling: Open-source software current state and future directions

Here, a review of current trends in scientific computing reveals a broad shift to open-source and higher-level programming languages such as Python and growing career opportunities over the next decade. Open-source modeling tools accelerate innovation in equation-based and data-driven applications. Significant resources have been deployed to develop data-driven tools (PyTorch, TensorFlow, Scikit-learn) from tech companies that rely on machine learning services to meet business needs while keeping the foundational tools open. Open-source equation-based tools such as Pyomo, CasADi, Gekko, and JuMP are also gaining momentum according to user community and development pace metrics. Integration of data-driven and principles-based tools is emerging. New compute hardware, productivity software, and training resources have the potential to radically accelerate progress. However, long-term support mechanisms are still necessary to sustain the momentum and maintenance of critical foundational packages.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Accelerated Modeling of Lithium Diffusion in Solid State Electrolytes using Artificial Neural Networks

Abstract Previous efforts to understand structure‐function relationships in high ionic conductivity materials for solid state batteries have predominantly relied on density functional theory (DFT‐) based ab initio molecular dynamics (MD). Such simulations, however, are computationally demanding and cannot be reasonably applied to large systems containing more than a hundred atoms. Here, an artificial neural network (ANN) is trained to accelerate the calculation of high accuracy atomic forces and energies used during such MD simulations. After carefully training a robust ANN for four and five element systems, nearly identical lithium ion diffusivities are obtained for Li 10 GeP 2 S 12 (LGPS) when benchmarking the ANN‐MD results with DFT‐MD. Applying the ANN‐MD approach, the effect of chlorine doping on the lithium diffusivity is calculated in an LGPS‐like structure and it is found that a dopant concentration of 1.3% maximizes ionic conductivity. The optimal concentration balances the competing consequences of effective atomic radii and dielectric constants on lithium diffusion and agrees with the experimental composition. Performing simulations at the resolution necessary to model experimentally relevant and optimal concentrations would be infeasible with traditional DFT‐MD. Systems that require a large number of simulated atoms can be studied more efficiently while maintaining high accuracy with the proposed ANN‐MD framework.

Rao, Karun K.↗
DOE OSTI2022

ORNL Neutron Cross Section Measurements of 90 Zr

Nuclear criticality modeling and simulations rely on the quality of the existing evaluated nuclear data libraries such as Evaluated Nuclear Data File (ENDF)/B, the Joint Evaluated Fission and Fusion (JEFF) nuclear data library, or the Japanese Evaluated Nuclear Data Library (JENDL). In some cases, the cross-section evaluations of those libraries were found to be deficient in describing criticality benchmarks accurately. More than two decades ago, the US Nuclear Criticality Safety Program (NCSP) established a Nuclear Data (ND) task which encompassed experiments and evaluations. In response to this, the Oak Ridge National Laboratory (ORNL) formed a Nuclear Criticality and Data group which performed ND experiments, data analysis, and evaluations to produce ENDF files for the ND libraries as identified in the NCSP Five-Year Plan. Before being submitted to the ENDF library, files were processed and tested for performance by running benchmark calculations. This procedure was centralized in the ORNL group and is now often referred to as the ND pipeline. NCSP collaborates with the Joint Research Center (JRC) of the European Commission in Geel, Belgium, to perform high-resolution neutron-induced cross section measurements at the Geel Linear Accelerator (GELINA). The objective is to address emerging ND problems in criticality calculations. Difficulties with ND include insufficient neutron energy range, missing covariances, and previously unrecognized inaccuracies with experiments. New neutron total and capture cross sections of 90 Zr in the neutron energy range from 100 eV to several hundred keV were recently performed. These measured data will be used, together with existing high-resolution transmission data from a metallic 90 Zr sample, to improve representation of the cross sections.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Efficient Interdependent Systems Recovery Modeling with DeepONets

Modeling the recovery of interdependent critical infrastructure is a key component of quantifying and optimizing societal resilience to disruptive events. However, simulating the recovery of large-scale interdependent systems under random disruptive events is computationally expensive. Therefore, we propose the application of Deep Operator Networks (DeepONets) in this paper to accelerate the recovery modeling of interdependent systems. DeepONets are ML architectures which identify mathematical operators from data. The form of governing equations DeepONets identify and the governing equation of interdependent systems recovery model are similar. Therefore, we hypothesize that DeepONets can efficiently model the interdependent systems recovery with little training data. We applied DeepONets to a simple case of four interdependent systems with sixteen states. DeepONets, overall, performed satisfactorily in predicting the recovery of these interdependent systems for out of training sample data when compared to reference results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Preface for frontiers of magnetic reconnection research in heliophysical, astrophysical, and laboratory plasmas

Magnetic reconnection—the topological rearrangement of magnetic field—underlies many explosive phenomena across a wide range of natural and laboratory plasmas.3 It plays a pivotal role in electron and ion heating, particle acceleration to high energies, energy transport, and self-organization. Reconnection can have a complex relationship with turbulence at both large and small scales, leading to various effects that are only beginning to be understood. In heliophysics, magnetic reconnection plays a key role in solar flares, coronal mass ejections, coronal heating, solar wind dissipation, the interaction of interplanetary plasma with magnetospheres, dynamics of planetary magnetospheres such as magnetic substorms, and the heliospheric boundary with the interstellar medium. Here, the magnetic reconnection is integral to the solar and planetary dynamo processes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS2013

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗
DOE OSTI2022

COMET: A Domain-Specific Compilation of High-Performance Computational Chemistry

The computational power increases over the past decades have greatly enhanced the ability to simulate chemical reactions and understand ever more complex transformations. Tensor contractions are the fundamental computational building block of these simulations. These simulations have often been tied to one platform and restricted in generality by the interface provided to the user. The expanding prevalence of accelerators and researcher demands necessitate a more general approach which is not tied to specific hardware or requires contortion of algorithms to specific hardware platforms. In this paper we present COMET, a domain-specific programming language and compiler infrastructure for tensor contractions targeting heterogeneous accelerators. We present a system of progressive lowering through multiple layers of abstraction and optimization that achieves up to 1.98×speedup for 30 tensor contractions commonly used in computational chemistry and beyond.

Mutlu, Erdal↗
DOE OSTI2021

ExaWorks: Workflows for Exascale

Exascale computers will offer transformative capabilities to combine data-driven and learning-based approaches with traditional simulation applications to accelerate scientific discovery and insight. These software combinations and integrations, however, are difficult to achieve due to challenges of coordination and deployment of heterogeneous software components on diverse and massive platforms. We present the ExaWorks project, which can address many of these challenges: ExaWorks is leading a co-design process to create a workflow Software Development Toolkit (SDK) consisting of a wide range of workflow management tools that can be composed and interoperate through common interfaces. We describe the initial set of tools and interfaces supported by the SDK, efforts to make them easier to apply to complex science challenges, and examples of their application to exemplar cases. Furthermore, we discuss how our project is working with the workflows community, large computing facilities as well as HPC platform vendors to sustainably address the requirements of workflows at the exascale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Denoising Convolutional Networks to Accelerate Detector Simulation [Poster]

The high accuracy of detector simulation is crucial for modern particle physics experiments. However, this accuracy comes with a high computational cost, which will be exacerbated by the large datasets and complex detector upgrades associated with next-generation facilities such as the High Luminosity LHC. We explore the viability of regression-based machine learning (ML) approaches using convolutional neural networks (CNN) to ``denoise'' faster, lower-quality detector simulations, augmenting them to produce a higher-quality final result with a reduced computational burden. The denoising CNN works in concert with classical detector simulation software rather than replacing it entirely, increasing its reliability compared to other ML approaches to simulation. We obtain promising results from a prototype based on photon showers in the CMS electromagnetic calorimeter. Future directions are also discussed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

VTK-m User's Guide (V.1.6)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Efficient Computation Of Surface Sunlit Fractions In Urban-Scale Building Modeling Using Ray-Tracing Techniques

For building energy simulation at an urban-scale, solar shading calculations can be significantly slow when a large number of shading surfaces are considered in the solar shading calculations, due to the computational complexity of the geometry calculations. We developed a new algorithm using the ray-tracing technique to pre-calculate the sunlit fractions of all exterior surfaces in an urban district altogether. The ray tracing-based calculator is accelerated using General Purpose Graphics Processing Units (GPGPUs) and the Optix ray tracing library, and provides an efficient, flexible, and robust means for computing the sunlit fraction of large numbers of urban surfaces of complex geometries.

Luo, Xuan↗
DOE OSTI2025

TorchBraid: High-Performance Layer-Parallel Training of Deep Neural Networks with MPI and GPU Acceleration

TorchBraid is a high-performance implementation of layer-parallel training for deep neural networks (DNNs) supporting MPI-based parallelism and GPU acceleration. Layer-parallel training has been developed to overcome the serialization inherent in forward and backward propagation of DNNs that limits utilization of computational resources in the strong scaling limit. To achieve this, TorchBraid integrates the PyTorch neural network framework with the state-of-the-art XBraid time-parallel library. Furthermore, this article presents the use and performance of TorchBraid, in addition to solutions for overcoming the algorithmic challenges inherent in combining automatic differentiation with layer-parallel. Results are presented with and without GPU acceleration for the Tiny ImageNet and MNIST image classification data sets, as well as recurrent neural networks. Overall, TorchBraid enables fast training of DNNs, both in a strong and weak scaling context. In addition to the TorchBraid software, several new advances in applying layer-parallel algorithms are detailed. Integration of layer-parallel with data-parallel algorithms is presented for the first time, showing the computational advantages of the combination. Standard deep learning techniques, like batch-normalization, are developed for layer-parallel training. Finally, a new approach combining layer-parallel with spatial coarsening in order to accelerate training for 3D image classification shows roughly a 10× speedup over serial execution.

Layer-parallel↗
DOE OSTI2023

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗
NASA NTRS1992

Transonic aeroelastic computations on wings using Navier-Stokes equations

Aeroelastic computations are made on fighter type wings in the transonic regime. The flow is modeled using the Navier-Stokes equations and is coupled with structural equations of motion. The flow equations are solved by a time accurate finite difference scheme with moving grids. The coupled aeroelastic equations of motion are solved using the linear acceleration method. The configuration adaptive dynamic grids are time-accurately generated using the aeroelastically deformed shape of the wing. Computations are made for oscillating rigid wings with moving shock waves in the presence of leading edge vortices. The computed results compare well with the experiment. Unsteady computations are made to demonstrate the shock-vortex interaction phenomenon on wings in ramp motion. Effects of flexibility and pitch rate are demonstrated for flows with vortices.

Guruswamy, Guru P.↗