Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed memory”

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,477 records · Page 82

Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis

The four-index integral transform is a fundamental and computationally demanding calculation used in many computational chemistry suites such as NWChem. It transforms a four-dimensional tensor from an atomic basis to a molecular basis. This transformation is most efficiently implemented as a sequence of four tensor contractions that each contract a four-dimensional tensor with a two-dimensional transformation matrix. Differing degrees of permutation symmetry in the intermediate and final tensors in the sequence of contractions cause intermediate tensors to be much larger than the final tensor and limit the number of electronic states in the modeled systems. Loop fusion, in conjunction with tiling, can be very effective in reducing the total space requirement, as well as data movement. However, the large number of possible choices for loop fusion and tiling, and data/computation distribution across a parallel system, make it challenging to develop an optimized parallel implementation for the four-index integral transform. We develop a novel approach to address this problem, using lower bounds modeling of data movement complexity. We establish relationships between available aggregate physical memory in a parallel computer system and ineffective fusion configurations, enabling their pruning and consequent identification of effective choices and a characterization of optimality criteria. This work has resulted in the development of a significantly improved implementation of the four-index transform that enables higher performance and the ability to model larger electronic systems than the current implementation in the NWChem quantum chemistry software suite.

Rajbhandari, Samyam↗

Multi-Dimensional Spectral Difference Method for Unstructured Grids

A new, high-order, conservative, and efficient method for conservation laws on unstructured grids is developed. It combines the best features of structured and unstructured grid methods to attain computational efficiency and geometric flexibility; it utilizes the concept of discontinuous and high-order local representations to achieve conservation and high accuracy; and it is based on the finite-difference formulation for simplicity. Universal reconstructions are obtained by distributing unknowns in a geometrically similar manner for all unstructured cells. Placements of the unknown and flux points with various order of accuracy are given for the line, triangular and tetrahedral elements. The data structure of the new method permits an optimum use of cache memory, resulting in further computational efficiency on modern computers. A new pointer system is developed that reduces memory requirements and simplifies programming for any order of accuracy. Numerical solutions are presented and compared with the exact solutions for wave propagation problems in both two and three dimensions to demonstrate the capability of the method. Excellent agreement has been found. The method is simpler and more efficient than previous discontinuous Galerkin and spectral volume methods for unstructured grids.

Liu, Yen↗

Single-Frame Terrain Mapping Software for Robotic Vehicles

