Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel Architectures”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,423 records · Page 79

Digital tracking loops for a programmable digital modem

In this paper, an analysis and hardware emulation of the tracking loops for a very flexible programmable digital modem (PDM) will be presented. The modem is capable of being programmed for 2, 4, 8, 16-PSK, 16-QAM, MSK, and Offset-QPSK modulation schemes over a range of data rates from 2.34 to 300 Mbps with programmable spectral occupancy from 1.2 to 1.8 times the symbol rate; these operational parameters are executable in burst or continuous mode. All of the critical processing in both the modulator and demodulator is done at baseband with very high-speed digital hardware and memory. Quadrature analog front-ends are used for translation between baseband and the IF center frequency. The modulator is based on a table lookup approach, where precomputed samples are stored in memory and clocked out according to the incoming data pattern. The sample values are predistorted to counteract the effects of the other filtering functions in the link as well as any transmission impairments. The demodulator architecture was adapted from a joint estimator-detector (JED) mathematical analysis. Its structure is applicable to most signalling formats that can be represented in a two-dimensional space. The JED realization uses interdependent, mutually aiding tracking loops with post-detection data feedback. To expedite and provide for more reliable synchronization, initial estimates for these loops are computed in a parallel acquisition processor. The cornerstone of the demodulator realization is the pre-averager received data filter which allows operation over a broad range of data rates without any hardware changes and greatly simplifies the implementation complexity. The emulation results confirmed tracking loop operation over the entire range of operational parameters listed above, as well as the capability of achieving and maintaining synchronization at BER's in excess of 10(exp -1). The emulation results also showed very close agreement with the tracking loop analysis, and validated the resolution apportionment of the various hardware elements in the tracking loops.

Poklemba, John J.↗

On recursive least-squares filtering algorithms and implementations

In many real-time signal processing applications, fast and numerically stable algorithms for solving least-squares problems are necessary and important. In particular, under non-stationary conditions, these algorithms must be able to adapt themselves to reflect the changes in the system and take appropriate adjustments to achieve optimum performances. Among existing algorithms, the QR-decomposition (QRD)-based recursive least-squares (RLS) methods have been shown to be useful and effective for adaptive signal processing. In order to increase the speed of processing and achieve high throughput rate, many algorithms are being vectorized and/or pipelined to facilitate high degrees of parallelism. A time-recursive formulation of RLS filtering employing block QRD will be considered first. Several methods, including a new non-continuous windowing scheme based on selectively rejecting contaminated data, were investigated for adaptive processing. Based on systolic triarrays, many other forms of systolic arrays are shown to be capable of implementing different algorithms. Various updating and downdating systolic algorithms and architectures for RLS filtering are examined and compared in details, which include Householder reflector, Gram-Schmidt procedure, and Givens rotation. A unified approach encompassing existing square-root-free algorithms is also proposed. For the sinusoidal spectrum estimation problem, a judicious method of separating the noise from the signal is of great interest. Various truncated QR methods are proposed for this purpose and compared to the truncated SVD method. Computer simulations provided for detailed comparisons show the effectiveness of these methods. This thesis deals with fundamental issues of numerical stability, computational efficiency, adaptivity, and VLSI implementation for the RLS filtering problems. In all, various new and modified algorithms and architectures are proposed and analyzed; the significance of any of the new method depends crucially on specific application.

Hsieh, Shih-Fu↗

Mechanical Properties of Triaxial Braided Carbon/Epoxy Composites

