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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
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 ↗
NASA NTRS1984

Processing of Synthetic-Aperture-Radar Data

Ambiguous data combined to permit fast-transform convolution. New data processor designed: two-dimensional ensemble of range-correlated SAR data stored in memory and extracted in format for which azimuth data are colinear.

Di Cenzo, A. E.↗
NASA NTRS1994

Influence of antiorthostatic suspension on resistance to murine Listeria monocytogenes infection

The present study was designed to evaluate the influence of antiorthostatic suspension, a ground-based modeling system employed to simulate certain aspects of weightlessness that occur during space flight, on the capacity of mice to resist infection with the facultative intracellular bacterial pathogen Listeria monocytogenes. Female BDF1 mice were suspended by the tail in the orthostatic or antiorthostatic position and were infected with a sublethal dose of virulent L. monocytogenes at various times during the suspension. It was found that suspension did not influence the kinetics of bacterial growth in vivo if the infection was started concurrently with the suspension. However, mice that were antiorthostatically suspended 2, 4, or 7 days before the onset of infection exhibited an enhanced capacity to eliminate the challenge infection. Suspending mice on day 2 of the infection did not alter the kinetics of bacterial growth. Finally, the enhancement of resistance to the primary Listeria infection was accompanied by failure of the mice to generate long-term protective immunological memory to the challenge organism. Collectively, these results indicate that the stress of antiorthostatic suspension can influence the capacity of mice to resist bacterial infection.

NASA Discipline Regulatory Physiology↗
NASA NTRS1980

Edge smoothing for real-time simulation of a polygon face object system as viewed by a moving observer

The visual system within an aircraft flight simulation system receives flight data and terrain data which is formated into a buffer memory. The image data is forwarded to an image processor which translates the image data into face vertex vectors Vf, defining the position relationship between the vertices of each terrain object and the aircraft. The image processor then rotates, clips, and projects the image data into two-dimensional display vectors (Vd). A display generator receives the Vd faces, and other image data to provide analog inputs to CRT devices which provide the window displays for the simulated aircraft. The video signal to the CRT devices passes through an edge smoothing device which prolongs the rise time (and fall time) of the video data inversely as the slope of the edge being smoothed. An operational amplifier within the edge smoothing device has a plurality of independently selectable feedback capacitors each having a different value. The values of the capacitors form a series which doubles as a power of two. Each feedback capacitor has a fast switch responsive to the corresponding bit of a digital binary control word for selecting (1) or not selecting (0) that capacitor. The control word is determined by the slope of each edge. The resulting actual feedback capacitance for each edge is the sum of all the selected capacitors and is directly proportional to the value of the binary control word. The output rise time (or fall time) is a function of the feedback capacitance, and is controlled by the slope through the binary control word.

Lotz, Robert W.↗
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↗
NASA NTRS1933

The NACA Apparatus for Studying the Formation and Combustion of Fuel Sprays and the Results from Preliminary Tests

This report describes the apparatus as designed and constructed at the Langley Memorial Aeronautical Laboratory, for studying the formation and combustion of fuel sprays under conditions closely simulating those occurring in a high-speed compression-ignition engine. The apparatus consists of a single-cylinder modified test engine, a fuel-injection system so designed that a single charge of fuel can be injected into the combustion chamber of the engine, an electric driving motor, and a high-speed photographic apparatus. The cylinder head of the engine has a vertical-disk form of combustion chamber whose sides are glass windows. When the fuel is injected into the combustion chamber, motion pictures at the rate of 2,000 per second are taken of the spray formation by means of spark discharges. When combustion takes place the light of the combustion is recorded on the same photographic film as the spray photographs. The report includes the results of some tests to determine the effect of air temperature, air flow, and nozzle design on the spray formation.

Rothrock, A M↗
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↗
NASA NTRS1981

Memory-based frame synchronizer

A frame synchronizer for use in digital communications systems wherein data formats can be easily and dynamically changed is described. The use of memory array elements provide increased flexibility in format selection and sync word selection in addition to real time reconfiguration ability. The frame synchronizer comprises a serial-to-parallel converter which converts a serial input data stream to a constantly changing parallel data output. This parallel data output is supplied to programmable sync word recognizers each consisting of a multiplexer and a random access memory (RAM). The multiplexer is connected to both the parallel data output and an address bus which may be connected to a microprocessor or computer for purposes of programming the sync word recognizer. The RAM is used as an associative memory or decorder and is programmed to identify a specific sync word. Additional programmable RAMs are used as counter decoders to define word bit length, frame word length, and paragraph frame length.

Stattel, R. J.↗
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↗
NASA NTRS1988

File-Format Program For Transferable Output ASCII Data

TOAD utilities machine-independent and require minimal central memory. Transferable Output ASCII Data (TOAD) file-format computer program facilitates transfer of data files from one computer installation to another. TOAD files preferred type and record length, easy to edit, read, and write on magnetic tape or transfer across communications networks. Applications programs write TOAD files directly and conform to all ANSI FORTRAN 77 standards.

Bingle, Bradford↗
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↗
DOE OSTI2026

An Autonomous MCP Bridge to Rucio: Enhancing Data Management Accessibility for High Energy Physics

The Rucio Data Management System [1] is an important tool used by High Energy Physics experiments, including those at Fermi National Accelerator Laboratory, to store and manage exabyte-scale scientific datasets. Despite its central role in coordinating data across globally distributed storage sites, Rucio's command line interface (CLI) presents a steep learning curve, and makes it difficult for scientists to navigate through. To solve this issue, a containerized Model Context Protocol (MCP) [2] server was built that connects Large Language Models directly to Rucio, allowing AI agents to handle data tasks by using simple, natural language rather than memorized terminal commands. The core engineering focus of this project was moving the server away from slow terminal commands that require text parsing and replacing them with a native Python Client API toolset and a planned REST API framework. Moving to the Python API handles data operations directly in memory, which helps clear up formatting errors, provides the AI with clean, structured JSON data and speeds up tool execution. To prove that the system actually works, a benchmarking pipeline was also built with various questions to test the AI across four different model configurations. The questions included finding data scopes, tracking down specific datasets, and checking replication rules. Through benchmarking, early runs showed that with raw terminal text, the model would get confused and stuck, whereas switching to the Python API to feed the AI clean, structured data yielded massive improvement. By creating an intelligent and autonomous bridge to a storage network, this project shows how AI can be implemented in scientific data management, which ultimately helps scientists at Fermilab spend less time sorting through data and more time focusing on their experiments and analysis.

Akella, Kashyap [William Rainey Harper Coll.]↗
DOE OSTI2023

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