Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grain architecture”

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 109 records · Page 6

Fast and Scalable Sparse Triangular Solver for Multi-GPU Based HPC Architectures

Designing efficient and scalable sparse linear algebra kernels on modern multi-GPU based HPC systems is a daunting task due to significant irregular memory references and workload imbalance across the GPUs. This is particularly the case for \textit{Sparse Triangular Solver (SpTRSV)} which introduces additional two-dimensional computation dependencies among subsequent computation steps. Dependency information is exchanged and shared among GPUs, thus warrant for efficient memory allocation, data partitioning, and workload distribution as well as fine-grained communication and synchronization support. In this work, we demonstrate that directly adopting unified memory can adversely affect the performance of SpTRSV on multi-GPU architectures, despite linking via fast interconnect like NVLinks and NVSwitches. Alternatively, we employ the latest NVSHMEM technology based on Partitioned Global Address Space programming model to enable efficient fine-grained communication and drastic synchronization overhead reduction. Furthermore, to handle workload imbalance, we propose a malleable task-pool execution model which can further enhance the utilization of GPUs. By applying these techniques, our experiments on the NVIDIA multi-GPU supernode V100-DGX-1 and DGX-2 systems demonstrate that our design can achieve on average 3.53x (up to 9.86x) speedup on a DGX-1 system and 3.66x (up to 9.64x) speedup on a DGX-2 system with 4-GPUs over the Unified-Memory design. The comprehensive sensitivity and scalability studies also show that the proposed zero-copy SpTRSV is able to fully utilize the computing and communication resources of the multi-GPU system.

Xie, Chenhao↗

Efficient Multiscale Optoelectronic Prediction for Conjugated Polymers

Conjugated polymers represent a high-potential material class due to the tunability of their optoelectronic properties via straightforward processing protocols. However, to in silico tailor these optoelectronic properties, one must compute the conformationally dependent electronic structure over mesoscopic length and time scales. This task represents a challenging multiscale computational problem in which quantum chemistry and atomistic or coarse-grained molecular dynamics must be integrated. Recently, we introduced a methodology, called electronic coarse graining (ECG), that utilizes artificial neural networks to compute ab initio quality electronic structures using only the reduced degrees of freedom of coarse-grained models. Here, we adapt ECG to variable-molecular weight conjugated oligomers by casting the problem in the framework of sequence detection. A machine-learning (ML) architecture employing one-dimensional convolutional neural networks and long short-term memory networks is utilized to compute ground-state orbital energies, charge density distributions, and optical spectra solely from the coarse-grained model's configurational degrees of freedom. Robust molecular weight transferability for ECG is established via a A-ML approach that leverages model electronic Hamiltonians for ground and excited-state property determination. The accuracy and transferability of the ECG methodology opens the door for scalable optoelectronic property prediction in conjugated polymers directly from coarse-grained degrees of freedom.

36 MATERIALS SCIENCE↗

Performance Analysis of a Hybrid Overset Multi-Block Application on Multiple Architectures

This paper presents a detailed performance analysis of a multi-block overset grid compu- tational fluid dynamics app!ication on multiple state-of-the-art computer architectures. The application is implemented using a hybrid MPI+OpenMP programming paradigm that exploits both coarse and fine-grain parallelism; the former via MPI message passing and the latter via OpenMP directives. The hybrid model also extends the applicability of multi-block programs to large clusters of SNIP nodes by overcoming the restriction that the number of processors be less than the number of grid blocks. A key kernel of the application, namely the LU-SGS linear solver, had to be modified to enhance the performance of the hybrid approach on the target machines. Investigations were conducted on cacheless Cray SX6 vector processors, cache-based IBM Power3 and Power4 architectures, and single system image SGI Origin3000 platforms. Overall results for complex vortex dynamics simulations demonstrate that the SX6 achieves the highest performance and outperforms the RISC-based architectures; however, the best scaling performance was achieved on the Power3.

Djomehri, M. Jahed↗

Quantifying Single-Ion Transport in Percolated Ionic Aggregates of Polymer Melts