In an on-going effort to increase the safety and efficiency of turbine engines, the National Aeronautics and Space Administration is exploring lightweight alternatives to the metal containment structures that currently encase commercial jet engines. Epoxy reinforced with braided carbon fibers is a candidate structural material which may be suitable for an engine case. This paper reports flat-coupon mechanical-property experiments performed to compliment previously reported subcomponent impact testing and analytical simulation of containment structures. Triaxial-braid T700/5208 epoxy and triaxial-braid T700/M36 toughened epoxy composites were evaluated. Also, two triaxial-braid architectures (0 +/- 60 deg., 0 +/- 45 deg.) with the M36 resin were evaluated through tension, compression, and shear testing. Tensile behavior was compared between standard straight-sided specimens (ASTM D3039) and bowtie specimens. Both double-notch shear (ASTM D3846) and Iosepescu (ASTM D5379) tests were performed as well. The M36/0 +/- 45 deg. configuration yield the best response when measurements were made parallel to the axial tows. Conversely, the M36/0 +/- 60 deg. configuration was best when measurements were made perpendicular to the axial tows. The results were used to identify critical properties and to augment the analysis of impact experiments.

Bowman, C. L.↗

A Versatile Simulation Framework for Elastodynamic Modeling of Structural Health Monitoring

Structural health monitoring (SHM) has the capacity to reduce failure by detecting damage during service life, by periodic, automated monitoring. Guided Wave (GW) Ultrasound is a common SHM approach for aerospace structures. Modelling the physics of GW SHM systems provides a route for understanding system dependencies, capabilities and limitations as damage evolves during service life. Such a toolset can strengthen the understanding of the connection between GW SHM results and the true material state. The most useful modelling tools are those that provide versatile solutions with respect to the simulated component geometry and computational grid connectivity. This work details a versatile application programming interface (API) for the elastodynamic finite integration technique for modelling GW SHM of metals. The custom code implementation, EFIT-CompCell, allows for the modelling of diverse geometries by automatically balancing the message passing interface parallelization layout. The user provides the basic parameters of the simulation and the software automatically performs an initial balancing based on anticipated computational loads, and establishes the CPU communication patterns for any geometry. This work describes the programming philosophy and code structure used to create EFIT-CompCell and compares its performance and capacity to simulation tools that are more specialized for specific architectures. Results are presented for a simulation of GW SHM of an aluminum fuselage section being tested by the FAA. The simulation consists of 733M voxels which took approximately 70 hours to complete 25000 time steps using 40 Intel Xeon E5-4650v2 Ivy Bridge processor cores.

Gregory, Elizabeth D.↗

mpi-sppy: Optimization Under Uncertainty for Pyomo

We introduce a new Pyomo extension for optimization under uncertainty, mpi-sppy. This extension allows for the mixing of, and sharing of information between, various algorithmic approaches for optimization under uncertainty. We will discuss the underlying architecture and assess the performance and scalability of mpi-sppy on various systems, including HPC clusters.

27 ARPA - Advanced Research Projects Agency-Energy↗

Multirate partitioned Runge–Kutta methods for coupled Navier–Stokes equations

Earth system models are complex integrated models of atmosphere, ocean, sea ice, and land surface. Coupling the components can be a significant challenge due to the difference in physics, temporal, and spatial scales. Further, this study explores multirate partitioned Runge-Kutta methods for the fluid-fluid interaction problem and demonstrates its parallel performance by using the PETSc library. We consider compressible Navier-Stokes equations with gravity coupled through a rigid-lid interface. Our large-scale numerical experiments reveal that multirate partitioned Runge-Kutta coupling schemes (1) can conserve total mass; (2) have second-order accuracy in time; and (3) provide favorable strong- and weak-scaling performance on modern computing architectures. We also show that the speedup factors of multirate partitioned Runge-Kutta methods match theoretical expectations over their base (single-rate) method.

54 ENVIRONMENTAL SCIENCES↗

WPGNN and PLayGen (Wind Plant Graph Neural Network and Plant Layout Generator) [SWR-21-90]

WPGNN is the graph neural network machine learning based surrogate model and software that provides a streamlined approximation of wind plant wake models. It can rapidly estimate the energy production of the plant and turbines for any arbitrarily sized wind plant and layout under any inflow condition. Associated tools include graphing and visualization capabilities as well as a wind plant generator capable of creating randomized realizations of canonical wind plant layouts. The WPGNN architecture and application is extendable to multiple wake models, turbine technologies and features, and supports downstream optimizations of wind plant layouts and control strategies. In addition to the WPGNN, we include the code for the plant layout generator (PLayGen) playgen.py. This generator can produce random realizations of realistic wind plant layouts from one of the four canonical styles: cluster, single string, multiple string, or parallel string. The PLayGen_demo.ipynb notebook provides a demonstration of how to use the generator tool.

