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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Gas hydrate quantification in Walker Ridge block 313, Gulf of Mexico, from full-waveform inversion of ocean-bottom seismic data

The Gulf of Mexico (GOM) Joint Industry Project Leg 2 logging-while-drilling data in Walker Ridge lease block 313 (WR313) in the GOM detected gas hydrate in coarse- and fine-grained sediments at sites WR313-G and WR313-H. The coarse-grained units are thin ([Formula: see text]) and highly saturated, whereas the fine-grained unit is thick (approximately 200 m) with low saturation and fracture-filling gas hydrate. Unlike its coarse-grained counterpart, the seismic character of the fine-grained unit does not clearly indicate the presence of gas hydrate, which would likely have remained undiscovered in the absence of drilling. In this paper, through frequency-domain acoustic full-waveform inversion (FWI) of ocean-bottom seismometer data along a 2D multichannel seismic transect near sites WR313-G and WR313-H, we detect and quantify gas hydrate in the fine-grained unit. Key results are as follows: First, the base of the gas hydrate stability zone, which is not obvious in the reflection profile, can be discerned in the FWI results. Second, the gas hydrate in the fine-grained unit is mainly confined to the area between two sets of opposite-dipping normal faults implying that the fault architecture may be partially responsible for this gas hydrate accumulation and distribution.

Geochemistry & Geophysics↗
NASA NTRS1990

Highly parallel computation

Among the highly parallel computing architectures required for advanced scientific computation, those designated 'MIMD' and 'SIMD' have yielded the best results to date. The present development status evaluation of such architectures shown neither to have attained a decisive advantage in most near-homogeneous problems' treatment; in the cases of problems involving numerous dissimilar parts, however, such currently speculative architectures as 'neural networks' or 'data flow' machines may be entailed. Data flow computers are the most practical form of MIMD fine-grained parallel computers yet conceived; they automatically solve the problem of assigning virtual processors to the real processors in the machine.

Denning, Peter J.↗
NASA NTRS1996

(abstract) A High Throughput 3-D Inner Product Processor

A particularily challenging image processing application is the real time scene acquisition and object discrimination. It requires spatio-temporal recognition of point and resolved objects at high speeds with parallel processing algorithms. Neural network paradigms provide fine grain parallism and, when implemented in hardware, offer orders of magnitude speed up. However, neural networks implemented on a VLSI chip are planer architectures capable of efficient processing of linear vector signals rather than 2-D images. Therefore, for processing of images, a 3-D stack of neural-net ICs receiving planar inputs and consuming minimal power are required. Details of the circuits with chip architectures will be described with need to develop ultralow-power electronics. Further, use of the architecture in a system for high-speed processing will be illustrated.

imaging parallel processing algorithms linear vect↗
DOE OSTI2026

Scaling kinetic Monte-Carlo simulations of grain growth with combined convolutional and graph neural networks

Graph neural networks (GNN) have emerged as a promising machine learning method for microstructure simulations such as grain growth. However, accurate modeling of realistic grain boundary networks requires large simulation cells, which GNN has difficulty scaling up to. To alleviate the computational costs and memory footprint of GNN, we suggest a hybrid architecture combining a convolutional neural network (CNN) based bijective autoencoder to compress the spatial dimensions, and a GNN that evolves the microstructure in the latent space of reduced spatial sizes. Our results demonstrate that the new design significantly reduces computational costs with using fewer message passing layer (from 12 down to 3) compared with GNN alone. The reduction in computational cost becomes more pronounced as the spatial size increases, indicating strong computational scalability. For the largest mesh evaluated (160 3 ), our method reduces memory usage and runtime in inference by 117× and 115×, respectively, compared with GNN-only baseline. More importantly, it shows higher accuracy and stronger spatiotemporal capability than the GNN-only baseline, especially in long-term testing. Such combination of scalability and accuracy is essential for simulating realistic material microstructures over extended time scales. The improvements can be attributed to the bijective autoencoder’s ability to compress information losslessly from spatial domain into a high dimensional feature space, thereby producing more expressive latent features for the GNN to learn from, while also contributing its own spatiotemporal modeling capability. Training data are generated from stochastic grain growth simulations, providing realistic variability for learning robust microstructure evolution. Comprehensive system validation confirms that the model is accurate, robust, and scalable.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Multiscale Modeling of Vinyl-Addition Polynorbornenes: The Effect of Stereochemistry

