Search NASA⌕ Search

SEARCH · Search NASA

Results for “out of 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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Mapping entry invalidation

A memory access system may include a first memory address translator, a second memory address translator and a mapping entry invalidator. The first memory address translator translates a first virtual address in a first protocol of a memory access request to a second virtual address in a second protocol and tracks memory access request completions. The second memory address translator is to translate the second virtual address to a physical address of a memory. The mapping entry invalidator requests invalidation of a first mapping entry of the first mapping address translator requests invalidation of a second mapping entry of the second memory address translator corresponding to the first mapping entry following invalidation of the first mapping entry and based upon the tracked memory access request completions.

Walker, Shawn K.↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2020

MEPHESTO: Modeling Energy-Performance in Heterogeneous SoCs and Their Trade-Offs

Integrated shared memory heterogeneous architectures are pervasive because they satisfy the diverse needs of mobile, autonomous, and edge computing platforms. Although specialized processing units (PUs) that share a unified system memory improve performance and energy efficiency by reducing data movement, they also increase contention for this memory since the PUs interact with each other. Prior work has investigated performance degradation due to memory contention, but few have studied the relationship of power and energy to memory contention. Moreover, a comprehensive solution that models memory contention for kernel placement on contemporary heterogeneous systems on chip (SoCs) in response to energy and performance has been largely unaddressed.This paper presents MEPHESTO, a novel and holistic approach for managing this balance. The authors characterize applications and PUs in terms of two memory contention factors - time factors and power factors - to achieve the desired trade-off between energy and performance for collocated kernel execution on heterogeneous systems. The authors believe that this investigation is the first to combine all of these factors and present a simple knob-based approach that expresses the target trade-off. The approach is evaluated on a diverse integrated shared memory heterogeneous system with a CPU, GPU, and programmable vision accelerator. By using an empirical model for memory contention that provides up to 92% accuracy, the kernel collocation approach can provide a near-optimal ordering and placement based on the user-defined, energy-performance trade-off parameter. Moreover, the dynamic programming-based heuristics provide up to 30% better energy or 20% performance benefits when compared with the greedy approaches commonly employed by previous studies.

Alaul haque monil, Mohammad↗
DOE OSTI2023

Device and method for data compression using a metadata cache

A processing device is provided which includes memory comprising data cache memory configured to store compressed data and metadata cache memory configured to store metadata, each portion of metadata comprising an encoding used to compress a portion of data. The processing device also includes at least one processor configured to compress portions of data and select, based on one or more utility level metrics, portions of metadata to be stored in the metadata cache memory. The at least one processor is also configured to store, in the metadata cache memory, the portions of metadata selected to be stored in the metadata cache memory, store, in the data cache memory, each portion of compressed data having a selected portion of corresponding metadata stored in the metadata cache memory. Each portion of compressed data, having the selected portion of corresponding metadata stored in the metadata cache memory, is decompressed.

Das, Shomit N.↗
DOE OSTI2021

Co-design of Advanced Architectures for Graph Analytics using Machine Learning

A graph is an excellent way of representing relationships among entities. We can use graph analytics to synthesize and analyze such relational data, and extract relevant features that are useful for various tasks such as machine learning. Considering the crucial role of graph analytics in various domains, it is important and timely to investigate the right hardware configurations that can achieve optimal performance for graph workloads on future high-performance computing systems. Design space exploration studies facilitate the selection of appropriate configurations (e.g. memory) to achieve a desired system performance. Recently, the approach of accelerating graph analytics using persistent non-volatile memory has gained a lot of attention. Traditional system simulators such as Gem5 and NVMain can be used to explore the design space of these advanced memory architectures for graph workloads. However, these simulators are slow in execution thus limiting the efficiency of design space exploration studies. To overcome this challenge, we proposed a machine learning based approach to co-design advanced memory architectures for graph workloads. We tested our approach with DRAM, non-volatile memory, and hybrid memory (DRAM+NVM) using a breadth first search benchmark algorithm. Our results showed the applicability of the proposed machine learning based approach to the co-design of the advanced memory architectures. In this paper, we provide recommendations on selecting advanced memory architectures to achieve desired performance for graph workloads. We also discuss the performances of different machine learning models that were considered in this study.