Harrison-Atlas, Dylan↗

Use cases of lossy compression for floating-point data in scientific data sets

Architectural and technological trends of systems used for scientific computing call for a significant reduction of scientific data sets that are composed mainly of floating-point data. Here, this article surveys and presents experimental results of currently identified use cases of generic lossy compression to address the different limitations of scientific computing systems. The article shows from a collection of experiments run on parallel systems of a leadership facility that lossy data compression not only can reduce the footprint of scientific data sets on storage but also can reduce I/O and checkpoint/restart times, accelerate computation, and even allow significantly larger problems to be run than without lossy compression. In conclusion, these results suggest that lossy compression will become an important technology in many aspects of high performance scientific computing. Because the constraints for each use case are different and often conflicting, this collection of results also indicates the need for more specialization of the compression pipelines.

97 MATHEMATICS AND COMPUTING↗

Exascale models of stellar explosions: Quintessential multi-physics simulation

The ExaStar project aims to deliver an efficient, versatile, and portable software ecosystem for multi-physics astrophysics simulations run on exascale machines. The code suite is a component-based multi-physics toolkit, built on the capabilities of current simulation codes (in particular Flash-X and Castro), and based on the massively parallel adaptive mesh refinement framework AMReX. It includes modules for hydrodynamics, advanced radiation transport, thermonuclear kinetics, and nuclear microphysics. The code will reach exascale efficiency by building upon current multi- and many-core packages integrated into an orchestration system that uses a combination of configuration tools, code translators, and a domain-specific asynchronous runtime to manage performance across a range of platform architectures. The target science includes multi-physics simulations of astrophysical explosions (such as supernovae and neutron star mergers) to understand the cosmic origin of the elements and the fundamental physics of matter and neutrinos under extreme conditions.

79 ASTRONOMY AND ASTROPHYSICS↗

Heterogeneous Computing

To leverage the increasing heterogeneity in modern computing resources, Geant4 incorporates advanced software tools and a task-based framework (G4Tasking) that enables efficient parallelism at event, sub-event, and track levels. Ongoing R&D efforts focus on integrating GPUs into high-energy physics (HEP) simulations, including optical photon simulation with Opticks/NVIDIA OptiX, offloading electromagnetic particle transport using G4HepEM/AdePT and Celeritas, and employing advanced surface-based geometry models such as VecGeom2.0 and ORANGE. As Geant4 continues evolving toward high-performance computing (HPC) and heterogeneous architectures, it remains a key tool for large-scale simulations in HEP and beyond.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

HEP - A semaphore-synchronized multiprocessor with central control

The paper describes the design concept of the Heterogeneous Element Processor (HEP), a system tailored to the special needs of scientific simulation. In order to achieve high-speed computation required by simulation, HEP features a hierarchy of processes executing in parallel on a number of processors, with synchronization being largely accomplished by hardware. A full-empty-reserve scheme of synchronization is realized by zero-one-valued hardware semaphores. A typical system has, besides the control computer and the scheduler, an algebraic module, a memory module, a first-in first-out (FIFO) module, an integrator module, and an I/O module. The architecture of the scheduler and the algebraic module is examined in detail.

Gilliland, M. C.↗

A Scheme to Improve Throughput for ARQ-Protected Satellite Communication

Automatic-repeat-request (ARQ) error control is often employed to assure high fidelity information transmission. However, ARQ error control can provide poor throughput for satellite multicasting. The throughput in such communication may be improved by the combination of a terrestrial network parallel to the satellite network and a judiciously modified ARQ protocol. In particular, retransmitted ARQ frames can be sent terrestrially in such a hybrid network, allowing higher throughput than in a pure-satellite network. This work presents analytic results to establish the potential for improving the throughput of satellite multicast communication employing ARQ error control by the adoption of such a hybrid network architecture.

