Search NASA⌕ Search

SEARCH · Search NASA

Results for “Memory Formation”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Analog In-Memory Computing for the Synthetic Aperture Radar Polar Format Algorithm

As the utility of synthetic aperture radar (SAR) systems increases in autonomous vehicles, satellites, and other power- and space-constrained edge applications, there is a growing need for processors that can form SAR images at low power. In recent years, analog in-memory compute (AIMC) has shown immense promise for accelerating neural networks and other matrix-vector multiplication (MVM) heavy workloads at the edge. Here, in this work, we examine how the polar format algorithm (PFA), a popular SAR image formation algorithm, can be mapped to these AIMC systems. The PFA maps readily onto analog MVMs because it primarily consists of two linear operations: interpolation of frequency-domain data to a Cartesian grid, followed by a 2-D Fourier transform. This work presents two approaches to map the interpolation operation onto MVMs in analog hardware: a chirp transform and a modified form of sinc interpolation. These mappings introduce algorithmic errors, and their effect on the quality of SAR image formation is examined, both quantitatively and qualitatively. In addition, the impact of errors introduced by the analog hardware is explored to determine which approach is optimal under varying assumptions about the underlying analog memory devices and circuits.

Analog computing↗
DOE OSTI2020

From a conventional ferromagnetism to a frustrated magnetism: An unexpected role of Fe in Nd(Al 1-x Fe x ) 2 (x ≤ 0.2)

The structure and magnetic properties of Nd(Al 1-x Fe x ) 2 alloys with x = 0, 0.05, 0.1 and 0.2, which adopt cubic MgCu 2 -type structure with space group Fd3¯m, are studied using x-ray powder diffraction, static and dynamic magnetization, and calorimetric measurements. The lattice constant decreases linearly with increasing Fe content from 8.0106(4) Å to 7.9044(4) Å. Large thermal irreversibilities between zero-field-cooled and field-cooled conditions are observed for all substituted samples. Here, the magnetic transition temperatures exhibit a minimum for x = 0.1, and coercive fields at 2 K increase from 70 Oe for x = 0 to 6.3 kOe for x = 0.2. The absence of λ-type peak in the heat capacity data, frequency dependence of ac magnetic susceptibility, and memory effects indicate formation of a cluster-glass magnetic state when x ≥ 0.1.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Speeding up and reducing memory usage for scientific machine learning via mixed precision

Scientific machine learning (SciML) has emerged as a versatile approach to address complex computational science and engineering problems. Within this field, physics-informed neural networks (PINNs) and deep operator networks (DeepONets) stand out as the leading techniques for solving partial differential equations by incorporating both physical equations and experimental data. However, training PINNs and DeepONets require significant computational resources, including long computational times and large amounts of memory. In search of computational efficiency, training neural networks using half precision (float16) rather than the conventional single (float32) or double (float64) precision has gained substantial interest, given the inherent benefits of reduced computational time and memory consumed. However, we find that float16 cannot be applied to SciML methods, because of gradient divergence at the start of training, weight updates going to zero, and the inability to converge to a local minima. To overcome these limitations, we explore mixed precision, which is an approach that combines the float16 and float32 numerical formats to reduce memory usage and increase computational speed. Our experiments showcase that mixed precision training not only substantially decreases training times and memory demands but also maintains model accuracy. Here, we also reinforce our empirical observations with a theoretical analysis. The research has broad implications for SciML in various computational applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The SONATA data format for efficient description of large-scale network models

Increasing availability of comprehensive experimental datasets and of high-performance computing resources are driving rapid growth in scale, complexity, and biological realism of computational models in neuroscience. To support construction and simulation, as well as sharing of such large-scale models, a broadly applicable, flexible, and high-performance data format is necessary. To address this need, we have developed the Scalable Open Network Architecture TemplAte (SONATA) data format. It is designed for memory and computational efficiency and works across multiple platforms. The format represents neuronal circuits and simulation inputs and outputs via standardized files and provides much flexibility for adding new conventions or extensions. SONATA is used in multiple modeling and visualization tools, and we also provide reference Application Programming Interfaces and model examples to catalyze further adoption. SONATA format is free and open for the community to use and build upon with the goal of enabling efficient model building, sharing, and reproducibility.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

The separate effect of halo mass and stellar mass on the evolution of massive disc galaxies