Single-ion conducting polymers such as ionomers are promising battery electrolyte materials, but it is critical to understand how rates and mechanisms of free cation transport depend on the nanoscale aggregation of cations and polymer-bound anions. We perform coarse-grained molecular dynamics simulations of ionomer melts to understand cation mobility as a function of polymer architecture, background relative permittivity, and corresponding ionic aggregate morphology. In systems exhibiting percolated ionic aggregates, cations diffuse via stepping motions along the ionic aggregates. These diffusivities can be quantitatively predicted by calculating the lifetimes of continuous association between oppositely charged ions, which equal the time scales of the stepping (diffusive) motions. In contrast, predicting cation diffusivity for systems with isolated ionic aggregates requires another time scale. Finally, our results suggest that to improve conductivity the Coulombic interaction strength should be strong enough to favor percolated aggregates but weak enough to facilitate ion dissociation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

The ATAMM procedure model for concurrent processing of large grained control and signal processing algorithms

An overview is presented of a model for describing data and control flow associated with the execution of large-grained, decision-free algorithms in a special distributed computer environment. The ATAMM (Algorithm-To-Architecture Mapping Model) model provides a basis for relating an algorithm to its execution in a dataflow multicomputer environment. The ATAMM model features a marked graph Petri net description of the algorithm behavior with regard to both data and control flow. The model provides an analytical basis for calculating performance bounds on throughput characteristics which are demonstrated here.

Stoughton, John W.↗

GrainGNN: A dynamic graph neural network for predicting 3D grain microstructure

We propose GrainGNN, a surrogate model for the evolution of polycrystalline grain structure under rapid solidification conditions in metal additive manufacturing. High fidelity simulations of solidification microstructures are typically performed using multicomponent partial differential equations (PDEs) with moving interfaces. The inherent randomness of the PDE initial conditions (grain seeds) necessitates ensemble simulations to predict microstructure statistics, e.g., grain size, aspect ratio, and crystallographic orientation. Here, currently such ensemble simulations are prohibitively expensive and surrogates are necessary.In GrainGNN, we use a dynamic graph to represent interface motion and topological changes due to grain coarsening. We use a reduced representation of the microstructure using hand-crafted features; we combine pattern finding and altering graph algorithms with two neural networks, a classifier (for topological changes) and a regressor (for interface motion). Both networks have an encoder-decoder architecture; the encoder has a multi-layer transformer long-short-term-memory architecture; the decoder is a single layer perceptron.We evaluate GrainGNN by comparing it to high-fidelity phase field simulations for in-distribution and out-of-distribution grain configurations for solidification under laser power bed fusion conditions. GrainGNN results in 80%–90% pointwise accuracy; and nearly identical distributions of scalar quantities of interest (QoI) between phase field and GrainGNN simulations compared using Kolmogorov-Smirnov test. GrainGNN's inference speedup (PyTorch on single x86 CPU) over a high-fidelity phase field simulation (CUDA on a single NVIDIA A100 GPU) is 150×–2000× for 100-initial grain problem. Further, using GrainGNN, we model the formation of 11,600 grains in 220 seconds on a single CPU core.

36 MATERIALS SCIENCE↗

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗

A collision-selection rule for a particle simulation method suited to vector computers

A theory is developed for a selection rule governing collisions in a particle simulation of rarefied gas-dynamic flows. The selection rule leads to an algorithmic form highly compatible with fine grain parallel decomposition, allowing for efficient utilization of supercomputers having vector or massively parallel single instruction multiple data architectures. A comparison of shock-wave profiles obtained using both the selection rule and Bird's direct simulation Monte Carlo (DSMC) method show excellent agreement. The equation on which the selection rule is based is shown to be directly related to the time-counter procedure in the DSMC method. The results of several example simulations of representative rarefied flows are presented, for which the number of particles used ranged from 10 to the 6th to 10 to the 7th demonstrating the greatly improved computational efficiency of the method.

Baganoff, D.↗

An N-body Tree Algorithm for the Cray T3D