Kurte, Kuldeep↗
DOE OSTI2020

Topological insulator-based high efficiency switching of magnetic unit, method and applications

A magneto-electronic device may include: a spin-orbit torque (SOT) generator layer; a magnetic memory layer; and/or sensing electrodes configured to measure a Hall effect of the magnetic memory layer. The SOT generator layer may include topological insulator material, and the magnetic memory layer may include ferromagnetic material with perpendicular magnetic anisotropy. A magneto-electronic device may include: a spin-orbit torque (SOT) generator layer; a first magnetic memory layer on the SOT generator layer; an insulating layer on the first magnetic memory layer; and/or a second magnetic memory layer on the insulating layer. The SOT generator layer may include topological insulator material. The first magnetic memory layer and the second magnetic memory layer may include ferromagnetic material with either perpendicular magnetic anisotropy or in-plane magnetic anisotropy.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Register-Like Block RAM: Implementation, Testing in FPGA and Applications for High Energy Physics Trigger Systems

In high energy physics experiment trigger systems, block memories are utilized for various purposes, especially in indexed searching algorithms. It is often demanded to globally reset all memory locations between different events which is a feature not supported in regular block memories. Another common demand is to be able to update the contents in any memory location in a single clock cycle. These two demands can be fulfilled with registers but the cost of using registers for large memory is unaffordable. In this paper, a register-like block memory design scheme is described, which allows updating memory locations in single clock cycle and effectively refreshing entire memory within a single clock. The implementation and test results are presented.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Layer-Dependent Bit Error Variation in 3-D NAND Flash Under Ionizing Radiation

In this paper, we studied the total ionization dose (TID) effects on the multilevel-cell (MLC) 3-D NAND flash memory using Co-60 gamma radiation. We found a significant page-to-page bit error variation within a physical memory block of the irradiated memory chip. Our analysis showed that the origin of the bit error variation is the unique vertical layer-dependent TID response of the 3-D NAND. We found that the memory pages located at the upper and lower layers of the 3-D stack show higher fails compared to the middle-layer pages of a given memory block. We confirmed our findings by comparing radiation response of four different chips of the same specification. In addition, we compared the TID response of the MLC 3-D NAND with that of the 2-D NAND chip, which showed less page-to-page variation in bit error within a given memory block. We discuss the possible application of our findings for the radiation-tolerant smart memory controller design.

3-D NAND flash↗
DOE OSTI2023

NREM sleep as a novel protective cognitive reserve factor in the face of Alzheimer's disease pathology

Alzheimer’s disease (AD) pathology impairs cognitive function. Yet some individuals with high amounts of AD pathology suffer marked memory impairment, while others with the same degree of pathology burden show little impairment. Why is this? One proposed explanation is cognitive reserve i.e., factors that confer resilience against, or compensation for the effects of AD pathology. Deep NREM slow wave sleep (SWS) is recognized to enhance functions of learning and memory in healthy older adults. However, that the quality of NREM SWS (NREM slow wave activity, SWA) represents a novel cognitive reserve factor in older adults with AD pathology, thereby providing compensation against memory dysfunction otherwise caused by high AD pathology burden, remains unknown. Here, we tested this hypothesis in cognitively normal older adults (N = 62) by combining 11 C-PiB (Pittsburgh compound B) positron emission tomography (PET) scanning for the quantification of β-amyloid (Aβ) with sleep electroencephalography (EEG) recordings to quantify NREM SWA and a hippocampal-dependent face-name learning task. We demonstrated that NREM SWA significantly moderates the effect of Aβ status on memory function. Specifically, NREM SWA selectively supported superior memory function in individuals suffering high Aβ burden, i.e., those most in need of cognitive reserve (B = 2.694, p = 0.019). In contrast, those without significant Aβ pathological burden, and thus without the same need for cognitive reserve, did not similarly benefit from the presence of NREM SWA (B = -0.115, p = 0.876). This interaction between NREM SWA and Aβ status predicting memory function was significant after correcting for age, sex, Body Mass Index, gray matter atrophy, and previously identified cognitive reserve factors, such as education and physical activity (p = 0.042). These findings indicate that NREM SWA is a novel cognitive reserve factor providing resilience against the memory impairment otherwise caused by high AD pathology burden. Furthermore, this cognitive reserve function of NREM SWA remained significant when accounting both for covariates, and factors previously linked to resilience, suggesting that sleep might be an independent cognitive reserve resource. Beyond such mechanistic insights are potential therapeutic implications. Unlike many other cognitive reserve factors (e.g., years of education, prior job complexity), sleep is a modifiable factor. As such, it represents an intervention possibility that may aid the preservation of cognitive function in the face of AD pathology, both present moment and longitudinally.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Nanoprobe Based Information Processing: Nanoprobe‐Electronics