ABSTRACT We analyse a sample of massive disc galaxies selected from the fourth-generation Sloan Digital Sky Survey/Mapping Nearby Galaxies at Apache Point Observatory survey to investigate how the evolution of these galaxies depends on their stellar and halo masses. We applied a semi-analytic spectral fitting approach to the data from different regions in the galaxies to derive several of their key physical properties. From the best-fitting model results, together with direct observables such as morphology, colour, and the Mgb/〈Fe〉 index ratio measured within 1Re, we find that for central galaxies both their stellar and halo masses have a significant influence in their evolution. For a given halo mass, galaxies with higher stellar mass accumulate their stellar mass and become chemically enriched earlier than those with smaller stellar mass. Furthermore, at a given stellar mass, galaxies living in more massive haloes have longer star formation time-scales and are delayed in becoming chemically enriched. In contrast, the evolution of massive satellite galaxies is mostly determined by their stellar mass. The results indicate that both the assembled halo mass and the halo assembly history impact the evolution of central galaxies. Our spatially resolved analysis indicates that only the galaxy properties in the central region (0.0–0.5Re) show the dependencies described above. This fact supports a halo-driven formation scenario since the galaxies’ central regions are more likely to contain old stars formed along with the halo itself, keeping a memory of the halo formation process.

Zhou, Shuang (ORCID:0000000289996814)↗
DOE OSTI2022

GrainNN: A neighbor-aware long short-term memory network for predicting microstructure evolution during polycrystalline grain formation

High fidelity simulations of grain formation in alloys are an indispensable tool for process-to-mechanical-properties characterization. Such simulations, however, can be computationally expensive as they require fine spatial and temporal discretizations. Their cost becomes an obstacle to parametric studies and ensemble runs and ultimately makes downstream tasks like optimal control and uncertainty quantification challenging. To enable such downstream tasks, we introduce GrainNN, an efficient and accurate reduced-order model for epitaxial grain growth in additive manufacturing conditions. GrainNN is a sequence-to-sequence long-short-term-memory (LSTM) deep neural network that evolves the dynamics of manually crafted features. Its innovations are (1) an attention mechanism with grain-microstructure-specific transformer architecture; and (2) an overlapping combination of several clones of the network to generalize to grain configurations that are different from those used for training. This design enables GrainNN to predict grain formation for unseen physical parameters, grain number, domain size and geometry. Furthermore, GrainNN not only reconstructs the quantities of interest but also can be pointwise accurate. In our numerical experiments, we use a polycrystalline phase field method to both generate the training data and assess GrainNN. For multiparametric, ensemble simulations with many grains, GrainNN can be orders of magnitude faster than phase field simulations, while delivering 5%–15% pointwise error. Additionally, this speedup includes the cost of the phase field simulations for generating training data.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Roadmap on emerging concepts in the physical biology of bacterial biofilms: from surface sensing to community formation

Abstract Bacterial biofilms are communities of bacteria that exist as aggregates that can adhere to surfaces or be free-standing. This complex, social mode of cellular organization is fundamental to the physiology of microbes and often exhibits surprising behavior. Bacterial biofilms are more than the sum of their parts: single-cell behavior has a complex relation to collective community behavior, in a manner perhaps cognate to the complex relation between atomic physics and condensed matter physics. Biofilm microbiology is a relatively young field by biology standards, but it has already attracted intense attention from physicists. Sometimes, this attention takes the form of seeing biofilms as inspiration for new physics. In this roadmap, we highlight the work of those who have taken the opposite strategy: we highlight the work of physicists and physical scientists who use physics to engage fundamental concepts in bacterial biofilm microbiology, including adhesion, sensing, motility, signaling, memory, energy flow, community formation and cooperativity. These contributions are juxtaposed with microbiologists who have made recent important discoveries on bacterial biofilms using state-of-the-art physical methods. The contributions to this roadmap exemplify how well physics and biology can be combined to achieve a new synthesis, rather than just a division of labor.

Wong, Gerard C. L. (ORCID:0000000308936383)↗
DOE OSTI2024

Detection of the large-scale tidal field with galaxy multiplet alignment in the DESI Y1 spectroscopic survey

We explore correlations between the orientations of small galaxy groups, or ‘multiplets’, and the large-scale gravitational tidal field. Using data from the Dark Energy Spectroscopic Instrument (DESI) Y1 survey, we detect the intrinsic alignment (IA) of multiplets to the galaxy-traced matter field out to separations of $100\,h^{-1}$ Mpc. Unlike traditional IA measurements of individual galaxies, this estimator is not limited by imaging of galaxy shapes and allows for direct IA detection beyond redshift $z=1$. Multiplet alignment is a form of higher order clustering, for which the scale-dependence traces the underlying tidal field and amplitude is a result of small-scale ($\lt 1h^{-1}$ Mpc) dynamics. Within samples of bright galaxies, luminous red galaxies (LRG) and emission-line galaxies, we find similar scale-dependence regardless of intrinsic luminosity or colour. This is promising for measuring tidal alignment in galaxy samples that typically display no IA. DESI’s LRG mock galaxy catalogues created from the A BACUS S UMMIT N -body simulations produce a similar alignment signal, though with a 33 per cent lower amplitude at all scales. An analytic model using a non-linear power spectrum (NLA) only matches the signal down to 20 $h^{-1}$ Mpc. Our detection demonstrates that galaxy clustering in the non-linear regime of structure formation preserves an interpretable memory of the large-scale tidal field. Multiplet alignment complements traditional two-point measurements by retaining directional information imprinted by tidal forces, and contains additional line-of-sight information compared to weak lensing. This is a more effective estimator than the alignment of individual galaxies in dense, blue, or faint galaxy samples.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