Vinyl-addition polynorbornenes are candidates for designing high-performance polymers due to unique characteristics, which include a high glass transition temperature associated with a rigid backbone. Recent studies have established that the processability and properties of these polymers can be fine-tuned by using targeted substitutions. However, synthesis with different catalysts results in materials with distinct properties, potentially due to the presence of various stereoisomers that are difficult to quantify experimentally. Herein, we develop all-atom models of polynorbornene oligomers based on classical force fields and density functional theory. To establish the relationship between chemical architecture, chain conformations, and melt structure, we perform detailed molecular dynamics simulations with the fine-tuned atomistic force field and propose simpler coarse-grained descriptions to address the high molecular weight limit. All-atom simulations of oligomers suggest high glass transition temperatures in the range of 550–600 K. In the melt state (800 K), meso chains form highly rigid extended coils (C∞≈11) with amorphous structural characteristics similar to the X-ray diffraction data observed in the literature. In contrast, simulations with racemo chains predict highly helical tubular chain conformations that could promote assembly into crystalline structures.

Polymer Science↗
DOE OSTI2025

BULKI-Store v0.3.2

BULKI-Store is a distributed object storage system optimized for high-performance computing environments. Built with a Rust core and Python bindings, it efficiently manages scientific and machine learning datasets across HPC clusters. The system employs a client-server architecture with MPI integration, enabling seamless scaling on supercomputers like Perlmutter. BULKI-Store's object-oriented approach provides intuitive data organization with rich metadata support, contrasting with traditional file-based solutions. Key optimizations include selective checkpoint loading, unified checkpoint files, and object chunking for large data transfers. For machine learning workloads, BULKI-Store offers advantages through fine-grained access patterns, dynamic data sharing between training instances, and reduced memory pressure. Memory management features include strategic Python GC calls, minimized data copies, and batch processing capabilities. The system leverages Rayon's thread pool for asynchronous data prefetching and supports multiple CPU architectures (ARM64, x86, AMD, RISC-V). By combining performance optimizations with developer-friendly APIs, BULKI-Store addresses the complex data management challenges of modern HPC applications while maintaining compatibility across heterogeneous computing environments.

