Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel data structures”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Laboratory-Based X-ray Absorption Spectroscopy on a Working Pouch Cell Battery at Industrially-Relevant Charging Rates

Li-ion battery (LIB) research has continuing importance for the entire range of applications from consumer products to vehicle electrification and grid stabilization. In many cases, standard electrochemical methods only provide an overall voltage or specific capacity, giving an inadequate description of parallel redox processes or chemical gradients at the particle and pack level. X-ray absorption fine structure (XAFS) is frequently used to augment bulk electrochemical data, as it provides element-specific changes in oxidation state and local atomic structure. Such microscopic descriptors are crucial for elucidating charge transfer and structural changes associated with bonding or site mixing, two key factors in evaluating state of charge and modes of cell failure. However, the impact of XAFS on LIB research has been significantly constrained by a logistical barrier: contemporary XAFS work is performed almost exclusively at synchrotron X-ray light sources, where beamtime is infrequent and experiment time-frames are limited. In this report we show that modern laboratory-based XAFS cannot only be applied to, e.g., characterization of ex situ LIB electrode materials, but can also be used for operando studies at industrially-relevant charging rates in a standard pouch cell preparation. Such capability enables accelerated discovery of new materials and improved operation modes for LIBs.

25 ENERGY STORAGE↗
NASA NTRSDate not supplied

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗
DOE OSTI2019

Investigation of LSM-YSZ Composite Cathode Performance Degradation with a Multistep Charge Transfer Model

The long-term performance degradation of LSM/YSZ composite cathodes is investigated via calibrated multiphysics simulation with a multistep oxygen reduction reaction (ORR) model and structural coarsening data from a phase field study. Multiphysics simulations, including a multistep ORR mechanism, are first developed for better understanding of the limiting processes in solid oxide fuel cells. The multistep ORR mechanism includes two parallel pathways, surface pathway and bulk pathway, which consist of elementary reaction steps. The multiphysics model is simultaneously calibrated with experimental polarization curves and impedance behavior for various air/fuel supply conditions. To our knowledge, this is the first time that a multistep ORR model is calibrated with such datasets. Next, the calibrated simulations are utilized to simulate a 2D half-cell constructed with measured microstructural data and random heterogeneity. Finally, the long-term performance degradation of the half-cell is predicted by the calibrated multiphysics model coupled with structural coarsening trends simulated using a phase field-based coarsening model. Degradation of both polarization curves and impedance behavior is investigated. Thorough analyses, including changes of contributions from different pathways, the resistance components, and overall reaction order, are performed to provide more insights into cathode performance degradation due to grain coarsening phenomena.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2001

Embedded Coplanar Strips Traveling-Wave Photomixers

The electric field distribution in photomixers with electrodes deposited on the surface has already been calculated. It was shown that the strength of the electric field diminishes rapidly with depth. It was argued that the resulting reduction of the effective interaction volume of the device lowers the optical-to-heterodyne conversion. In this paper, we will present the results of our investigation on the influence of the electrode placement on the performance of photomixers. We have fabricated and measured traveling-wave photomixer devices which have both embedded and surface electrodes - the nominal spacing between the electrodes was 2 micrometers. Devices were made using either low-temperature-grown (LTG)-GaAs or ErAs:GaAs as the photoconductive material. The dark current, photocurrent, and radio frequency (RF) emission were measured at nominally 1 THz. The experimental data show a surprising difference in the behavior of ErAs:GaAs devices when the electrodes are embedded. A factor of two increase in RF radiation is observed for electric fields < 20 kV/cm. No such improvement was observed for the LTG-GaAs devices. We argue that the distinctive behavior of the two photoconductive materials is due to differences in the crystal structure - LTG-GaAs is isotropic, while ErAs:GaAs is uniaxial. We find that the carrier mobility in-plane (parallel) to the ErAs layers in the ErAs:GaAs superlattice is larger than orthogonal to these layers. The data indicate that carrier velocity overshoot is responsible for the excess radiation produced for the embedded electrode ErAs:GaAs devices.

Wyss, R. A.↗
DOE OSTI2022

MAPPRAISER: A massively parallel map-making framework for multi-kilo pixel CMB experiments