Abstract With computational architectures becoming data‐centric and with the rise of in‐memory computing, the role of memory will be ever more crucial. In turn, storing massive amount of data demands for ultra‐low power and non‐volatile types necessitating new memory technologies. Here, a controllable nanoelectromechanical (NEM) spin memory is proposed for compact nonvolatile memory arrays. It combines the advantages of both nanomechanical and spin‐transfer torque (STT) magnetic memory devices to overcome fundamental scalability roadblocks of non‐hybrid alternatives. The hybrid system paves the way to a new memory technology in the regime of sub‐10‐nm lateral size with a sub‐1‐MA cm −2 switching energy.

Yi, Bao↗
DOE OSTI2023

An autoencoder compression approach for accelerating large-scale inverse problems

Abstract Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

Mathematics↗
DOE OSTI2025

Performance Impact and Trade-Offs for Tuning Key Architectural Parameters on CPU+GPU Systems

In this work, we performed an initial design space exploration of an accelerated processing unit (APU)—a hybrid CPU+GPU architecture that integrates both compute units (CUs) and memory into a unified system. This integration aims to reduce data movement, enhance memory locality, and improve energy efficiency by enabling the CPU and GPU to share memory directly. This effort focused on the interplay of key design components—cache line size, the number of CUs, and main memory technology—and the trade-offs of each configuration were analyzed. This paper highlights the various configurations’ impact on memory accesses, data reuse, and power utilization. The results provide valuable insights that can be leveraged to optimize APU architectures for high-performance and energy-efficient computing and thus create a balanced architecture. This optimization can be achieved by adopting dynamic cache management, runtime CU scaling, and advanced memory integration, highlighting the potential of APUs to address critical challenges in compute, data movement, and memory power consumption.

Asifuzzaman, Kazi [ORNL] (ORCID:0000000240044791)↗
DOE OSTI2025

CRCNS US-France Research Proposal: Collaborative Research: Encoding reward expectation in Drosophilia