Zhang, Wei [Lawrence Berkeley National Laboratory ↗
DOE OSTI2024

Enabling Parallel Performance and Portability of Solid Mechanics Simulations Across CPU and GPU Architectures

Efficiently simulating solid mechanics is vital across various engineering applications. As constitutive models grow more complex and simulations scale up in size, harnessing the capabilities of modern computer architectures has become essential for achieving timely results. This paper presents advancements in running parallel simulations of solid mechanics on multi-core CPUs and GPUs using a single-code implementation. This portability is made possible by the C++ matrix and array (MATAR) library, which interfaces with the C++ Kokkos library, enabling the selection of fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. MATAR simplifies the transition from Fortran to C++ and Kokkos, making it easier to modernize legacy solid mechanics codes. We applied this approach to modernize a suite of constitutive models and to demonstrate substantial performance improvements across different computer architectures. This paper includes comparative performance studies using multi-core CPUs along with AMD and NVIDIA GPUs. Results are presented using a hypoelastic–plastic model, a crystal plasticity model, and the viscoplastic self-consistent generalized material model (VPSC-GMM). The results underscore the potential of using the MATAR library and modern computer architectures to accelerate solid mechanics simulations.

Morgan, Nathaniel (ORCID:0000000276118449)↗
DOE OSTI2023

Simulations of Glass Transition and Mechanical Behavior of Off-Stoichiometric Crosslinked Polymers

Here, this work explores the influence of blend composition, network architecture, and hydrogen bonding on the material properties of crosslinked epoxy networks, focusing on the glass transition temperature (T g ) and Young’s modulus (Y). We used coarse-grained molecular dynamics simulations to simulate varying compositions of stiff and flexible components in epoxy monomer blends with varying excess of curative. We find that, without hydrogen bonding, networks of any composition show a monotonically increasing T g with decreasing excess curative, consistent with theory. In contrast, we find that when hydrogen bonding is introduced, the binary blend networks show significant enhancement in T g for lightly crosslinked systems. This result contributes to an explanation of the anomalous T g behavior observed experimentally in these systems. We further find that Y is generally enhanced by hydrogen bonds, especially below T g , demonstrating that hydrogen bonding has a significant influence on mechanical properties and can allow access to other desirable dynamic behavior, especially self-healing.

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

Investigating Local Carrier Dynamics in PERC Patterned CdTe Solar Cells

Remarkable progress has been achieved in CdTe photovoltaics (PVs) to further improve cell performance while reducing manufacturing costs. Researchers optimized the front contact that leads the short-circuit current density (J sc ) over 31mA/cm 2 (e.g., (Zn, Mg)O buffer layer and/or alloying CdTe with Se). Reese et al. reported an open-circuit voltage (V oc ) over 1 V with group-V doped single crystal, showing the feasibility of increasing V oc in CdTe PV that is fixed to less than 900 mV in most cases. Recent studies suggested that the V oc improvement in polycrystalline CdTe PVs requires well-passivated back contact. One possible strategy is to use CdMgTe alloy (E g > 1.8 eV), where the band-gap offset (ΔE CB ≈ 0.2 eV) reflects minority carrier electrons, thereby decreasing surface recombination. Another strategy is to utilize a stable Al 2 O 3 layer as an electron reflector; experimental works confirmed the improved performance with a conformal Al 2 O 3 layer. In this configuration, the precise control of Al 2 O 3 (≈1 nm) over the entire CdTe layer is essential because the J sc greatly depends on the tunneling current. While promising, both CdMgTe and Al 2 O 3 passivation on CdTe introduce unfavorable valence band offset that blocks the hole transport. Kephart et al. proposed a patterned passixc vation layer (≈ 20 nm Al 2 O 3 ) with point contacts (≈ 3 μm in diameter) that extract hole carriers. This configuration is similar to the passive emitter and rear contact (PERC) design that has been extensively studied in Si PVs. While remarkably high carrier lifetime and photoluminescence (> 10 X) were measured, consistent improvement in V oc and efficiency in this CdTe PERC were not yet observed. At this time, it is unclear how the surface potential is distributed in the presence of patterned Al 2 O 3 reflectors and how this additional field impacts the PV performance for Cu-doped and group-V doped CdTe PERC devices. To tackle this challenge, we develop robust nanofabrication and characterization platform to study CdTe PERC devices consisting of a patterned Al 2 O 3 layer on CdSe( 1-x )Te x (Cu-doped, GrV-doped; x = 0 to 1; CST). First Solar supplies high-quality CST materials. The dark and light I-Vs under 1-sun illumination are extracted for a series of each set of devices. We perform quantitative and qualitative PV analysis for a series of Cu-doped and Gr-V doped PERC devices, showing notably different V oc changes for GrV-doped compared to Cu-doped PERC devices. This project attempts to produce individual contacts on single grains and grain boundaries to measure lateral transport. As a model system, we use a CdSe( 1-x )Te x film on glass prepared by a colossal grain growth (CGG) technique at National Renewable Research Laboratories (NREL). Our preliminary results confirm that intergranular transport is hindered by the electrical barrier formed near grain boundaries. The PERC fabrication and the lateral transport measurement platform developed in this project can easily be applied to other types of advanced CdSe( 1-x )Te x architectures to better understand local photocarrier transport, in turn, providing the fundamental knowledge to improve the performance of CdTe PVs.

14 SOLAR ENERGY↗
NASA NTRS1992

Scalable parallel communications

Coarse-grain parallelism in networking (that is, the use of multiple protocol processors running replicated software sending over several physical channels) can be used to provide gigabit communications for a single application. Since parallel network performance is highly dependent on real issues such as hardware properties (e.g., memory speeds and cache hit rates), operating system overhead (e.g., interrupt handling), and protocol performance (e.g., effect of timeouts), we have performed detailed simulations studies of both a bus-based multiprocessor workstation node (based on the Sun Galaxy MP multiprocessor) and a distributed-memory parallel computer node (based on the Touchstone DELTA) to evaluate the behavior of coarse-grain parallelism. Our results indicate: (1) coarse-grain parallelism can deliver multiple 100 Mbps with currently available hardware platforms and existing networking protocols (such as Transmission Control Protocol/Internet Protocol (TCP/IP) and parallel Fiber Distributed Data Interface (FDDI) rings); (2) scale-up is near linear in n, the number of protocol processors, and channels (for small n and up to a few hundred Mbps); and (3) since these results are based on existing hardware without specialized devices (except perhaps for some simple modifications of the FDDI boards), this is a low cost solution to providing multiple 100 Mbps on current machines. In addition, from both the performance analysis and the properties of these architectures, we conclude: (1) multiple processors providing identical services and the use of space division multiplexing for the physical channels can provide better reliability than monolithic approaches (it also provides graceful degradation and low-cost load balancing); (2) coarse-grain parallelism supports running several transport protocols in parallel to provide different types of service (for example, one TCP handles small messages for many users, other TCP's running in parallel provide high bandwidth service to a single application); and (3) coarse grain parallelism will be able to incorporate many future improvements from related work (e.g., reduced data movement, fast TCP, fine-grain parallelism) also with near linear speed-ups.

Maly, K.↗
NASA NTRS1988

Vectorization of a particle simulation method for hypersonic rarefied flow

An efficient particle simulation technique for hypersonic rarefied flows is presented at an algorithmic and implementation level. The implementation is for a vector computer architecture, specifically the Cray-2. The method models an ideal diatomic Maxwell molecule with three translational and two rotational degrees of freedom. Algorithms are designed specifically for compatibility with fine grain parallelism by reducing the number of data dependencies in the computation. By insisting on this compatibility, the method is capable of performing simulation on a much larger scale than previously possible. A two-dimensional simulation of supersonic flow over a wedge is carried out for the near-continuum limit where the gas is in equilibrium and the ideal solution can be used as a check on the accuracy of the gas model employed in the method. Also, a three-dimensional, Mach 8, rarefied flow about a finite-span flat plate at a 45 degree angle of attack was simulated. It utilized over 10 to the 7th particles carried through 400 discrete time steps in less than one hour of Cray-2 CPU time. This problem was chosen to exhibit the capability of the method in handling a large number of particles and a true three-dimensional geometry.

Mcdonald, Jeffrey D.↗
NASA NTRS1993

A comparison of multiprocessor scheduling methods for iterative data flow architectures

A comparative study is made between the Algorithm to Architecture Mapping Model (ATAMM) and three other related multiprocessing models from the published literature. The primary focus of all four models is the non-preemptive scheduling of large-grain iterative data flow graphs as required in real-time systems, control applications, signal processing, and pipelined computations. Important characteristics of the models such as injection control, dynamic assignment, multiple node instantiations, static optimum unfolding, range-chart guided scheduling, and mathematical optimization are identified. The models from the literature are compared with the ATAMM for performance, scheduling methods, memory requirements, and complexity of scheduling and design procedures.

Storch, Matthew↗
NASA NTRS1997

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗
DOE OSTI2022

DRIPS: Dynamic Rebalancing of Pipelined Streaming Applications on CGRAs

Coarse-grained reconfigurable arrays (CGRAs) provide higher flexibility than application-specific integrated circuits (ASICs) and higher efficiency than fine-grained reconfigurable devices such as Field Programmable Gate Arrays (FPGAs). However, CGRAs are generally designed to support offloading of a single kernel. While their design, based on communicating functional units, appears to naturally suit data streaming applications composed of multiple cooperating kernels, current approaches only statically partition the resources across application kernels. However, emerging streaming applications at the edge (scientific instruments, sensor networks, network processing) perform much more than digital signal processing and often are data and input dependent. This leads to extremely variable kernel execution times, severely impacting the throughput of the entire pipeline if resources are only statically allocated. Therefore, in this paper, we propose DRIPS — a coarse-grained, dynamically, and partially reconfigurable array for data-dependent streaming applications. We present a unified compiler framework to facilitate the mapping of a given streaming application onto the DRIPS CGRA architecture. The experimental results show that DRIPS achieves an average throughput improvement of 1.46$\times$ across a set of representative applications over a statically partitioned solution. The additional area overhead to enable dynamic rebalancing consumes 16.34% of the entire area for a 5x5 CGRA prototype.

Tan, Cheng↗
DOE OSTI2021

O3BNN-R: An Out-Of-Order Architecture for High-Performance and Regularized BNN Inference

Binarized Neural Networks (BNN) have drawn tremendous attention due to significantly reduced computational complexity and memory demand. They have especially shown great potential in cost- and power-restricted domains, such as IoT and smart edge-devices, where reaching a certain accuracy bar is often sufficient, and real-time is highly desired.In this work, we demonstrate that the highly-condensed BNN model can be shrunk significantly further by dynamically pruning irregular redundant edges. Based on two new observations on BNN-specific properties, an out-of-order (OoO) architecture – O3BNN-R, can curtail edge evaluation in cases where the binary output of a neuron can be determined early. Similar to Instruction-Level-Parallelism(ILP), these fine-grained, irregular, runtime pruning opportunities are traditionally presumed to be difficult to exploit. In order to increase the pruning opportunities, we also optimize the training process by adding 2 regularization items in the loss function (1) for pooling pruning and (2) for threshold pruning. We evaluate our design on an FPGA platform using three well-known networks, including VggNet-16, AlexNet for ImageNet, and a VGG-like network for Cifar-10.

Geng, Tong↗
NASA NTRS1994

Cluster Computation of Flight Reynolds Number Flows

The performance of a workstation cluster used for the solution of the Reynolds-averaged Navier-Stokes equations is compared with a conventional vector supercomputer architecture. The application simulation of the steady flowfield about a transonic transport was computed using an implicit diagonal scheme in an overset mesh framework. Static load balancing was used, while coarse grain decomposition was achieved by solution of a grid zone per processor. Price/performance ratios are estimated for several scenarios in which such clusters may be utilized.

Atwood, Christopher A.↗
DOE OSTI2026

AnisONet: A deep neural operator-based anisotropic permeability upscaler from pore to Darcy scale

Directional permeability variations, which govern directional fluid flow in porous media with anisotropy, are important to accurately predict flow behavior, reactive transport, and fluid–solid interactions for various processes such as enhanced geothermal systems, energy storage devices, and biological systems. However, the intricate architecture of porous media makes it difficult to predict directional permeabilities. In this work, we present a novel machine learning (ML) framework, AnisONet, built upon an integration of a convolutional neural network, Swin transformer, and the deep operator network architecture, designed to predict anisotropic permeability and upscale predictions to larger spatial domains. First, AnisONet was evaluated with three classes of two-dimensional (2D) porous media, including synthetic circular and elliptical grains and natural sandstone grains from micro-computed tomography images. A lattice Boltzmann model (LBM) was used to calculate directional permeabilities at every 10° angle, producing 19 data points per image of porous media. AnisONet is then trained to predict permeability as a function of rotation angle. AnisONet showed strong predictive capability of directional permeability. Second, we tested our model for five upscaling cases with a large image size in the finite-element method (FEM) for 2D Darcy flow with various permeability tensor construction methods. Overall, upscaled permeability tensors in FEM simulations produce a reasonably good match with LBM results, highlighting the importance of selecting appropriate tensor formation strategies for accurate permeability upscaling. AnisONet, as a directional permeability estimator, could be further developed for more complex geometries, with the potential to develop a foundational ML model for various applications in porous media.

42 ENGINEERING↗