Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,297 records · Page 72

Molecular architecture of the Chikungunya virus replication complex

To better understand how positive-strand (+) RNA viruses assemble membrane-associated replication complexes (RCs) to synthesize, process, and transport viral RNA in virus-infected cells, we determined both the high-resolution structure of the core RNA replicase of chikungunya virus and the native RC architecture in its cellular context at subnanometer resolution, using in vitro reconstitution and in situ electron cryotomography, respectively. Within the core RNA replicase, the viral polymerase nsP4, which is in complex with nsP2 helicase-protease, sits in the central pore of the membrane-anchored nsP1 RNA-capping ring. The addition of a large cytoplasmic ring next to the C terminus of nsP1 forms the holo-RNA-RC as observed at the neck of spherules formed in virus-infected cells. These results represent a major conceptual advance in elucidating the molecular mechanisms of RNA virus replication and the principles underlying the molecular architecture of RCs, likely to be shared with many pathogenic (+) RNA viruses.

59 BASIC BIOLOGICAL SCIENCES↗

Dynamic molecular architecture of the synaptonemal complex

During meiosis, pairing between homologous chromosomes is stabilized by the assembly of the synaptonemal complex (SC). The SC ensures the formation of crossovers between homologous chromosomes and regulates their distribution. However, how the SC regulates crossover formation remains elusive. We isolated an unusual mutation in Caenorhabditis elegans that disrupts crossover interference but not SC assembly. This mutation alters the unique C terminal domain of an essential SC protein, SYP-4, a likely ortholog of the vertebrate SC protein SIX6OS1. We use three-dimensional stochastic optical reconstruction microscopy (3D-STORM) to interrogate the molecular architecture of the SC from wild-type and mutant C. elegans animals. Using a probabilistic mapping approach to analyze super-resolution image data, we detect changes in the organization of the synaptonemal complex in wild-type animals that coincide with crossover designation. We also found that our syp-4 mutant perturbs SC architecture. Our findings add to growing evidence that the SC is an active material whose molecular organization contributes to chromosome-wide crossover regulation.

59 BASIC BIOLOGICAL SCIENCES↗

Diffusion power spectra as a window into dynamic materials architecture

Chemical recycling of commodity and specialty polymers presents a multifaceted challenge for industrial societies. On one hand, macromolecular architectures must be engineered to yield durable products that, on the other hand, rapidly deconstruct to recyclable monomers under pre-determined conditions. Polymer deconstruction is a chemical process that requires deep understanding of molecular reactivity in heterogeneous media, where porous material architectures evolve in both space and time. To build this understanding, we develop herein experimental and analytical methods describing sets of diffusive eigenmodes that exist within time-varying, non-Euclidean boundary conditions, a situation commonly encountered in the reactive deconstruction of polymers where chain fragments splay, alter their local dynamics, and evolve in their confinement of reacting media. Diffusion power spectra, discerned experimentally by NMR, yield polymer and solvent frequency-domain velocity autocorrelation functions that are analyzed in the context of physical models for chemical reactions parameterized with fractal mathematics. The results connect local motion in polymers to chemical reactivity during acidolysis of circular elastomers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

3D fault architecture controls the dynamism of earthquake swarms

The vibrant evolutionary patterns made by earthquake swarms are incompatible with standard, effectively two-dimensional (2D) models for general fault architecture. Here we leverage advances in earthquake monitoring with a deep-learning algorithm to image a fault zone hosting a 4-year-long swarm in southern California. We infer that fluids are naturally injected into the fault zone from below and diffuse through strike-parallel channels while triggering earthquakes. A permeability barrier initially limits up-dip swarm migration but ultimately is circumvented. This enables fluid migration within a shallower section of the fault with fundamentally different mechanical properties. Our observations provide high-resolution constraints on the processes by which swarms initiate, grow, and arrest. These findings illustrate how swarm evolution is strongly controlled by 3D variations in fault architecture.

58 GEOSCIENCES↗

Top-down design of protein architectures with reinforcement learning

As a result of evolutionary selection, the subunits of naturally occurring protein assemblies often fit together with substantial shape complementarity to generate architectures optimal for function in a manner not achievable by current design approaches. We describe a “top-down” reinforcement learning–based design approach that solves this problem using Monte Carlo tree search to sample protein conformers in the context of an overall architecture and specified functional constraints. Cryo–electron microscopy structures of the designed disk-shaped nanopores and ultracompact icosahedra are very close to the computational models. The icosohedra enable very-high-density display of immunogens and signaling molecules, which potentiates vaccine response and angiogenesis induction. Our approach enables the top-down design of complex protein nanomaterials with desired system properties and demonstrates the power of reinforcement learning in protein design.

Science & Technology - Other Topics↗

Soft syndrome iterative decoding of quantum LDPC codes and hardware architectures