The fruit fly Drosophila melanogaster has been a valuable model for investigating the genetic and neural bases that underlie learning and memory. Early and most current studies use basic behavior conditioning protocols to study learning in controlled laboratory settings. More recently, the ability to transgenically manipulate many of the brain neurons in the fruit fly with exquisite specificity, and the recent knowledge of the synaptic ‘connectome’ of the fruit fly brain, makes these animals almost unique as a comprehensive model for studies of learning, memory and motivated behavior. In fact, the connectome has revealed many types of new connections that had until now been overlooked. Within this context, the thesis of this proposal is that studies of learning and memory will be greatly enhanced by using more sophisticated means for evaluating memory representations, such as have been developed in vertebrates, and combining those studies with information from the connectome guided by computational modelling. We propose to push beyond the boundaries of existing conditioning protocols for fruit flies to investigate more complex memory representations. In particular, we will investigate the function of reinforcement pathways in relation to the absence of expected reinforcement. More specifically, we propose a series of experiments designed to investigate the memory representations in fruit flies when an expected consequence of a Conditioned Stimulus (CS) fails to occur. Although studies have evaluated how this failure can establish extinction memory for the CS, our studies will go beyond studying extinction. Specifically, we predict that in Drosophila when a CS is associated with a failed expectation of an appetitive food reinforcement it will acquire aversive value, and vice versa for a failed expectation of an aversive reinforcer. We combine these studies with manipulations of reinforcement pathways in the CNS inspired from the connectome, iteratively knitted in with established computational models. Intellectual Merit: The concept of reinforcement expectation and incentive contrast have been influential in the development of studies of associative learning in mammals. These questions are particularly challenging to answer in vertebrates because they require exquisite cellular, temporal, and genetic specificity of experimental manipulations. The recent development of work with identified neurons and their connectomes makes the larval and adult fly brains ripe as models for pushing our understanding of neural bases for these higher- order conditioning phenomena. Broader Impacts: Public health: These analyses and the conceptual framework of prediction error processing underlying them have a profound impact on our understanding of reinforcement-related behavior in humans, including monetary rewards and the mnemonic consequences of traumatic experiences, and for pathologies of the dopamine reinforcement system. Educational: This project will provide interdisciplinary training for postdoctoral researchers, Ph.D. and undergraduate students. The PIs will act as co-supervisors or mentors of students working in the different labs via face-to-face and internet-based technologies. We will also work with ASU’s award-winning Ask- A-Biologist program. This is an online science program designed to enrich the learning experiences of students of all ages and to provide classroom material for use by K-12 teachers. We will develop an extension of a game developed under a prior NSF award, and the new game will include modules to teach K-12 students about how insects learn. We will also integrate into the AAB site a program developed by a collaborator (B Gerber) at the Leibniz Institut für Neurobiologie, Magdeburg, and now in use in schools in Germany, to teach K-12 students how to train animals using the fruit fly larval learning paradigm. Underrepresented groups: All PIs will work with their university offices of Academic Diversity and Equal Opportunity for reaching underrepresented students.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Quantum Gravity and Laser Interferometry: Towards Observable Predictions

Understanding quantum gravity remains one of the deepest challenges in modern physics, as direct experimental access to Planck-scale effects is beyond current technological reach. However, recent theoretical advances indicate that quantum fluctuations of spacetime may produce measurable effects in precision experiments, particularly near causal horizons. This opens new avenues for testing quantum gravity phenomena through high-precision measurement techniques. This dissertation develops multiple theoretical models to characterize these effects and examines their potential observational signatures in future gravitational wave interferometers. We begin by investigating the role of quantum fluctuations in near-horizon geometries through the lens of the AdS/CFT correspondence, which provides a powerful framework for understanding the interplay between quantum field theory and general relativity via holographic principles. By modeling stochastic energy-momentum sources in Rindler-AdS spacetime, we demonstrate that vacuum fluctuations transform the Einstein equations into a Langevin-type stochastic differential equation, leading to potentially observable fluctuations in photon traversal times. Extending this approach to Minkowski spacetime, we establish a correspondence between gravitational shockwaves and fluid dynamics, showing that near-horizon perturbations satisfy an equation analogous to that governing incompressible fluids, thereby reinforcing the membrane paradigm and hydrodynamic analogies in the context of the fluid/gravity duality. Furthermore, we construct the covariant phase space of a spherically symmetric causal diamond in Minkowski spacetime, identifying two fundamental charges that govern its evolution. These results provide a foundation for quantizing causal horizons and understanding their microscopic degrees of freedom. Building upon these theoretical developments, we further examine a related stochastic phenomenon: the gravitational wave memory background arising from the cumulative memory steps produced by supermassive black hole mergers. After reviewing the standard stochastic gravitational wave background, gravitational memory effects, and BMS symmetries, we model the stochastic memory background using a Brownian motion framework. We show that while the cumulative memory background initially appears above the sensitivity curve of space-based interferometers like LISA, the realistic subtraction of individually resolvable merger events substantially suppresses the residual signal, making its detection more challenging. This highlights the critical importance of source subtraction when evaluating the detectability of gravitational memory effects. By bridging fundamental theory with experimental prospects, this dissertation contributes to the ongoing effort to uncover the quantum nature of spacetime through precision measurement techniques. Whether through detecting quantum spacetime fluctuations, gravitational memory backgrounds, or probing the symmetries of causal horizons, the pursuit of observable quantum gravity phenomena continues to expand the frontiers of both theory and experiment.

Zhang, Yiwen [Caltech] (ORCID:0000000323559416)↗
DOE OSTI2021