Forthcoming cosmic microwave background (CMB) polarized anisotropy experiments have the potential to revolutionize our understanding of the Universe and fundamental physics. The sought-after, tale-telling signatures will be however distributed over voluminous data sets which these experiments will collect. These data sets will need to be efficiently processed and unwanted contributions due to astrophysical, environmental, and instrumental effects characterized and efficiently mitigated in order to uncover the signatures. This poses a significant challenge to data analysis methods, techniques, and software tools which will not only have to be able to cope with huge volumes of data but to do so with unprecedented precision driven by the demanding science goals posed for the new experiments. A keystone of efficient CMB data analysis is solvers of very large linear systems of equations. Such systems appear in very diverse contexts throughout CMB data analysis pipelines, however they typically display similar algebraic structures and can therefore be solved using similar numerical techniques. Linear systems arising in the so-called map-making problem are one of the most prominent and common ones. In this work we present a massively parallel, flexible and extensible framework, comprised of a numerical library, MIDAPACK, and a high level code, MAPPRAISER, which provide tools for solving efficiently such systems. Here, the framework implements iterative solvers based on conjugate gradient techniques: enlarged and preconditioned using different preconditioners. We demonstrate the framework on simulated examples reflecting basic characteristics of the forthcoming data sets issued by ground-based and satellite-borne instruments, executing it on as many as 16,384 compute cores. The software is developed as an open source project freely available to the community at: https://github.com/B3Dcmb/midapack.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS2016

An Integrated Circuit for Radio Astronomy Correlators Supporting Large Arrays of Antennas

Radio telescopes that employ arrays of many antennas are in operation, and ever larger ones are being designed and proposed. Signals from the antennas are combined by cross-correlation. While the cost of most components of the telescope is proportional to the number of antennas N, the cost and power consumption of cross-correlationare proportional to N2 and dominate at sufficiently large N. Here we report the design of an integrated circuit (IC) that performs digital cross-correlations for arbitrarily many antennas in a power-efficient way. It uses an intrinsically low-power architecture in which the movement of data between devices is minimized. In a large system, each IC performs correlations for all pairs of antennas but for a portion of the telescope's bandwidth (the so-called "FX" structure). In our design, the correlations are performed in an array of 4096 complex multiply-accumulate (CMAC) units. This is sufficient to perform all correlations in parallel for 64 signals (N=32 antennas with 2 opposite-polarization signals per antenna). When N is larger, the input data are buffered in an on-chipmemory and the CMACs are re-used as many times as needed to compute all correlations. The design has been synthesized and simulated so as to obtain accurate estimates of the IC's size and power consumption. It isintended for fabrication in a 32 nm silicon-on-insulator process, where it will require less than 12mm2 of silicon area and achieve an energy efficiency of 1.76 to 3.3 pJ per CMAC operation, depending on the number of antennas. Operation has been analyzed in detail up to N = 4096. The system-level energy efficiency, including board-levelI/O, power supplies, and controls, is expected to be 5 to 7 pJ per CMAC operation. Existing correlators for the JVLA (N = 32) and ALMA (N = 64) telescopes achieve about 5000 pJ and 1000 pJ respectively usingapplication-specific ICs in older technologies. To our knowledge, the largest-N existing correlator is LEDA atN = 256; it uses GPUs built in 28 nm technology and achieves about 1000 pJ. Correlators being designed for the SKA telescopes (N = 128 and N = 512) using FPGAs in 16nm technology are predicted to achieve about 100 pJ.

ASIC↗
DOE OSTI2021

PUMIPic: A mesh-based approach to unstructured mesh Particle-In-Cell on GPUs

Unstructured mesh particle-in-cell, PIC, simulations executing on the current and next generation of massively parallel systems require new methods for both the mesh and particles to achieve performance and scalability on GPUs. The traditional approach to implementing PIC simulations defines data structures and algorithms in terms of particles with a full copy of the unstructured mesh on every process. To effectively scale the unstructured mesh and particles, mesh-based PIC uses the unstructured mesh as the predominant data structure with the particles stored in terms of the mesh entities. Here, this paper details the PUMIPic library, a framework for developing efficient and performance-portable mesh-based PIC simulations on GPU systems. A pseudo physics simulation based on a five-dimensional gyro-kinetic code for modeling plasma physics is used to examine the performance of PUMIPic. Scaling studies of the unstructured mesh partition and number of particles are performed up to 4096 nodes of the Summit system at Oak Ridge National Laboratory. The studies show that mesh-based PIC can utilize a partitioned mesh and maintain scaling up to system limitations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Investigating the magnetic and atomic interface configuration for a model Fe/CrN bilayer system