CORE-BFS: Communication-Optimized REctangular-partitioned BFS Achieving 160.845 TeraTEPS on Frontier Supercomputer

Distributed Breadth-First Search (BFS) is fundamental to many large-scale graph applications, but its performance on parallel systems is often limited by high communication overhead. This paper presents CORE-BFS, an extremely scalable GPU-based BFS implementation that introduces a unique rectangular 2D partitioning-based design for Frontier supercomputer. To further improve performance, we propose four key optimizations: (1) Rectangular 2D-partition specific data formats that use two compressed row and one compressed column status array bitmaps combined with a Double Compressed Sparse Row (DCSR) format per partition, reducing memory footprint and inter-rank traffic; (2) Adaptive frontier & communication strategy that unifies top-down and bottom-up traversal on the rectangular layout, uses lazy synchronization in top-down levels, and switches variants based on frontier size to minimize communication overhead; (3) Frontier-split degree-aware update that maps frontier vertices to thread-centric, wavefront-centric, and block-centric kernels based on their degree to improve GPU utilization and memory coalescing; (4) Row-reduction pipeline that overlaps bottom-up adjacency list processing with row-wise bitmap reduction to hide inter-rank latency. Together, these techniques increase parallelism while reducing memory and communication overhead. On the Graph500 benchmark, CORE - BFS scales up to 9,248 Frontier nodes with scale-42 graphs and reaches 160.845 TTEPS, delivering a 5.42 × speedup over our previous Frontier implementation.

Yang, Haoshen [Rutgers University]↗
DOE OSTI2020

Greggd

greg(g)d - Global runtime for eBPF-enabled gathering (w/ gumption) daemon Recently the linux kernel has added support for low-level kernel monitoring and profiling through a in-kernel virtual machine. The tooling around these new features (the extended Berkley Packet Filter or eBPF for short) is not mature and is difficult to use. Benefits from eBPF are especially hard to realize while trying to do large scale deployments and integrate with existing metric analysis stacks. A tool was needed to enable loading and collecting data from eBPF programs on large scale HPC systems. Given the problems above it was obvious we needed some wrapper program to compile, load, and collect data from eBPF programs running in the kernel. This tool needed to be lightweight without a heavy set of dependencies, relatively stable between different kernel versions, and integrate nicely with existing widely used metric collection tools. We wrote a program that wraps the eBPF tooling and sends data to our metric gathering tool. eBPF programs are either compiled using the host compiler stack, or loaded in the kernel directly from an object file. These programs are then attached to the system calls that we want to profile. Whenever these system calls are run, the eBPF program collects information of interest and writes that to memory. Our wrapper program polls these memory locations, reads and formats the data, then sends the information to a local unix socket. Our other monitoring tools are configured to read from that socket and send it to the rest of our metric monitoring stack for analysis.

