Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel, scaling”

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 955 records · Page 53

Microscopic Theory of the Long-Time Diffusivity and Intermediate-Time Anomalous Transport of a Nanoparticle in Polymer Melts

The transport of a single nanoparticle in unentangled and entangled polymer melts is studied based on a microscopic, force-level, self-consistent generalized Langevin equation approach. Nanoparticle self-motion and length-scale-dependent polymer relaxation enter as two parallel and competing channels of force relaxation. For entangled melts, particle long-time mobility exhibits size-dependent non-Stokes–Einstein behaviors controlled by (i) fast diffusion and length-scale-dependent collective relaxation of the unentangled matrix for particles smaller than the tube diameter and (ii) polymer relaxation via reptation for nanoparticles larger than the tube diameter. The two regimes are connected by a relatively sharp but continuous crossover. Recovery of hydrodynamic behavior requires the nanoparticle to be roughly 10 times larger than the tube diameter. Theoretical predictions for the diffusion constant are in good agreement with recent simulations of unentangled and lightly entangled melts, including the crossover regime where the nanoparticle and tube diameters are roughly equal. The calculations are also in reasonable accord with several experiments in entangled synthetic polymer melts and DNA solutions, although the activated hopping motion not included in the present theory may be important in a narrow intermediate crossover regime for sufficiently entangled polymers. The predictions of the theory for intermediate-time anomalous diffusion are of mixed quality based on comparison to simulations. Furthermore, the significant limitations identified are associated with our minimalist treatment of collective density fluctuation relaxation on intermediate time and length scales, including the possible importance of non-reptation relaxation processes in entangled melts.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

A Petascale Non-Hydrostatic Atmospheric Dynamical Core in the HOMME Framework

The High-Order Method Modeling Environment (HOMME) is a framework for building scalable, conserva- tive atmospheric models for climate simulation and general atmospheric-modeling applications. Its spatial discretizations are based on Spectral-Element (SE) and Discontinuous Galerkin (DG) methods. These are local methods employing high-order accurate spectral basis-functions that have been shown to perform well on massively parallel supercomputers at any resolution and scale particularly well at high resolutions. HOMME provides the framework upon which the CAM-SE community atmosphere model dynamical-core is constructed. In its current incarnation, CAM-SE employs the hydrostatic primitive-equations (PE) of motion, which limits its resolution to simulations coarser than 0.1 per grid cell. The primary objective of this project is to remove this resolution limitation by providing HOMME with the capabilities needed to build nonhydrostatic models that solve the compressible Euler/Navier-Stokes equations.

58 GEOSCIENCES↗

SciDAC Advances in Beam Dynamics Simulation: From Light Sources to Colliders

In this paper, we report on progress that has been made in beam dynamics simulation, from light sources to colliders, during the first year of the SciDAC-2 accelerator project 'Community Petascale Project for Accelerator Science and Simulation (ComPASS).' Several parallel computational tools for beam dynamics simulation are described. Also presented are number of applications in current and future accelerator facilities (e.g., LCLS, RHIC, Tevatron, LHC, and ELIC). Particle accelerators are some of most important tools of scientific discovery. They are widely used in high-energy physics, nuclear physics, and other basic and applied sciences to study the interaction of elementary particles, to probe the internal structure of matter, and to generate high-brightness radiation for research in materials science, chemistry, biology, and other fields. Modern accelerators are complex and expensive devices that may be several kilometers long and may consist of thousands of beamline elements. An accelerator may transport trillions of charged particles that interact electromagnetically among themselves, that interact with fields produced by the accelerator components, and that interact with beam-induced fields. Large-scale beam dynamics simulations on massively parallel computers can help provide understanding of these complex physical phenomena, help minimize design cost, and help optimize machine operation. In this paper, we report on beam dynamics simulations in a variety of accelerators ranging from next generation light sources to high-energy ring colliders that have been studied during the first year of the SciDAC-2 accelerator project.

43 PARTICLE ACCELERATORS↗

2016 High Performance Computing Annual Report

Sandia National Laboratories’ California site is celebrating its 60th anniversary (1956 to 2016), and high performance computing has been a key enabler for its scientists and engineers throughout much of its history. Since its founding, Sandia California has helped pioneer the use of HPC platforms including hosting Sandia’s first Cray-1 supercomputer in the 1970s and supporting development of scalable cluster computing platforms to create a new paradigm for cost-effective supercomputing in the 1990s. Recent decades of investment in creation of scalable application frameworks for scientific computing have also enabled new generations of modeling and simulation codes. These resources have facilitated computational analysis of complex phenomena in diverse applications spanning national defense, energy, and homeland security. Today, Sandia California researchers work with partners in academia, industry, and national labs to evolve the state-of-the-art in HPC, modeling, and data analysis (including foundational capabilities for exascale computing platforms) and apply them in transformational ways. Research efforts include mitigating the effects of silent hardware failures that can jeopardize the results of large-scale computations, developing exascale-capable asynchronous task-parallel programming models and runtime systems, formulating new techniques to better explore and analyze extreme-scale data sets, and increasing our understanding of materials and chemical sciences which has applications spanning nuclear weapons stockpile stewardship to more efficient automobile engines. The following section highlights some of these research and applications projects and further illustrates the breadth of our HPC capabilities.