Locality-aware and sharing-aware cache coherence for collections of processors

A cache coherence technique for operating a multi-processor system including shared memory includes allocating a cache line of a cache memory of a processor to a memory address in the shared memory in response to execution of an instruction of a program executing on the processor. The technique includes encoding a shared information state of the cache line to indicate whether the memory address is a shared memory address shared by the processor and a second processor, or a private memory address private to the processor, in response to whether the instruction is included in a critical section of the program, the critical section being a portion of the program that confines access to shared, writeable data.

Farmahini Farahani, Amin↗
DOE OSTI2022

Register-Like Storage Block Used as Histograms, Cluster Buffers, and Hough Transform Accumulators for HEP Trigger Systems

In high energy physics experiment trigger systems, block memories are utilized for various purposes, especially in binned searching algorithms. In these algorithms, the storages are demanded to perform like a large set of registers. The writing and reading operation must be performed in single clock cycle and once an event is processed, the memory must be globally reset. These demands can be fulfilled with registers but the cost of using registers for large memory is unaffordable. Another common requirement is the boundary coverage feature during reading process. Additionally, when a memory bin is addressed, the stored contents in the addressed bin and its neighboring bin must be output simultaneously. In this paper, a register-like block storage design scheme is described, which allows updating memory locations in single clock cycle, reading two adjacent bins, and effectively refreshing entire memory within a single clock. The implementation and test results are presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

MATAR: A performance portability and productivity implementation of data-oriented design with Kokkos

There is a need for simple, fast, and memory-efficient multidimensional data structures for dense and sparse storage that arise with numerical methods and in software applications. The data structures must perform equally well across multiple computer architectures, including CPUs and GPUs. For this purpose, we developed MATAR, a C++ software library that allows for simple creation and use of intricate data structures that is also portable across disparate architectures using Kokkos. Here, the performance aspect is achieved by forcing contiguous memory layout (or as close to contiguous as possible) for multidimensional and multi-size dense or sparse MATrix and ARray (hence, MATAR) types. Our results show that MATAR has the capability to improve memory utilization, performance, and programmer productivity in scientific computing. This is achieved by fitting more work into the available memory, minimizing memory loads required, and by loading memory in the most efficient order. This document describes the purpose of the work, the implementation of each of the data types, and the resulting performance both in some simple baseline test cases and in an application code.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

The root-zone soil moisture spectrum in a mediterranean ecosystem

Storage of water within soil pores of the root zone introduce memory effects in the dynamics of soil moisture that are considerably longer than the integral timescale of many atmospheric processes. Thus, hydro-climatic states can be “sustained” through land-surface heat and water vapor fluxes primarily because they can “feed off” on this long-term soil moisture memory. Root-zone soil moisture memory is only but one feature characterizing the spectrum of soil moisture dynamics, which is analyzed here using a combination of long-term measurements and models. In particular, the spectrum of root-zone soil moisture content in a Mediterranean ecosystem is examined using 14-years of half-hourly measurements. A distinguishing hydro-climatic feature in such ecosystems is that sources (mainly rainfall) and sinks (mainly evapotranspiration) of soil moisture are roughly out of phase with each other. For over 4 decades of time scales and 7 decades of energy, the canonical shape of the measured soil moisture spectrum is shown to be approximately Lorentzian determined by the soil moisture variance and its memory but with two exceptions: the occurrences of a peak at diurnal-to-daily time scales and a weaker peak at near annual time scales. Model calculations and spectral analysis demonstrate that diurnal and seasonal variations in hydroclimate forcing responsible for variability in evapotranspiration had minor impact on the normalized shape of the soil moisture spectrum. However, their impact was captured by adjustments in the temporal variance. These findings indicate that precipitation and not evapotranspiration variability dominates the multi-scaling properties of soil moisture variability consistent with prior climate model simulations. Furthermore, the soil moisture memory inferred by the annual peak of soil moisture (340 d) is consistent with climate model simulations, while the memory evaluated from the loss function of a linearized mass balance approach leads to a smaller value (50 d), highlighting the effect of weak non-stationarity on soil moisture variability.

54 ENVIRONMENTAL SCIENCES↗