A bilayer of iron on chromium nitride (Fe/CrN) is an interesting system for exchange biasing and sensing applications as the Néel temperature of CrN is 280 K and the Curie temperature of Fe is 1043 K. In this paper, we study the crystal and magnetic structures of the Fe/CrN interface at the atomic level. High quality epitaxial Fe/CrN bilayers prepared by molecular beam epitaxy grow in 001 orientation on MgO(001) substrates with uniform layer thicknesses and sharp interfaces. Our data reveal the epitaxial correlation between Fe and CrN crystals and their magnetic structures at the interface. The magnetic anisotropy directions of Fe and CrN are found parallel to [110] MgO . We studied the electronic and magnetic properties of the interface by performing the first-principles total-energy calculations. Here, we present a model that combines the crystal and magnetic structures of the Fe/CrN bilayer and fully explains all results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1984

Parametric analysis of synthetic aperture radar data acquired over truck garden vegetation

An airborne X-band SAR acquired multipolarization and multiflight pass SAR images over a truck garden vegetation area. Based on a variety of land cover and row crop direction variations, the vertical (VV) polarization data contain the highest contrast, while cross polarization contains the least. When the radar flight path is parallel to the row direction, both horizontal (HH) and VV polarization data contain very high return which masks out the specific land cover that forms the row structure. Cross polarization data are not that sensitive to row orientation. The inclusion of like and cross polarization data help delineate special surface features (e.g., row crop against non-row-oriented land cover, very-rough-surface against highly row-oriented surface).

Wu, S. T.↗
NASA NTRS1992

Optical distributed sensors for feedback control: Characterization of photorefractive resonator

The aim of the project was to explore, define, and assess the possibilities of optical distributed sensing for feedback control. This type of sensor, which may have some impacts in the dynamic control of deformable structures and the monitoring of small displacements, can be divided into data acquisition, data processing, and control design. Analogue optical techniques, because they are noninvasive and afford massive parallelism may play a significant role in the acquisition and the preprocessing of the data for such a sensor. Assessing these possibilities was the aim of the first stage of this project. The scope of the proposed research was limited to: (1) the characterization of photorefractive resonators and the assessment of their possible use as a distributed optical processing element; and (2) the design of a control system utilizing signals from distributed sensors. The results include a numerical and experimental study of the resonator below threshold, an experimental study of the effect of the resonator's transverse confinement on its dynamics above threshold, a numerical study of the resonator above threshold using a modal expansion approach, and the experimental test of this model. A detailed account of each investigation, including methodology and analysis of the results are also included along with reprints of published and submitted papers.

Indebetouw, Guy↗
NASA NTRSDate not supplied

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗
DOE OSTI2019

Vectorization of Random Number Generation and Reproducibility of Concurrent Particle Transport Simulation

Efficient random number generation with high quality statistical properties and exact reproducibility of Monte Carlo simulations are important requirements in many areas of computational science. VecRNG is a package providing pseudo-random number generation (pRNG) in the context of a new library VecMath. This library bundles up several general-purpose mathematical utilities, data structures, and algorithms having both SIMD and SIMT (GPUs) support based on VecCore.~Several state-of-the-art RNG algorithms are implemented as kernels supporting parallel generation of random numbers in scalar, vector, and Cuda workflows. In this report, we will present design considerations, implementation details, and computing performance of parallel pRNG engines on both CPU and GPU. Reproducibility of propagating multiple particles in parallel for HEP event simulation is demonstrated, using GeantV-based examples, for both sequential and fine-grain track-level concurrent simulation wor kflows. Strategies for efficient uses of vectorized pRNG and non-overlapping streams of random number sequences in concurrent computing environments is discussed as well.

Jun, S. Y.↗
DOE OSTI2017

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

On a Simplified Approach to Achieve Parallel Performance and Portability Across CPU and GPU Architectures