We describe in this paper an algorithm for solving the gravitational N-body problem using tree data structures on the Cray T3D parallel supercomputer. This implementation is an adaptation of previous work where this problem was solved using an SIMD, fine-grained parallel computer. We show here that this approach lends itself, with small modifications, to more coarse-grained parallelism as well. We also show that the performance of the algorithm on the Cray T3D parallel architecture scales adequately with the number of processors (up to 256). Specific levels to be reached using the Cray T3D parallel architecture. A peak performance level of 9.6 Gflop/s is reached on 256 processors for the time critical gravity computation.

Olson, Kevin M.↗

Mechanistic Insights into Processive Polyethylene Hydrogenolysis through In Situ NMR

Chemical polymer upcycling by processive catalysts is a promising plastic waste remediation strategy, with the capability of producing selective, high-value products from waste plastics with minimal energy input. We previously designed a novel processive catalyst with a mesoporous SiO 2 shell/Pt nanoparticle/SiO 2 core architecture (mSiO 2 /Pt/SiO 2 ) that deconstructs polyolefins within narrow pores. Here, in this paper, we elucidate the mechanism of processive polyolefin hydrogenolysis using in situ magic-angle spinning (MAS) nuclear magnetic resonance (NMR) spectroscopy and coarse-grained molecular dynamics simulations. We observe that most polyethylene–Pt interactions do not lead to C–C bond cleavage but rather to the release of the polymer via a dehydrogenation–rehydrogenation cycle. The porous architecture increases the likelihood that a released polymer is later cleaved and enables the catalyst to perform multiple successive cleavages to the same polymer chain. Both experiment and simulation show that the extent of processivity is strongly correlated with the length of the pores, with longer pores leading to a higher processivity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

What Multilevel Parallel Programs do when you are not Watching: A Performance Analysis Case Study Comparing MPI/OpenMP, MLP, and Nested OpenMP

With the current trend in parallel computer architectures towards clusters of shared memory symmetric multi-processors, parallel programming techniques have evolved that support parallelism beyond a single level. When comparing the performance of applications based on different programming paradigms, it is important to differentiate between the influence of the programming model itself and other factors, such as implementation specific behavior of the operating system (OS) or architectural issues. Rewriting-a large scientific application in order to employ a new programming paradigms is usually a time consuming and error prone task. Before embarking on such an endeavor it is important to determine that there is really a gain that would not be possible with the current implementation. A detailed performance analysis is crucial to clarify these issues. The multilevel programming paradigms considered in this study are hybrid MPI/OpenMP, MLP, and nested OpenMP. The hybrid MPI/OpenMP approach is based on using MPI [7] for the coarse grained parallelization and OpenMP [9] for fine grained loop level parallelism. The MPI programming paradigm assumes a private address space for each process. Data is transferred by explicitly exchanging messages via calls to the MPI library. This model was originally designed for distributed memory architectures but is also suitable for shared memory systems. The second paradigm under consideration is MLP which was developed by Taft. The approach is similar to MPi/OpenMP, using a mix of coarse grain process level parallelization and loop level OpenMP parallelization. As it is the case with MPI, a private address space is assumed for each process. The MLP approach was developed for ccNUMA architectures and explicitly takes advantage of the availability of shared memory. A shared memory arena which is accessible by all processes is required. Communication is done by reading from and writing to the shared memory.

Jost, Gabriele↗

The BLAZE language: A parallel language for scientific programming

A Pascal-like scientific programming language, Blaze, is described. Blaze contains array arithmetic, forall loops, and APL-style accumulation operators, which allow natural expression of fine grained parallelism. It also employs an applicative or functional procedure invocation mechanism, which makes it easy for compilers to extract coarse grained parallelism using machine specific program restructuring. Thus Blaze should allow one to achieve highly parallel execution on multiprocessor architectures, while still providing the user with onceptually sequential control flow. A central goal in the design of Blaze is portability across a broad range of parallel architectures. The multiple levels of parallelism present in Blaze code, in principle, allow a compiler to extract the types of parallelism appropriate for the given architecture while neglecting the remainder. The features of Blaze are described and shows how this language would be used in typical scientific programming.