This software is a component in an unmanned ground vehicle (UGV) perception system that builds compact, single-frame terrain maps for distribution to other systems, such as a world model or an operator control unit, over a local area network (LAN). Each cell in the map encodes an elevation value, terrain classification, object classification, terrain traversability, terrain roughness, and a confidence value into four bytes of memory. The input to this software component is a range image (from a lidar or stereo vision system), and optionally a terrain classification image and an object classification image, both registered to the range image. The single-frame terrain map generates estimates of the support surface elevation, ground cover elevation, and minimum canopy elevation; generates terrain traversability cost; detects low overhangs and high-density obstacles; and can perform geometry-based terrain classification (ground, ground cover, unknown). A new origin is automatically selected for each single-frame terrain map in global coordinates such that it coincides with the corner of a world map cell. That way, single-frame terrain maps correctly line up with the world map, facilitating the merging of map data into the world map. Instead of using 32 bits to store the floating-point elevation for a map cell, the vehicle elevation is assigned to the map origin elevation and reports the change in elevation (from the origin elevation) in terms of the number of discrete steps. The single-frame terrain map elevation resolution is 2 cm. At that resolution, terrain elevation from 20.5 to 20.5 m (with respect to the vehicle's elevation) is encoded into 11 bits. For each four-byte map cell, bits are assigned to encode elevation, terrain roughness, terrain classification, object classification, terrain traversability cost, and a confidence value. The vehicle s current position and orientation, the map origin, and the map cell resolution are all included in a header for each map. The map is compressed into a vector prior to delivery to another system.

Rankin, Arturo L.↗

Plasticity-induced anisotropy in amorphous solids: The Bauschinger effect

Amorphous solids that underwent a strain in one direction such that they responded in a plastic manner 'remember' that direction also when relaxed back to a state with zero mean stress. We address the question 'what is the order parameter that is responsible for this memory?' and is therefore the reason for the different subsequent responses of the material to strains in different directions. We identify such an order parameter which is readily measurable, we discuss its trajectory along the stress-strain curve, and propose that it and its probability distribution function must form a necessary component of a theory of elastoplasticity.

36 MATERIALS SCIENCE↗

Memory management and compiler support for rapid recovery from failures in computer systems

This paper describes recent developments in the use of memory management and compiler technology to support rapid recovery from failures in computer systems. The techniques described include cache coherence protocols for user transparent checkpointing in multiprocessor systems, compiler-based checkpoint placement, compiler-based code modification for multiple instruction retry, and forward recovery in distributed systems utilizing optimistic execution.

Fuchs, W. K.↗

First-principles study and experimental characterization of metal incorporation in germanium telluride

Germanium telluride is a well-known phase change material (PCM) used in non-volatile memory cells and radio frequency switches. Controlling the properties of GeTe for improved PCM device performance has sometimes been achieved by doping and/or alloying with metals, often at concentrations greater than 10 at. % and using non-equilibrium methods. Here, since switching PCMs between the low-resistance crystalline and high-resistance amorphous states requires a heating cycle, the stability of metal-incorporated GeTe (Ge 0.5–x M x Te 0.5 ) films is also critical to practical implementation of these materials in electronic and optoelectronic devices. In this work, we use both density-functional theory and experimental characterization methods to probe the solubility and critical properties of Ge 0.5–x M x Te 0.5 films. Using first-principles calculations, we determine the enthalpy of formation for GeTe with 2.08, 4.17, and 6.25 at. % of Cu, Fe, Mn, Mo, and Ti and show trends between the stability of the Ge 0.5–x M x Te 0.5 systems and the atomic position, composition, and distribution of the metal atoms in the GeTe matrix.

36 MATERIALS SCIENCE↗

Early-stage reduction of the dendritic complexity in basolateral amygdala of a transgenic mouse model of Alzheimer's disease

Alzheimer's disease is a representative age-related neurodegenerative disease that could result in loss of memory and cognitive deficiency. However, the precise onset time of Alzheimer's disease affecting neuronal circuits and the mechanisms underlying the changes are not clearly known. To address the neuroanatomical changes during the early pathologic developing process, we acquired the neuronal morphological characterization of AD in APP/PS1 double-transgenic mice using the Micro-Optical Sectioning Tomography system. We reconstructed the neurons in 3D datasets with a resolution of 0.32 × 0.32 × 1 μm and used the Sholl method to analyze the anatomical characterization of the dendritic branches. The results showed that, similar to the progressive change in amyloid plaques, the number of dendritic branches were significantly decreased in 9-month-old mice. In addition, a distinct reduction of dendritic complexity occurred in third and fourth-order dendritic branches of 9-month-old mice, while no significant changes were identified in these parameters in 6-month-old mice. At the branch-level, the density distribution of dendritic arbors in the radial direction decreased in the range of 40–90 μm from the neuron soma in 6-month-old mice. These changes in the dendritic complexity suggest that these reductions contribute to the progressive cognitive impairment seen in APP/PS1 mice. This work may yield insights into the early changes in dendritic abnormality and its relevance to dysfunctional mechanisms of learning, memory and emotion in Alzheimer's disease. - Highlights: • Neuron-level, reduction of dendritic complexity in BLA of 9-month-old AD mice. • Specific range of branch decrease in density of 6-month-old AD mice. • 3D imaging with high resolution will provide insights into brain aging.

60 APPLIED LIFE SCIENCES↗

Structural Evolution of Mixed-Addenda Keggin Polyoxometalate Anions with Atom-by-Atom Substitution

Polyoxometalates (POMs) are molecular metal oxides with distinctive electronic properties that make them promising materials for applications in energy, sensors, and memory devices. One of the most promising methods of tuning the stability, photochromic, redox, and electron-spin properties of POMs is through the substitution of the metal “addenda” atoms that, along with oxygen, constitute their cage-like structures. Because traditional synthesis methods typically produce a distribution of POMs, the isolation and characterization of multimetallic POMs with predetermined stoichiometry remains challenging. The presence of multiple energetically accessible isomers further complicates the experimental characterization and theoretical modeling of multimetallic POMs. Herein, we leverage the distinguishing mass-selection capabilities of ion soft landing to prepare stoichiometrically selected Keggin PMo x W 12-x O 40 3- (x = 0 – 6, 8, 10, and 12) POMs on self-assembled monolayer surfaces free of the solvent molecules and counterions that often confound characterization of complex species at interfaces. The structures of the supported POMs are characterized with atom-by-atom precision using in situ infrared (IR) reflection absorption spectroscopy complemented by detailed density functional theory calculations. Our joint experimental and theoretical results reveal an almost linear shift in the positions of the IR bands towards lower wavenumbers with an increase in the number of lighter molybdenum atoms compared to heavier W atoms in PMoxW 12-x O 40 3- . The theoretical calculations also indicate that numerous isomeric structures may be populated at the experimental conditions and, consequently, contribute to the overall IR spectra. In conclusion, our findings indicate that in addition to the number of substituted addenda atoms and the presence of multiple isomeric structures, interactions with the surface play an important role in determining the IR spectra and structure of supported bimetallic POMs.

Prabhakaran, Venkateshkumar [Pacific Northwest Nat↗

Magnetization reversal in magnetic dot arrays: Nearest-neighbor interactions and global configurational anisotropy

Various proposals for future magnetic memories, data processing devices, and sensors rely on a precise control of the magnetization ground state and magnetization reversal process in periodically patterned media. In finite dot arrays, such control is hampered by the magnetostatic interactions between the nanomagnets, leading to the non-uniform magnetization state distributions throughout the sample while reversing. In this paper, we evidence how during reversal typical geometric arrangements of dots in an identical magnetization state appear that originate in the dominance of either Global Configurational Anisotropy or Nearest-Neighbor Magnetostatic interactions, which depends on the fields at which the magnetization reversal sets in. Based on our findings, we propose design rules to obtain the uniform magnetization state distributions throughout the array, and also suggest future research directions to achieve non-uniform state distributions of interest, e.g., when aiming at guiding spin wave edge-modes through dot arrays. Our insights are based on the Magneto-Optical Kerr Effect and Magnetic Force Microscopy measurements as well as the extensive micromagnetic simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed merge trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges. Copyright © 2013 ACM 978-1-4503-1922-5/13/ 02...$15.00.

Morozov, D↗

Dispatch Manager for NEML2 Constitutive Model Calculations Embedded in MOOSE

This report describes the extended capabilities of the NEML2 constitutive modeling library, including a flexible and efficient work dispatching system designed to leverage both CPU and GPU resources. This enhancement addresses one of the primary computational challenges in large-scale simulations: the ability to distribute and execute batches of material model evaluations across heterogeneous computing devices. The new dispatch system introduces a modular set of dispatcher and scheduler classes that coordinate the flow of data and execution between devices. The dispatcher is responsible for efficiently packaging work, managing device-specific memory operations, and synchronizing results. This modularity allows for extensibility, making it straightforward to integrate additional computing backends in the future. From an implementation standpoint, the dispatcher system interfaces seamlessly with NEML2's existing models. They handle device-aware tensor operations, optimize memory transfers, and support asynchronous execution when applicable. This design ensures that batches of material points can be evaluated concurrently, substantially improving throughput compared to previous single-device or serial implementations. These improvements not only enhance the raw performance of NEML2 but also improve its usability in multiscale and high-fidelity simulations, where the simultaneous evaluation of large material point batches is critical. Benchmarks included in the report demonstrate the system’s scalability, highlighting its effectiveness when leveraging modern GPU architectures.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fatigue of graphite/epoxy /0/90/45/-45/s laminates under dual stress levels

A model for the prediction of loading sequence effects on the statistical distribution of fatigue life and residual strength in composite materials is generalized and applied to (0/90/45/-45)s graphite/epoxy laminates. Load sequence effects are found to be caused by both the difference in residual strength when failure occurs (boundary effect) and the effect of previously applied loads (memory effect). The model allows the isolation of these two effects, and the estimation of memory effect magnitudes under dual fatigue loading levels. It is shown that the material memory effect is insignificant, and that correlations between predictions of the number of early failures agree with the verification tests, as do predictions of fatigue life and residual strength degradation under dual stress levels.

Yang, J. N.↗

Comparison of uniform perturbation solutions and numerical solutions for some potential flows past slender bodies

Approximate solutions for potential flow past an axisymmetric slender body and past a thin airfoil are calculated using a uniform perturbation method and then compared with either the exact analytical solution or the solution obtained using a purely numerical method. The perturbation method is based upon a representation of the disturbance flow as the superposition of singularities distributed entirely within the body, while the numerical (panel) method is based upon a distribution of singularities on the surface of the body. It is found that the perturbation method provides very good results for small values of the slenderness ratio and for small angles of attack. Moreover, for comparable accuracy, the perturbation method is simpler to implement, requires less computer memory, and generally uses less computation time than the panel method. In particular, the uniform perturbation method yields good resolution near the regions of the leading and trailing edges where other methods fail or require special attention.

Wong, T. C.↗

Comparison of uniform perturbation and numerical solutions for some potential flows past slender bodies

Approximate solutions for potential flow past an axisymmetric slender body and past a thin airfoil are calculated using a uniform perturbation method and then compared with either the exact analytical solution or the solution obtained using a purely numerical method. The perturbation method is based upon a representation of the disturbance flow as the superposition of singularities distributed entirely within the body, while the numerical (panel) method is based upon a distribution of singularities on the surface of the body. It is found that the perturbation method provides very good results for small values of the slenderness ratio and for small angles of attack. Moreover, for comparable accuracy, the perturbation method is simpler to implement, requires less computer memory, and generally uses less computation time than the panel method. In particular, the uniform perturbation method yields good resolution near the regions of the leading and trailing edges where other methods fail or require special attention.

Wong, T.-C.↗

PCLIPS

CLIPS is an expert system, created specifically to allow rapid implementation of an expert system. CLIPS is written in C, and thus needs a very small amount of memory to run. Parallel CLIPS (PCLIPS) is an extension to CLIPS which is intended to be used in situations where a group of expert systems are expected to run simultaneously and occasionally communicate with each other on an integrated network. PCLIPS is a coarse-grained data distribution system. Its main goal is to take information in one knowledge base and distribute it to other knowledge bases so that all the executing expert systems are able to use that knowledge to solve their disparate problems.

Krolak, Patrick D.↗

Enhancement and Extension of Porosity Model in the FDNS-500 Code to Provide Enhanced Simulations of Rocket Engine Components

In the past, the design of rocket engines has primarily relied on the cold flow/hot fire test, and the empirical correlations developed based on the database from previous designs. However, it is very costly to fabricate and test various hardware designs during the design cycle, whereas the empirical model becomes unreliable in designing the advanced rocket engine where its operating conditions exceed the range of the database. The main goal of the 2nd Generation Reusable Launching Vehicle (GEN-II RLV) is to reduce the cost per payload and to extend the life of the hardware, which poses a great challenge to the rocket engine design. Hence, understanding the flow characteristics in each engine components is thus critical to the engine design. In the last few decades, the methodology of computational fluid dynamics (CFD) has been advanced to be a mature tool of analyzing various engine components. Therefore, it is important for the CFD design tool to be able to properly simulate the hot flow environment near the liquid injector, and thus to accurately predict the heat load to the injector faceplate. However, to date it is still not feasible to conduct CFD simulations of the detailed flowfield with very complicated geometries such as fluid flow and heat transfer in an injector assembly and through a porous plate, which requires gigantic computer memories and power to resolve the detailed geometry. The rigimesh (a sintered metal material), utilized to reduce the heat load to the faceplate, is one of the design concepts for the injector faceplate of the GEN-II RLV. In addition, the injector assembly is designed to distribute propellants into the combustion chamber of the liquid rocket engine. A porosity mode thus becomes a necessity for the CFD code in order to efficiently simulate the flow and heat transfer in these porous media, and maintain good accuracy in describing the flow fields. Currently, the FDNS (Finite Difference Navier-Stakes) code is one of the CFD codes which are most widely used by research engineers at NASA Marshall Space Flight Center (MSFC) to simulate various flow problems related to rocket engines. The objective of this research work during the 10-week summer faculty fellowship program was to 1) debug the framework of the porosity model in the current FDNS code, and 2) validate the porosity model by simulating flows through various porous media such as tube banks and porous plate.