Voss, Joseph [Oak Ridge National Lab. (ORNL), Oak ↗
DOE OSTI2024

Formation and retrieval of cell assemblies in a biologically realistic spiking neural network model of area CA3 in the mouse hippocampus

The hippocampal formation is critical for episodic memory, with area Cornu Ammonis 3 (CA3) a necessary substrate for auto-associative pattern completion. Recent theoretical and experimental evidence suggests that the formation and retrieval of cell assemblies enable these functions. Yet, how cell assemblies are formed and retrieved in a full-scale spiking neural network (SNN) of CA3 that incorporates the observed diversity of neurons and connections within this circuit is not well understood. Here, we demonstrate that a data-driven SNN model quantitatively reflecting the neuron type-specific population sizes, intrinsic electrophysiology, connectivity statistics, synaptic signaling, and long-term plasticity of the mouse CA3 is capable of robust auto-association and pattern completion via cell assemblies. Our results show that a broad range of assembly sizes could successfully and systematically retrieve patterns from heavily incomplete or corrupted cues after a limited number of presentations. Furthermore, performance was robust with respect to partial overlap of assemblies through shared cells, substantially enhancing memory capacity. These novel findings provide computational evidence that the specific biological properties of the CA3 circuit produce an effective neural substrate for associative learning in the mammalian brain.

hetero-association↗
DOE OSTI2023

Distinguishing erbium dopants in Y 2 O 3 by site symmetry: Ab initio theory of two spin-photon interfaces

Here, we present a first-principles study of the defect formation and electronic structure of erbium (Er)–doped yttria (Y 2 O 3 ). This is an emerging material for spin-photon interfaces in quantum information science due to the narrow-linewidth optical emission from Er dopants at standard telecommunication wavelengths and their potential for quantum memories and transducers. We calculate formation energies of neutral and negatively and positively charged Er dopants and find the charge-neutral configuration to be the most stable, consistent with experiment. Of the two substitutional sites of Er for Y, the C 2 (more relevant for quantum memories) and C 3i (more relevant for quantum transduction), we identify the former as possessing the lowest formation energy. The electronic properties are calculated using the Perdew-Burke-Ernzerhof functional along with the Hubbard U parameter and spin-orbit coupling, which yields a ~ 6 μ B orbital and a ~ 3 μ B spin magnetic moment, and 11 electrons in the Er 4 f shell, confirming the formation of charge-neutral Er 3+ . This standard density functional theory approach underestimates the band gap of the host and lacks a first-principles justification for U . To overcome these issues we performed screened hybrid functional calculations, including a negative U for the 4 f orbitals, with mixing (α) and screening (w) parameters. These produced robust electronic features with slight modifications in the band gap and the 4 f splittings depending on the choice of tuning parameters. We also computed the many-particle electronic excitation energies and compared them with experimental values from photoluminescence.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Technical Report: Accessor Realization

As we have seen the arithmetic power of hardware architectures growing much faster than the memory bandwidth, there is an urgent need to rethink the way we operate, communicate, and store data. A promising strategy for overcoming the “memory wall” is the decoupling of memory precision from arithmetic precision as proposed in Anzt et al.. Such a decoupling of memory precision and arithmetic precision requires a “memory accessor” that handles the conversion between formats (resp. compression of the data) on the fly in registers. For such a memory accessor to be useful in practice, it has to combine multiple characteristics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

High Energy Density Shape Memory Polymers Using Strain-Induced Supramolecular Nanostructures

Shape memory polymers are promising materials in many emerging applications due to their large extensibility and excellent shape recovery. However, practical application of these polymers is limited by their poor energy densities (up to ~1 MJ/m 3 ). Here, we report an approach to achieve a high energy density, one-way shape memory polymer based on the formation of strain-induced supramolecular nanostructures. As polymer chains align during strain, strong directional dynamic bonds form, creating stable supramolecular nanostructures and trapping stretched chains in a highly elongated state. Upon heating, the dynamic bonds break, and stretched chains contract to their initial disordered state. This mechanism stores large amounts of entropic energy (as high as 19.6 MJ/m 3 or 17.9 J/g), almost six times higher than the best previously reported shape memory polymers while maintaining near 100% shape recovery and fixity. The reported phenomenon of strain-induced supramolecular structures offers a new approach toward achieving high energy density shape memory polymers.

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

ZFP: A compressed array representation for numerical computations

HPC trends favor algorithms and implementations that reduce data motion relative to FLOPS. We investigate the use of lossy compressed data arrays in place of traditional IEEE floating point arrays to store the primary data of calculations. Simulation is fundamentally an exercise in controlled approximation, and error introduced by finite-precision arithmetic (or lossy compression) is just one of several sources of error that need to be managed to ensure sufficient accuracy in a computed result. We describe ZFP, a compressed numerical format designed for in-memory storage of multidimensional arrays, and summarize theoretical results that demonstrate that the error of repeated lossy compression can be bounded and controlled. Furthermore, we establish a relationship between grid resolution and compression-induced errors and show that, contrary to conventional floating point, ZFP reduces finite-difference errors with finer grids. We present example calculations that demonstrate data reduction by 4x or more with negligible impact on solution accuracy. Our results further demonstrate several orders-of-magnitude increase in accuracy using ZFP over IEEE floating point and Posits for the same storage budget.

Lindstrom, Peter↗
DOE OSTI2023

Thrifty Array Format (TAF) file specifications

Thrifty Array Foram (TAF) files store numeric data in a binary format, minimizing storage requirements while preserving quick read access. Real data of any size and dimensionality can be stored in this format at varying degrees of numeric precision. Implicit array are associated with each dimension, eliminating the need to explicitly store uniformly-spaced grid vectors. Unlimited text comments may be included with the array for user documentation, and every file begins with a text synopsis of the binary structure. The format is deliberately designed for memory mapping, where portions of the array can be read without loading the entire file at once.

97 MATHEMATICS AND COMPUTING↗