In practical quantum error correction implementations, the measurement of syndrome information is an unreliable step—typically modeled as a binary measurement outcome flipped with some probability. However, the measured syndrome is in fact a discretized value of the continuous voltage or current values obtained in the physical implementation of the syndrome extraction. In this paper, we use this “soft” or analog information to benefit iterative decoders for decoding quantum low-density parity-check (QLDPC) codes. Syndrome-based iterative belief propagation decoders are modified to utilize the soft syndrome to correct both data and syndrome errors simultaneously. We demonstrate the advantages of the proposed scheme not only in terms of comparison of thresholds and logical error rates for quasi-cyclic lifted-product QLDPC code families but also with faster convergence of iterative decoders. Additionally, we derive hardware (FPGA) architectures of these soft syndrome decoders and obtain similar performance in terms of error correction to the ideal models even with reduced precision in the soft information. The total latency of the hardware architectures is about 600 ns (for the QLDPC codes considered) in a 20 nm CMOS process FPGA device, and the area overhead is almost constant—less than 50% compared to min-sum decoders with noisy syndromes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Spatially resolved characterization of optical and recombination losses for different industrial silicon solar cell architectures

In this work, spatially resolved characterization methods are used to identify loss mechanisms for common p -type silicon solar cell architectures, including multicrystalline aluminum back surface field (Al-BSF), monocrystalline Al-BSF, monocrystalline passivated emitter and rear cells (PERC), and bifacial monocrystalline PERC. The characterization methods used in this work include suns-V OC , photoluminescence imaging, and spatially resolved external quantum efficiency and reflectance measurements. The optical and recombination losses are driven by the material properties, cell processing conditions, and device architecture. These losses are quantified and categorized in terms of underlying mechanisms (e.g., front reflectance, escape reflectance, front recombination, and parasitic optical absorption and recombination in the bulk and rear). The ability to create images of these loss parameters can be used to gain more insight into the materials and manufacturing processes used to produce solar cells, and examples are given in this work to illustrate how these images can help reveal the origin of defects.

14 SOLAR ENERGY↗

HACC: extreme scaling and performance across diverse architectures, In: SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Supercomputing is evolving towards hybrid and accelerator-based architectures with millions of cores. The HACC (Hardware/Hybrid Accelerated Cosmology Code) framework exploits this diverse landscape at the largest scales of problem size, obtaining high scalability and sustained performance. Developed to satisfy the science requirements of cosmological surveys, HACC melds particle and grid methods using a novel algorithmic structure that flexibly maps across architectures, including CPU/GPU, multi/many-core, and Blue Gene systems. We demonstrate the success of HACC on two very different machines, the CPU/GPU system Titan and the BG/Q systems Sequoia and Mira, attaining unprecedented levels of scalable performance. We demonstrate strong and weak scaling on Titan, obtaining up to 99.2% parallel efficiency, evolving 1.1 trillion particles. On Sequoia, we reach 13.94 PFlops (69.2% of peak) and 90% parallel efficiency on 1,572,864 cores, with 3.6 trillion particles, the largest cosmological benchmark yet performed. HACC design concepts are applicable to several other supercomputer applications.

Computer Science↗

Parasol: An Architecture for Cross-Cloud Federated Graph Querying

Large scale data fusion of multiple datasets can often provide in- sights that examining datasets individually cannot. However, when these datasets reside in different data centers and cannot be collocated due to technical, administrative, or policy barriers, a unique set of problems arise that hamper querying and data fusion. To ad- dress these problems, a system and architecture named Parasol is presented that enables federated queries over graph databases residing in multiple clouds. Parasol’s design is flexible and requires only minimal assumptions for participant clouds. Query optimization techniques are also described that are compatible with Parasol’s lightweight architecture. Experiments on a prototype implementation of Parasol indicate its suitability for cross-cloud federated graph queries.

Graph database, federated database, data fusion, s↗

Analyzing the suitability of contemporary 3D-stacked PIM architectures for HPC scientific applications

Scaling off-chip bandwidth is challenging due to fundamental limitations, such as a fixed pin count and plateauing signaling rates. Recently, vendors have turned to 2.5D and 3D stacking to closely integrate system components. Interestingly, these technologies can integrate a logic layer under multiple memory dies, enabling computing capability inside a memory stack. This trend in stacking is making PIM architectures commercially viable. In this work, we investigate the suitability of offloading kernels in scientific applications onto 3D stacked PIM architectures. We evaluate several hardware constraints resulted from the stacked structure. We perform extensive simulation experiments and in-depth analysis to quantify the impact of application locality in TLBs, data caches, and memory stacks. Our results also identify design optimization areas in software and hardware for HPC scientific applications.

Peng, Ivy Bo↗

Data and Thread Placement in NUMA Architectures: A Statistical Learning Approach

Nowadays, NUMA architectures are common in compute-intensive systems. Achieving high performance for multi-threaded application requires both a careful placement of threads on computing units and a thorough allocation of data in memory. Finding such a placement is a hard problem to solve, because performance depends on complex interactions in several layers of the memory hierarchy. In this paper we propose a black-box approach to decide if an application execution time can be impacted by the placement of its threads and data, and in such a case, to choose the best placement strategy to adopt. We show that it is possible to reach near-optimal placement policy selection. Furthermore, solutions work across several recent processor architectures and decisions can be taken with a single run of low overhead profiling.

data↗

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗

Architecture-Aware Models of AI Engines for High-Performance Matrix Matrix Multiplication