Friedman, Daniel↗

Runtime Thread-Block Optimization for Custom Multistream CUDA Kernels for the Glenn Research Center Communication Analysis Suite

In preparation of the return of humans to the Moon with the coming Artemis missions, NASA scientists must evaluate proposed landing site locations for terrain and communications viability. The Glenn Research Center Communication Analysis Suite (GCAS) combines sophisticated communication network models with accurate lunar terrain to access sites across the Moon’s south pole. Given the importance of proper site selection to crew safety and mission success, many locations need to be analyzed resulting in a large computational load needing to be performed. To meet the growing project demands, development has begun to improve the runtime efficiency of GCAS with GPU parallelization by way of multi-stream CUDA kernels. One of the most prominent factors in kernel optimization is the proper selection of thread-block dimensions in order to maximize the concurrent operation on the device. Typically, thread-block dimensions are optimized by hand requiring many stages of benchmarking and iteration. Additionally, given the main conditions to optimization are the physical GPU architecture and problem size, these optimal dimensions are non-portable and fragile in their scope. As such, a novel optimization routine was developed to generate the optimal thread-block dimensions during runtime with considerations to hardware specifications and problem size resolving the issues of portability and enabling the function of more dynamic routines.

Aden Bergstresser↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

Promotion of CaCO 3 Nucleation by Carboxyl- and Amine-Terminated Peptoid Nanotubes

The use of surfaces to promote heterogeneous nucleation of CaCO 3 has been extensively studied to better understand natural processes of biomineralization, to develop bioinspired approaches for synthesizing composite materials with diverse functionalities, and as a route toward accelerating CO 2 mineralization. Peptoids have emerged as a material of particular interest, because they offer tunable side chain chemistry while maintaining a constant long-range self-assembled architecture. Here, in this work, we investigate the ability of films of self-assembled -NH 2 and −COOH terminated peptoid nanotubes to promote the nucleation of CaCO 3 . Using a combination of atomic force, scanning electron, and optical microscopy, we find that interwoven films of nanotubes formed from peptoids with -NH 2 side chains promote the preferential formation of vaterite with the (001) plane parallel to the film and exhibit a lower interfacial energy than that reported for inorganic surfaces. In contrast, the film of −COOH-functionalized peptoid nanotubes is a much stronger promoter, giving a particle density 5 orders of magnitude larger than for the -NH 2 terminated peptoid nanotubes and enabling complete coverage of individual peptoid tubes with CaCO 3 nanoparticles that results in a composite material with a 50-fold increase in Young’s modulus. Thus, interwoven films of peptoid nanotubes provide a useful platform for investigating the impact of specific chemical groups on nucleation and offer potential application to accelerated mineralization of CO 2 for removal from the environment or modulation of mineralogy and properties of carbonate-based building materials.

carbon nanotubes↗

Design, Control, and Protection of a 13.2 kV, 1 MVA Solid State Transformer for Electric Vehicle Extreme Fast Charging Station

In this article, a medium-voltage (MV) ac-dc solid state transformer (SST) for electric vehicle (EV) extreme fast charging (XFC) station is proposed. The SST adopts a cascaded H-bridge (CHB)-based structure where the active front end (AFE) power stages are connected in input-series followed by dual active bridge (DAB) converters connected in an output-parallel configuration providing galvanic isolation through a high-frequency transformer (HFT). The SST is rated for 1 MVA and connects directly to a three-phase 13.2 kV MV ac grid through ac switchgear and outputs 750-V dc. At the dc bus, several dc/dc converters are connected, each of which can charge an EV based on its battery capacity. A novel decentralized control architecture of the SST is adopted in this work which simplifies the MV dc link voltage and module-level power balancing. In addition, the local and central protection designs of the SST are presented which identify and respond to the internal fault of the system. Finally, the experimental validations of the SST hardware prototype are presented up to the rated voltage. Furthermore, this article details the design and implementation of the MV SST addressing the challenges of an isolated MV class power converter for connecting directly to the MV ac grid with unique controller architecture, distributed protection framework, and SST constructional features.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Molecular Reaction Imaging of a Surface Recombination Process Explains Performance Variation Among Smooth MoS 2 Photoelectrodes