97 MATHEMATICS AND COMPUTING↗

Transfer Function Design for Scientific Discovery

As computation scales beyond terascale, the scientific problems under study through computing are increasingly pushing the boundaries of human knowledge about the physical world. It is more pivotal than ever to quickly and reliably extract new knowledge from these complex simulations of ultra scale. In this project, the PI expanded the traditional notion of transfer function, which maps physical quantities to visual cues via table look-ups, to include general temporal as well as multivariate patterns that can be described procedurally through specialty mini programming languages. Their efforts aimed at answering a perpetual question of fundamental importance. That is "what a visualization should show". Instead of waiting for application scientists to initiate the process, the team at University of Tennessee worked closely with scientists at ORNL in a proactive role to envision and design elegant, powerful, and reliable tools that a user can use to specify "what is interesting". Their new techniques include visualization operators that revolve around correlation and graph properties, relative patterns in statistical distribution, temporal regular expressions, concurrent attribute subspaces and traditional compound boolean range queries. The team also paid special attention to ensure that all visualization operators are inherently designed with great parallel scalability to handle tera-scale datasets in both homogeneous and heterogeneous environments. Success has been demonstrated with leading edge computational science areas include climate modeling, combustion and systems genetics.

97 MATHEMATICS AND COMPUTING↗

Communication: A reduced scaling J-engine based reformulation of SOS-MP2 using graphics processing units

We present a low-prefactor, cubically scaling scaled-opposite-spin second-order Møller-Plesset perturbation theory (SOS-MP2) method which is highly suitable for massively parallel architectures like graphics processing units (GPU). The scaling is reduced from O(N{sup 5}) to O(N{sup 3}) by a reformulation of the MP2-expression in the atomic orbital basis via Laplace transformation and the resolution-of-the-identity (RI) approximation of the integrals in combination with efficient sparse algebra for the 3-center integral transformation. In contrast to previous works that employ GPUs for post Hartree-Fock calculations, we do not simply employ GPU-based linear algebra libraries to accelerate the conventional algorithm. Instead, our reformulation allows to replace the rate-determining contraction step with a modified J-engine algorithm, that has been proven to be highly efficient on GPUs. Thus, our SOS-MP2 scheme enables us to treat large molecular systems in an accurate and efficient manner on a single GPU-server.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Approximate Computing Techniques for Iterative Graph Algorithms

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

Panyala, Ajay R.↗

Multiscale/Multiphysics Modeling of Biomass Thermochemical Processes

Computational problems in simulating biomass thermochemical processes involve coupling processes that span several orders of magnitude in space and time. Computational difficulties arise from the multitude of the problem governing equations, each typically applying over a narrow range of spatiotemporal scales, thus making it necessary to represent the processes as the result of the interaction of multiple physics modules, termed here as multiscale/multiphysics (MSMP) coupling. Predictive simulations for such processes require algorithms that can efficiently integrate the underlying MSMP methods across the scales in order to achieve prescribed accuracy and control the computational cost. In addition, MSMP algorithms must scale to one hundred thousand processors or more in order to effectively harness the new computational resources and accelerate the scientific advances. In this chapter, we discuss the state-of-the-art in modeling the macro-scale phenomena in a biomass pyrolysis reactor along with details of the shortcomings and prospects in improving predictability. We also introduce the various multiphysics modules needed to model thermochemical conversion at lower spatiotemporal scales. Furthermore, we illustrate the need for MSMP coupling for thermochemical processes in biomass and provide an overview of the wavelet-based coupling techniques we have developed recently. In particular, we provide details about the compound wavelet matrix (CWM) and the dynamic CWM (dCWM) methods and show they are highly efficient in transferring information among multiphysics models across multiple temporal and spatial scales. The algorithmic gain is in addition to the parallel spatial scalability from traditional domain decomposition methods. The CWM algorithms are serial in time and limited by the smallest-system time-scales. In order to relax this algorithmic constraint, we have recently coupled time parallel (TP) algorithms to CWM, thus yielding a novel approach termed tpCWM. We present preliminary results from the tpCWM technique, indicating that we can accelerate time-to-solution by 2 to 3-orders of magnitude even on 20-processors and this can potentially constitute a new paradigm for MSMP simulations. If such improvements in simulation capability can be generalized, the tpCWM approach can lead the way to predictive simulations of biomass thermochemical processes.