The AI Engine (AIE) architecture, available in systems from mobile SoCs to server-class FPGAs, aims to efficiently execute AI/ML tasks through a two-dimensional array of compute tiles. Previous work on AIEs has explored different approaches to mapping computation across spatial arrays, but the compute kernel running on each tile has not been the focus. Additionally, the AIE-ML architecture introduces memory tiles and omits programmable logic, requiring new approaches to staging and moving data throughout the array. In this work we update analytical models developed for CPUs to produce the design of high performance kernels while introducing new model considerations such as memory structure, throughput, and latency as required by the AIE hardware. We evaluate our models by developing AIE-ML kernels for matrix multiplication in low-precision data types showing performance up to 95% of compute peak for the kernel when data resides in local memory and above 90% of compute peak when data resides in main memory.

Binder, Elliott D. [Carnegie Mellon University, Pi↗

Architecture-Based Control of Temperature Gradient-Driven Water Transport in Polymer Electrolyte Fuel Cells

Temperature gradients can move water within the porous media of a polymer electrolyte fuel cell through phase-change-induced (PCI) flow. It is critical to understand PCI flow so that control and distribution of water within a fuel cell can be accomplished. This work investigates the role of architecture, specifically anode land width, on overall cell water content and distribution in the through-plane direction. A specially-designed 4.8 cm 2 fuel cell with precise thermal boundary conditions was imaged with neutrons using two different anode flow field configurations. A new, non-dimensional thermal transport number was developed which quantifies the relative influence of PCI flow on cell water transport. It was found that anode lands larger than the cathode lands cause large thermal gradients that instigate net water flux from the cathode to the anode. An asymmetric configuration with larger anode lands was found to have large changes in water content that were strongly sensitive to cell operating conditions. The thermal transport number developed here enables deduction of the net flux condition based on operating conditions and architecture. This approach enables design of high-performance systems with balanced water management.

25 ENERGY STORAGE↗

Robotic Intelligence Kernel: Architecture

The INL Robotic Intelligence Kernel Architecture (RIK-A) is a multi-level architecture that supports a dynamic autonomy structure. The RIK-A is used to coalesce hardware for sensing and action as well as software components for perception, communication, behavior and world modeling into a framework that can be used to create behaviors for humans to interact with the robot.

Few, DougA.↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

MAGMA: Enabling exascale performance with accelerated BLAS and LAPACK for diverse GPU architectures

MAGMA (Matrix Algebra for GPU and Multicore Architectures) is a pivotal open-source library in the landscape of GPU-enabled dense and sparse linear algebra computations. With a repertoire of approximately 750 numerical routines across four precisions, MAGMA is deeply ingrained in the DOE software stack, playing a crucial role in high-performance computing. Notable projects such as ExaConstit, HiOP, MARBL, and STRUMPACK, among others, directly harness the capabilities of MAGMA. In addition, the MAGMA development team has been acknowledged multiple times for contributing to the vendors’ numerical software stacks. Looking back over the time of the Exascale Computing Project (ECP), we highlight how MAGMA has adapted to recent changes in modern HPC systems, especially the growing gap between CPU and GPU compute capabilities, as well as the introduction of low precision arithmetic in modern GPUs. We also describe MAGMA’s direct impact on several ECP projects. Maintaining portable performance across NVIDIA and AMD GPUs, and with current efforts toward supporting Intel GPUs, MAGMA ensures its adaptability and relevance in the ever-evolving landscape of GPU architectures.

97 MATHEMATICS AND COMPUTING↗

Experimental study of airpath electrification in an opposed-piston two stroke (OP2S) engine architecture

The opposed-piston two stroke (OP2S) engine shows potential as an alternative engine architecture to the conventional four stroke engine due to its high-power density, thermal efficiency, and versatile airpath management system. Since the pistons of a two-stroke engine do not pump the air into and out of the cylinder like in a four-stroke engine, the selection of the air induction devices and airpath actuators becomes critical to optimize engine performance. Both the pumping losses and the in-cylinder combustion process can be affected by the scavenging process in a two-stroke engine. Therefore, this study compares two different airpath configurations for the same family of OP2S engines and investigates performance metrics like scavenging control, pumping work, net indicated and brake efficiencies, and engine-out emissions associated with each airpath. Data was collected on a 3.2 L, two-cylinder OP2S engine with an electrically assisted turbocharger (EAT) and a 4.9 L displacement, three-cylinder engine with a variable geometry turbocharger (VGT) and a supercharger. The experiments consisted of speed and load sweeps for both engines at the same operating conditions to compare scavenge control in both architectures. For the three-cylinder layout, the SE sweep range was much higher, and the intake pressure could be independently varied with air flowrate, thus providing more flexibility for scavenging control. The supercharger and the VGT usage was optimized based on its efficiency map and thus, this layout had lower pumping losses compared to the EAT. The two-cylinder engine had a higher overall SE as compared to the three-cylinder engine, but the intake pressure and air flowrate could not be decoupled, leading to over scavenging and increased short circuiting of fresh charge into the exhaust.

Bhatt, Ankur [Clemson University, Clemson, SC, USA↗