Transition metal dichalcogenides (TMD) such as WSe 2 and MoS 2 are highly efficient and stable light absorbers in TMD∣I − ,I 3 − ∣Pt liquid junction solar cells. It is generally accepted that TMD crystals with a large fraction of exposed edge sites exhibit lower power conversion efficiencies (PCEs) than apparently smooth crystals. However, one open question is why does the PCE vary significantly from one crystal to another? Answering this critical question could lead to robust syntheses for high quality and uniform TMD samples. In this work, we apply nanoscale photoelectrochemical microscopy techniques to study n-type TMD nanoflake∣I − ,I 3 − ∣Pt cells. Using a combination of near-diffraction-limited photocurrent mapping and molecular reaction imaging techniques, we reveal a previously hidden surface recombination process: photogenerated holes in hidden p-type domains travel micron-scale distances parallel to the solid/liquid interface and preferentially react with iodide at step-edges. The overall efficiency of the nanoflake, as evidenced from whole nanoflake-level photoelectrochemical measurements, is dictated by the size, efficiency, and location of n- and p-type domains. Furthermore, these results provide a unifying view of efficiency losses in smooth TMD photoelectrodes and open the possibility to design electrode architectures that leverage the long-range lateral charge transport property for photoelectrocatalysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Advancement of hybrid fluid-kinetic modeling for HEDP and ICF science

We report on the development progress of a hybrid fluid-kinetic code for simulating fluids and plasmas in a wide range of environments, such as laser–matter interactions, inertial confinement fusion, magnetic confinement fusion, and pulsed power. The suite of numerical tools under development utilizes heterogeneous computer architectures and leverages the benefits of particle–based simulation techniques. By working to combine the kinetic particle-in-cell (PIC) model with a particle-based fluid simulation technique, such as smoothed particle hydrodynamics, we are developing a flexible framework capable of accurately modeling complex flows within and between kinetic and fluid regimes. The TriForce code is under development as a C++ framework for parallel, 3D, particle-based, hybrid fluid-kinetic plasma simulations. The fluid half of TriForce will be based upon the meshless smoothed-particle-hydrodynamics (SPH) approach, well-suited for shear, mixing, and turbulence, whereas the kinetic half resembles a traditional particle-in-cell (PIC) code; other particle-based approaches to fluid modeling that do use a mesh are also possible to use and are under investigation. Maxwell’s electromagnetic field equations are solved either via explicit or implicit algorithms or approximated via resistive magnetohydrodynamics (MHD) using an Ohm’s law and resulting induction equation (extended MHD is under development). A primary goal of enabling direct comparisons, from the same code, between results from the variants of MHD and implicit electromagnetic solutions is to improve our fundamental understanding of systems with magnetic fields. The code is under development to recover results from both radiation-MHD and fully kinetic codes in those limits, and is continuing to be developed from other follow-on grants to operate in between where both descriptions may co-exist and interact. For certain applications, it is desired for a simulation to contain fluid ions and electrons as well as kinetic ions and electrons. Typically, it is too computationally intensive to model a full-scale ICF or HEDP experiment fully kinetically since many cycles are expended with very small time steps on modeling the fluid part of a material that is well treated by the fluid approximation. In this case, many traditional PIC particles can be replaced with a single fluid particle representing the thermal part of the distribution function, and there are fewer needed kinetic particles, which describe the non-thermal part and can be sub-cycled relative to the fluid particle advance. Furthermore, a pure fluid code may, depending on the problem, simply lack many physically important details that are beyond the scope of its reduced approximations and assumptions. In this report, we summarize the objectives achieved in the development of the collisional and kinetic half of the code, and the physics problems to which the code has been applied in the areas of advanced and innovative fusion concepts, pulsed power, and magneto-inertial fusion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