09 BIOMASS FUELS↗

Adaptively Compressed Exchange Operator for Large-Scale Hybrid Density Functional Calculations with Applications to the Adsorption of Water on Silicene

Density functional theory (DFT) calculations using hybrid exchange-correlation functionals have been shown to provide an accurate description of the electronic structures of nanosystems. However, such calculations are often limited to small system sizes due to the high computational cost associated with the construction and application of the Hartree-Fock (HF) exchange operator. Here, we demonstrate that the recently developed adaptively compressed exchange (ACE) operator formulation [J. Chem. Theory Comput. 2016, 12, 2242-2249] can enable hybrid functional DFT calculations for nanosystems with thousands of atoms. The cost of constructing the ACE operator is the same as that of applying the exchange operator to the occupied orbitals once, while the cost of applying the Hamiltonian operator with a hybrid functional (after construction of the ACE operator) is only marginally higher than that associated with applying a Hamiltonian constructed from local and semilocal exchange-correlation functionals. Therefore, this new development significantly lowers the computational barrier for using hybrid functionals in large-scale DFT calculations. We demonstrate that a parallel planewave implementation of this method can be used to compute the ground-state electronic structure of a 1000-atom bulk silicon system in less than 30 wall clock minutes and that this method scales beyond 8000 computational cores for a bulk silicon system containing about 4000 atoms. The efficiency of the present methodology in treating large systems enables us to investigate adsorption properties of water molecules on Ag-supported two-dimensional silicene. Our computational results show that water monomer, dimer, and trimer configurations exhibit distinct adsorption behaviors on silicene. In particular, the presence of additional water molecules in the dimer and trimer configurations induces a transition from physisorption to chemisorption, followed by dissociation on Ag-supported silicene. This is caused by the enhanced effect of hydrogen bonds on charge transfer and proton transfer processes. Lastly, such a hydrogen bond autocatalytic effect is expected to have broad applications for silicene as an efficient surface catalyst for oxygen reduction reactions and water dissociation.

36 MATERIALS SCIENCE↗

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↗

Scalable Graph Analytics and HPC Operational Enhancement: Parallel Computing and ML/DL Innovations

Parallel computing plays a pivotal role in the efficient processing of large-scale graphs. Complex network analysis stands as a capti- vating research frontier, holding promise across diverse scientific domains such as sociology, biology, online media, and recommenda- tion systems. In this era, Machine Learning (ML) and Deep Learning (DL) have emerged as indispensable tools, underpinning remarkable technological achievements. Within this dynamic landscape, my research revolves around advancing parallel algorithms tailored for large-scale graph operations. To achieve this, I harness the power of cutting-edge technologies including OpenMP, MPI, HIP, and CUDA, on the High-Performance Computing (HPC) platforms to unlock optimal performance. I also apply ML/DL techniques to HPC operational data, to streamline the monitoring and maintenance of supercomputers, alleviating the complexities associated with their upkeep and enhancing user support. My research echoes the syn- ergy between parallel computing, large-scale graph analysis, and ML/DL, improving computational efficiency and user experience.

Sattar, Naw Safrin↗

Effects of Galactic Irradiation on Thermal and Electronic Transport in Tungsten

The impact of irradiation on the thermal and electronic properties of materials is a persistent puzzle, particularly defect formation at the atomic and nanoscales. This work examines the nanoscale effects of low-energy irradiation on tungsten (W), focusing on defect-induced modifications to thermal and electronic transport. Using the site-projected thermal conductivity (SPTC) method [A. Gautam et al. PSS-RRL, 2400306, 2024], bulk and twin-grain boundary W with vacancy defects based on the Norgett–Robinson–Torrens displacements per atom model is analyzed. SPTC provides a detailed prediction of postcascade spatial thermal conductivity distribution. Electronic conductivity activity is estimated using the “N 2 method” [K. Nepal et al. Carbon, 119711, 2025] to explore the consequences of vacancies and grain boundaries, highlighting the defect-dependent nature of charge transport behavior. These findings offer high-resolution insights into irradiation-driven transport phenomena, with implications for space-exposed materials and nanoscale thermal/electronic management.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The OpenMC Monte Carlo particle transport code

A new Monte Carlo code called OpenMC is currently under development at the Massachusetts Institute of Technology as a tool for simulation on high-performance computing platforms. Given that many legacy codes do not scale well on existing and future parallel computer architectures, OpenMC has been developed from scratch with a focus on high performance scalable algorithms as well as modern software design practices. The present work describes the methods used in the OpenMC code and demonstrates the performance and accuracy of the code on a variety of problems.

Nuclear Science & Technology↗

Establishing mesh topology in multi-material cells: enabling technology for robust and accurate multi-material simulations