Cheng, Gary↗

Distributed Merge Trees

Improved simulations and sensors are producing datasets whose increasing complexity exhausts our ability to visualize and comprehend them directly. To cope with this problem, we can detect and extract significant features in the data and use them as the basis for subsequent analysis. Topological methods are valuable in this context because they provide robust and general feature definitions. As the growth of serial computational power has stalled, data analysis is becoming increasingly dependent on massively parallel machines. To satisfy the computational demand created by complex datasets, algorithms need to effectively utilize these computer architectures. The main strength of topological methods, their emphasis on global information, turns into an obstacle during parallelization. We present two approaches to alleviate this problem. We develop a distributed representation of the merge tree that avoids computing the global tree on a single processor and lets us parallelize subsequent queries. To account for the increasing number of cores per processor, we develop a new data structure that lets us take advantage of multiple shared-memory cores to parallelize the work on a single node. Finally, we present experiments that illustrate the strengths of our approach as well as help identify future challenges.

97 MATHEMATICS AND COMPUTING↗

A one-time truncate and encode multiresolution stochastic framework

In this work a novel adaptive strategy for stochastic problems, inspired from the classical Harten's framework, is presented. The proposed algorithm allows building, in a very general manner, stochastic numerical schemes starting from a whatever type of deterministic schemes and handling a large class of problems, from unsteady to discontinuous solutions. Its formulations permits to recover the same results concerning the interpolation theory of the classical multiresolution approach, but with an extension to uncertainty quantification problems. The present strategy permits to build numerical scheme with a higher accuracy with respect to other classical uncertainty quantification techniques, but with a strong reduction of the numerical cost and memory requirements. Moreover, the flexibility of the proposed approach allows to employ any kind of probability density function, even discontinuous and time varying, without introducing further complications in the algorithm. The advantages of the present strategy are demonstrated by performing several numerical problems where different forms of uncertainty distributions are taken into account, such as discontinuous and unsteady custom-defined probability density functions. In addition to algebraic and ordinary differential equations, numerical results for the challenging 1D Kraichnan–Orszag are reported in terms of accuracy and convergence. Finally, a two degree-of-freedom aeroelastic model for a subsonic case is presented. Though quite simple, the model allows recovering some physical key aspect, on the fluid/structure interaction, thanks to the quasi-steady aerodynamic approximation employed. The injection of an uncertainty is chosen in order to obtain a complete parameterization of the mass matrix. All the numerical results are compared with respect to classical Monte Carlo solution and with a non-intrusive Polynomial Chaos method.

97 MATHEMATICS AND COMPUTING↗