Mehrotra, P.↗

The BLAZE language - A parallel language for scientific programming

A Pascal-like scientific programming language, BLAZE, is described. BLAZE contains array arithmetic, forall loops, and APL-style accumulation operators, which allow natural expression of fine grained parallelism. It also employs an applicative or functional procedure invocation mechanism, which makes it easy for compilers to extract coarse grained parallelism using machine specific program restructuring. Thus BLAZE should allow one to achieve highly parallel execution on multiprocessor architectures, while still providing the user with conceptually sequential control flow. A central goal in the design of BLAZE is portability across a broad range of parallel architectures. The multiple levels of parallelism present in BLAZE code, in principle, allow a compiler to extract the types of parallelism appropriate for the given architecture while neglecting the remainder. The features of BLAZE are described and it is shown how this language would be used in typical scientific programming.

Mehrotra, Piyush↗

Hierarchical microstructure of Yb-filled skutterudites through ultrasonically atomized spherical powders for enhanced thermoelectric performance

Hierarchical microstructures are widely explored as a strategy to reduce lattice thermal conductivity in thermoelectric materials while preserving favorable electronic transport. Here we demonstrate that ultrasonic atomization of precursor powders provides an intrinsic pathway to generate such architectures in n-type Yb0.3Co4Sb12 skutterudites. Materials were synthesized by both conventional sealed-ampoule and ultrasonic atomization routes, each yielding essentially single-phase skutterudite after densification. However, the atomized spherical powders undergo a distinct reaction-driven microstructural evolution during thermal treatment prior to densification. Electron microscopy reveals that the skutterudite phase within the particles induces swelling, cracking, and fragmentation of the droplets before consolidation. Multimodal structural and microstructural characterizations show that densification of these fragmented powders produces a hierarchical microstructure consisting of submicron grains, micrometer-scale faceted crystallites, and powder-derived domains separated by oxide-decorated boundaries. Comprehensive thermoelectric transport measurements evidence that this multiscale architecture lowers the lattice thermal conductivity while maintaining favorable electronic transport, leading to an average ~10% enhancement in the thermoelectric figure of merit. Complementary 121Sb Mössbauer spectroscopy further indicates lattice softening in the atomized material. These results demonstrate that ultrasonic atomization provides an effective route to engineer hierarchical microstructures in skutterudite thermoelectrics and offers a promising strategy for tailoring thermal transport in energy-conversion materials.

Bouteiller, Hugo [ORNL] (ORCID:0009000421322962)↗

Reduced diffusion and enhanced retention of multiple radionuclides from pore structure characterization of barrier materials for enhanced repository performance