This paper presents software advances to easily exploit computer architectures consisting of a multi-core CPU and CPU+GPU to accelerate diverse types of high-performance computing (HPC) applications using a single code implementation. The paper describes and demonstrates the performance of the open-source C++ matrix and array (MATAR) library that uniquely offers: (1) a straightforward syntax for programming productivity, (2) usable data structures for data-oriented programming (DOP) for performance, and (3) a simple interface to the open-source C++ Kokkos library for portability and memory management across CPUs and GPUs. The portability across architectures with a single code implementation is achieved by automatically switching between diverse fine-grained parallelism backends (e.g., CUDA, HIP, OpenMP, pthreads, etc.) at compile time. The MATAR library solves many longstanding challenges associated with easily writing software that can run in parallel on any computer architecture. This work benefits projects seeking to write new C++ codes while also addressing the challenges of quickly making existing Fortran codes performant and portable over modern computer architectures with minimal syntactical changes from Fortran to C++. We demonstrate the feasibility of readily writing new C++ codes and modernizing existing codes with MATAR to be performant, parallel, and portable across diverse computer architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Final Scientific/Technical Report

A variety of calcifying organisms produce a transient or metastable amorphous calcium carbonate (ACC) precursor phase that is assembled and subsequently transformed into a crystalline biomineral, typically calcite or aragonite. The complex shapes, hierarchical structures, and unique physical properties of the biominerals that result from this calcification pathway have stimulated interest in adapting these concepts for the design and creation of bio-inspired functional materials in the laboratory. ACC also forms as a reactive precursor in diverse inorganic systems and is likely to play a much broader role in calcium carbonate formation. Knowledge of the structure, composition, and behavior of this metastable phase is critical for establishing a structural and mechanistic framework for calcium carbonate formation and its role in biogeochemical processes, including carbon cycling. Minor additives, such as magnesium, phosphorus, and organic macromolecules, are known to play important roles in controlling ACC stability, transformation kinetics, and selection of final crystalline polymorph. Molecular water also occurs in many types of ACC and is thought to play a structural role in its stability and transformation behavior. One of the major challenges that remain unresolved is identification of the structural basis for the role of these minor additives and molecular water. The absence of long-range order in ACC, and other amorphous phases, has posed a challenge for study by techniques commonly used for crystalline solids. Preliminary studies in our group show that the combination of two techniques, synchrotron X-ray-based pair distribution function (PDF) analysis and nuclear magnetic resonance (NMR) spectroscopy can provide entirely new insight to structural properties of synthetic ACC over length scales that are most relevant for understanding its transformation properties. Building on preliminary experiments, we propose a systematic study of synthesis, structure, and transformation behavior in abiotic systems. The work will specifically address the influence of phosphate as a minor additive. PDF analysis will utilize total X-ray scattering data collected at synchrotron facilities optimized for this method and will provide direct characterization of the short- and intermediate-range structure of ACC synthesized under controlled conditions. Parallel computational work using reverse Monte Carlo methods will allow structural models to be constructed for a more complete analysis of PDF results. NMR spectroscopy, using a variety of single- and double-resonance techniques, will provide information on H and CO3 components, including dynamical properties, and their relationship to stabilizing additives. PDF and NMR results will be complemented by parallel studies using X-ray absorption and FT-IR spectroscopy to allow direct comparison to previous studies. These techniques will be used to follow the transformation of different ACC samples, with specific additives, to crystalline phases under controlled condition (e.g., relative humidity). This work will provide the structural and mechanistic basis for understanding ACC stability, its transformation behavior, and the factors that govern polymorph selection. This new insight will directly benefit researchers in diverse fields, as well as adding to the framework of knowledge for understanding and controlling calcium carbonate formation in natural and engineered systems.

58 GEOSCIENCES↗
DOE OSTI2018

Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

The SMART MIL-STD-1553 bus adapter hardware manual

The SMART Multiplexer Interface Adapter, (SMIA) a complete system interface for message structure of the MIL-STD-1553, is described. It provides buffering and storage for transmitted and received data and handles all the necessary handshaking to interface between parallel 8-bit data bus and a MIL-STD serial bit stream. The bus adapter is configured as either a bus controller of a remote terminal interface. It is coupled directly to the multiplex bus, or stub coupled through an additional isolation transformer located at the connection point. Fault isolation resistors provide short circuit protection.

Ton, T. T.↗