Real world problems are typically multi-material, combining materials such as gases, liquids and solids that have very different properties. The material interfaces may be fixed in time or can be a part of the solution, as in fluid-structure interactions or air-water dynamics, and therefore move and change shape. In such problems the computational mesh may be non-conformal to interfaces due to complexity of these interfaces, presence of small fractions of materials, or because the mesh does not move with the flow, as in the arbitrary Lagrangian–Eulerian (ALE) methods. In order to solve problems of interest on such meshes, interface reconstruction methods are usually used to recover an approximation of material regions within the cells. For a cell intersecting multiple material regions, these approximations of contained subregions can be considered as single-material subcells in a local mesh that we call a minimesh. In this paper, we discuss some of the requirements that discretization methods have on topological information in the resulting hierarchical meshes and present an approach that allows incorporating the buildup of sufficiently detailed topology into the nested dissections based PLIC-type reconstruction algorithms (e.g. Volume-of-Fluid, Moment-of-Fluid) in an efficient and robust manner. Specifically, we describe the X-MOF interface reconstruction algorithm in 2D, which extends the Moment-Of-Fluid (MOF) method to include the topology of minimeshes created inside of multi-material cells and parent-child relations between corresponding mesh entities on different hierarchy levels. X-MOF retains the property of being local to a cell and not requiring external communication, which makes it suitable for massively parallel applications. Here, we demonstrate some scaling results for the X-MOF implementation in Tangram, a modern interface reconstruction framework for exascale computing.

97 MATHEMATICS AND COMPUTING↗

Efficacy of the SU(3) scheme for ab initio large-scale calculations beyond the lightest nuclei

We report on the computational characteristics of ab initio nuclear structure calculations in a symmetry-adapted no-core shell model (SA-NCSM) framework. We examine the computational complexity of the current implementation of the SA-NCSM approach, dubbed LSU3shell, by analyzing ab initio results for 6 Li and 12 C in large harmonic oscillator model spaces and SU3-selected subspaces. We demonstrate LSU3shell’s strong-scaling properties achieved with highly-parallel methods for computing the many-body matrix elements. Results compare favorably with complete model space calculations and significant memory savings are achieved in physically important applications. In particular, a well-chosen symmetry-adapted basis affords memory savings in calculations of states with a fixed total angular momentum in large model spaces while exactly preserving translational invariance.

74 ATOMIC AND MOLECULAR PHYSICS↗

High-performance high-resolution semi-Lagrangian tracer transport on a sphere

Current climate models have a limited ability to increase spatial resolution because numerical stability requires the time step to decrease. We describe a semi-Lagrangian method for tracer transport that is stable for arbitrary Courant numbers, and we test a parallel implementation discretized on the cubed sphere. The method includes a fixer that conserves mass and constrains tracers to a physical range of values. The method shows third-order convergence and maintains nonlinear tracer correlations to second order. It shows optimal accuracy at Courant numbers of 10-20, more than an order of magnitude higher than explicit methods. We present parallel performance in terms of strong scaling, weak scaling, and spatial scaling (where the time step stays constant while the resolution increases). For a 0.2° test with 100 tracers, the implementation scales efficiently to 10,000 MPI tasks.

Computer Science↗

Preconditioning a Newton-Krylov solver for all-speed melt pool flow physics

n this paper, we introduce a multigrid block-based preconditioner for solving linear systems arising from a Discontinuous Galerkin discretization of the all-speed Navier-Stokes equations with phase change. The equations are discretized in conservative form with a reconstructed Discontinuous Galerkin (rDG) method and integrated with fully-implicit time discretization schemes. To robustly converge the numerically stiff systems, we use the Newton-Krylov framework with a primitive-variable formulation (pressure, velocity, and temperature), which is better conditioned than the conservative-variable form at low-Mach number. In the limit of large acoustic CFL number and viscous Fourier number, there is a strong coupling between the velocity-pressure system and the linear systems become non-diagonally dominant. To effectively solve these ill-conditioned systems, an approximate block factorization preconditioner is developed, which uses the Schur complement to reduce a 3 x 3 block system into a sequence of two 2 x 2 block systems: velocity-pressure,v P , and velocity-temperature, v T . We compare the performance of the v P -v T Schur complement preconditioner to classic preconditioning strategies: monolithic algebraic multigrid (AMG), element-block SOR, and primitive variable block Gauss-Seidel. The performance of the preconditioned solver is investigated in the limit of large CFL and Fourier numbers for low-Mach lid-driven cavity flow, Rayleigh-Bénard melt convection, compressible internally heated convection, and 3D laser-induced melt pool flow. Here, numerical results demonstrate that the v P -v T Schur complement preconditioned solver scales well both algorithmically and in parallel, and is robust for highly ill-conditioned systems, for all tested rDG discretization schemes (up to 4th-order).

97 MATHEMATICS AND COMPUTING↗