Fluid flow and chemical transport in porous media are the macroscopic consequences of pore structure, which integrates geometry (e.g., pore size and surface area, pore-size distribution) and topology (e.g., pore connectivity). Low-permeability geological media whose pores are poorly interconnected will exhibit the characteristics of anomalous diffusion and sample size-dependent effective porosity, which will strongly impact long-term net diffusion and retention of radionuclides in geological repository settings involving different host rocks and barrier materials. A suite of innovative and complementary experimental approaches is utilized to study the microscopic pore structure and macroscopic fluid flow & chemical transport for a range of host rocks and barrier materials, in addition to standard clay minerals and reference rocks. With a particular focus on quantifying the presence and magnitude of “isolated” pores for a reduced effective porosity in low-permeability geomedia, the integrated methodologies for basic properties and pore structure characterization of these geomedia include X-ray diffraction, thin section petrography, grain size distribution, water immersion porosimetry after vacuum-pulling for full saturation, mercury intrusion porosimetry, nitrogen physisorption, scanning electron microscopy, X-ray computed tomography, and (ultra-)small angle neutron (X-ray) scattering. In addition, custom-designed gas diffusion, tracer recipe involving a range of anionic and cationic chemicals with subsequent analyses by laser ablation and inductively coupled plasma-mass spectrometry, along with batch sorption, column transport, and imbibition tests were conducted for coupled effects of pore structure and chemical retention/transport. From the perspectives of pore structure in conjunction with multiple and complementary approaches to examining a range of sample sizes under different observational scales, we find that the poor pore connectivity is prevalent in low-permeability media (mudstone and crystalline rock) that is related to geological processes (e.g., compaction, diagenesis and thermal maturation). For example, the deep and organic matter-rich mudstones have a much smaller effective porosity than the total porosity (as a result of poor pore connectivity) and associated diffusion coefficient, and the effective porosity & diffusion coefficients are also dependent upon the sample sizes used in the measurement. Similarly, most of the pore space in the shallow mudstone is also controlled by pore-throat diameters in the 5-50 nm range of intergranular pore types from its fine-grained nature, but with an overall good pore connectivity. However, the nm-sized pore space (physically pore-network architecture) and strong sorption capacities (chemical retention from clay minerals) of both shallow and deep mudstones lead to the synergistic retention of cationic radionuclides and their utilities as effective host rocks and barrier materials. Our unique approaches of studying how the micro-scale pore structure affect macro-scale fluid flow, diffusion & retention, and chemical transport produce improved mechanistic understanding, and realistic quantification, of diffusion and retention of typical radionuclides in a range of generic host rocks and barrier materials (clay/shale, salt, crystalline rock, and tuff), with the overall results leading to scientifically-based understanding of enhanced isolation (from both diffusion and retention) of radionuclides and improved confidence on the long-term performance of geological repository to store high-level radioactive wastes. In addition to the training of 25 undergraduates, graduates, and postdocs of UTA, the scientists (organizations) involved in performing this work (e.g., discussion, sample sharing, and operation of SANS and SAXS instruments) include Ed Matteo, Yifeng Wang, and Kristopher Kuhlman (Sandia National Laboratories), Jens Birkholzer, Liange Zheng, Tim Kneafsey, and Sharon Borglin (Lawrence Berkeley National Laboratory), Mavrik Zavarin (Lawrence Livermore National Laboratory), Yukio Tachi and Yuta Fukatsu (Japan Atomic Energy Agency), Mieke de Craen (Euridice, Belgium), Markus Bleuel (NIST), Wei-Ren Chen, Gergely Nagy, Changwoo Do, William Heller, Larry Anovitz, and Kenneth Littrell (ORNL), as well as Jan Illvsky, Ivan Kuzmenko, Ju-Sang Park and Jon Almers (ANL). Key deliverables include a total of 13 peer-reviewed journal articles (nine published and three under review), 23 presentations at scientific conferences (AAPG, AAPG Southwest Section, AGU, Asian Clay Conference, GSA, GSA South-Central Section, IHLRWM, InterPore, International Conference on Chemistry and Migration Behavior of Actinides and Fission Products in the Geosphere, International Conference on Coupled Processes in Fractured Geological Media: Observation, Modeling and Application), and academic institutions (UTA, New Mexico State University; University of Poitiers, France; University of Helsinki, Finland; Uppsala University, Sweden; Istanbul Technical University, Turkey) and other organizations (Andra, France; Posiva Oy, Finland).

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A situated reasoning architecture for space-based repair and replace tasks

Space-based robots need low level control for collision detection and avoidance, short-term load management, fine-grained motion, and other physical tasks. In addition, higher level control is required to focus strategic decision making as missions are assigned and carried out. Reasoning and control must be responsive to ongoing changes in the environment. Research aimed at bridging the gap between high level artificial intelligence (AI) planning techniques and task-level robot programming for telerobotic systems is described. Situated reasoning is incorporated into AI and Robotics systems in order to coordinate a robot's activity within its environment. An integrated system under development in a component maintenance domain is described. It is geared towards replacing worn and/or failed Orbital Replacement Units (ORUs) designed for use aboard NASA's Space Station Freedom based on the collection of components available at a given time. High level control reasons in component space in order to maximize the number operational component-cells over time, while the task-level controls sensors and effectors, detects collisions, and carries out pick and place tasks in physical space. Situated reasoning is used throughout the system to cope with component failures, imperfect information, and unexpected events.

Bloom, Ben↗