Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

A single-atom quantum memory in silicon

Long coherence times and fast gate operations are desirable but often conflicting requirements for physical qubits. This conflict can be resolved by resorting to fast qubits for operations, and by storing their state in a ‘quantum memory’ while idle. The 31 P donor in silicon comes naturally equipped with a fast qubit (the electron spin) and a long-lived qubit (the 31 P nuclear spin), coexisting in a bound state at cryogenic temperatures. Here, we demonstrate storage and retrieval of quantum information from a single donor electron spin to its host phosphorus nucleus in isotopically-enriched 28 Si. The fidelity of the memory process is characterised via both state and process tomography. We report an overall process fidelity Fp ! 81%, a memory fidelity Fm ! 92%, and memory storage times up to 80 ms. These values are limited by a transient shift of the electron spin resonance frequency following highpower radiofrequency pulses.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Transcranial stimulation over the left inferior frontal gyrus increases false alarms in an associative memory task in older adults

Here, transcranial direct current stimulation (tDCS) is a potent ial tool for alleviating various forms of cognitive decline, including memory loss, in older adults. However, past effects of tDCS on cognitive ability have been mixed. One important potential moderator of tDCS effects is the baseline level of cognitive performance. We tested the effects of tDCS on face-name associative memory in older adults, who suffer from performance deficits in this task relative to younger adults. Stimulation was applied to the left inferior prefrontal cortex during encoding of face-name pairs, and memory was assessed with both a recognition and recall task. As a result, face–name memory performance was decreased with the use of tDCS. This result was driven by increased false alarms when recognizing rearranged face–name pairs.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Gravitational memory and soft theorems: The local perspective

In general relativity, gravitational memory describes the lasting change in the separation and relative velocity of freely falling detectors after the passage of gravitational waves (GWs). In this paper, we elucidate the relation between Bondi-Metzner-Sachs transformations at future null infinity and the description of gravitational memory in local synchronous coordinates, commonly used in GW detectors like LISA. We show that gravitational memory corresponds to large residual diffeomorphisms in this gauge, such as volume-preserving spatial rescalings. We reproduce the associated soft theorems for scattering amplitudes. Finally, we derive novel soft theorems for equal-time (in-in) correlation functions, which are recognized as the flat space analogues of inflationary consistency relations with a soft tensor mode. Furthermore, these relations provide a pathway toward uncovering deeper connections between gravitational memory and cosmological correlators.

General relativity↗
DOE OSTI2025

Microstructural and rheological training and memory of nanocolloidal soft glasses under cyclic shear

An intrinsic feature of disordered and out-of-equilibrium materials, such as glasses, is the dependence of their properties on their history. An important example is rheological memory, in which disordered solids obtain properties based on their deformation history. Here, in this study, we employ x-ray photon correlation spectroscopy with in situ rheometry to characterize memory formation in a nanocolloidal soft glass due to cyclic shear. During a cycle, particles undergo irreversible displacements composed of a combination of shear-induced diffusion and heterogeneous, residual strain fields. At lower shear amplitudes, the displacements resemble a random walk in which the directions in each cycle are independent of those in preceding cycles, while at high amplitude, the irreversible displacements in consecutive cycles become correlated. The magnitudes of the displacements decrease with each cycle before reaching a steady state where the microstructure has been trained to achieve enhanced reversibility even at shear amplitudes well above yielding and despite the presence of thermal fluctuations. At amplitudes below and near yielding, these decreases are monotonic, while well above yielding, they are nonmonotonic, suggesting evidence of shear banding. Accompanying this microstructural training are corresponding decreases in the dissipation during each cycle and the magnitude of the residual stress toward steady-state values. Memory of the training is revealed by measurements in which the amplitude of the shear is changed after steady state is reached. The magnitude of the particle displacements, as well as the dissipation and the change in residual stress, vary nonmonotonically with the new shear amplitude, having minima near the training amplitude, thereby revealing correlated microscopic and macroscopic signatures of memory.

Chen, Yihao [Johns Hopkins Univ., Baltimore, MD (U↗
DOE OSTI2024

Telecom Networking with a Diamond Quantum Memory

Practical quantum networks require interfacing quantum memories with existing channels and systems that operate in the telecom band. Here we demonstrate low-noise, bidirectional quantum frequency conversion that enables a solid-state quantum memory to directly interface with telecom-band systems. In particular, we demonstrate conversion of visible-band single photons emitted from a silicon-vacancy ( Si V ) center in diamond to the telecom O band, maintaining low noise ( g 2 ( 0 ) < 0.1 ) and high indistinguishability ( V = 89 ± 8 % ). We further demonstrate the utility of this system for quantum networking by converting telecom-band time-bin pulses, sent across a lossy and noisy 50-km deployed fiber link, to the visible band and entangling them with a diamond quantum memory with fidelity F ≥ 87 ± 2.5 % . These results demonstrate the viability of Si V quantum memories integrated with telecom-band systems for scalable quantum networking applications. Published by the American Physical Society 2024

Physics↗
DOE OSTI2022

Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graphs are ubiquitous in modeling complex systems and representing interactions between entities to uncover structural information of the domain. Traditionally, graph analytics workloads are challenging to efficiently scale (both strong and weak cases) on distributed memory due to the irregular memory-access driven nature (with little or no computations) of the methods. The structure of graphs and their relative distribution over the processing elements poses another level of complexity, making it difficult to attain sustainable scalability across platforms. In this paper, we discuss enhancements to TriC, a distributed-memory implementation of graph triangle counting using Message Passing Interface (MPI), which was featured in the 2020 Graph Challenge competition. We have made some incremental enhancements to TriC, primarily adopting a user-defined buffering strategy to overcome the startup problem for large graphs (by fixing the memory for intermediate data), and experimenting with probabilistic data structures such as bloom filter to improve the query response time for assessing edge existence, at the expense of increasing the overall false positive rate. These adjustments have led to a modest improvements in most cases, as compared to the previous version.

Graph Analytics, HPC↗
DOE OSTI2019

PaKman: Scalable Assembly of Large Genomes on Distributed Memory Machines

De novo genome assembly is a fundamental problem in the field of bioinformatics, that aims to assemble the DNA sequence of an unknown genome from numerous short DNA fragments (aka reads) obtained from it. With the advent of high-throughput sequencing technologies, billions of reads can be generated in a matter of hours, necessitating efficient parallelization of the assembly process. While multiple parallel solutions have been proposed in the past, conducting a large- scale assembly at scale remains a challenging problem because of the inherent complexities associated with data movement, and irregular access footprints of memory and I/O operations. In this paper, we present a novel algorithm, called PaKman, to address the problem of performing large-scale genome assemblies on a distributed memory parallel computer. Our approach focuses on improving performance through a combination of novel data structures and algorithmic strategies for reducing the communication and I/O footprint during the assembly process. A key aspect of our algorithm is its graph data structure, which comprises fat nodes (or what we call "macro-nodes") that reduce the communication burden during contig generation. We present an extensive performance and qualitative evaluation of our algorithm, including comparisons to other state-of-the-art parallel assemblers. Our results demonstrate the ability to achieve near-linear speedups on up to 8K cores (tested); outperform state-of-the-art distributed memory and shared memory tools in performance while delivering comparable (if not better) quality; and reduce time to solution significantly. For instance, PaKman is able to complete an assembly of the full human genome in just over a minute on 8K cores.

Ghosh, Priyanka↗
DOE OSTI2022

Global decline in ocean memory over the 21st century

Ocean memory, the persistence of ocean conditions, is a major source of predictability in the climate system beyond weather time scales. We show that ocean memory, as measured by the year-to-year persistence of sea surface temperature anomalies, is projected to steadily decline in the coming decades over much of the globe. This global decline in ocean memory is predominantly driven by shoaling of the upper-ocean mixed layer depth in response to global surface warming, while thermodynamic and dynamic feedbacks can contribute substantially regionally. As the mixed layer depth shoals, stochastic forcing becomes more effective in driving sea surface temperature anomalies, increasing high-frequency noise at the expense of persistent signals. Reduced ocean memory results in shorter lead times of skillful persistence-based predictions of sea surface thermal conditions, which may present previously unknown challenges for predicting climate extremes and managing marine biological resources under climate change.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2015

Anomalous memory effect in the breakdown of low-pressure argon in a long discharge tube

The characteristics of breakdown of argon in a long tube (with a gap length of 75 cm and diameter of 2.8 cm) at pressures of 1 and 5 Torr and stationary discharge currents of 5–40 mA were studied experimentally. The breakdown was initiated by paired positive voltage pulses with a rise rate of ∼10{sup 8}–10{sup 9} V/s and duration of ∼1–10 ms. The time interval between pairs was varied in the range of Τ ∼ 0.1–1 s, and that between pulses in a pair was varied from τ = 0.4 ms to ≈Τ/2. The aim of this work was to detect and study the so-called “anomalous memory effect” earlier observed in breakdown in nitrogen. The effect consists in the dynamic breakdown voltage in the second pulse in a pair being higher than in the first pulse (in contrast to the “normal” memory effect, in which the relation between the breakdown voltages is opposite). It is found that this effect is observed when the time interval between pairs of pulses is such that the first pulse in a pair is in the range of the normal memory effect of the preceding pair (under the given conditions, Τ ≈ 0.1–0.4 s). In this case, at τ ∼ 10 ms, the breakdown voltage of the second pulse is higher than the reduced breakdown voltage of the first pulse. Optical observations of the ionization wave preceding breakdown in a long tube show that, in the range of the anomalous memory effect and at smaller values of τ, no ionization wave is detected before breakdown in the second pulse. A qualitative interpretation of the experimental results is given.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2016

NVL-C: Static Analysis Techniques for Efficient, Correct Programming of Non-Volatile Main Memory Systems

Computer architecture experts expect that non-volatile memory (NVM) hierarchies will play a more significant role in future systems including mobile, enterprise, and HPC architectures. With this expectation in mind, we present NVL-C: a novel programming system that facilitates the efficient and correct programming of NVM main memory systems. The NVL-C programming abstraction extends C with a small set of intuitive language features that target NVM main memory, and can be combined directly with traditional C memory model features for DRAM. We have designed these new features to enable compiler analyses and run-time checks that can improve performance and guard against a number of subtle programming errors, which, when left uncorrected, can corrupt NVM-stored data. Moreover, to enable recovery of data across application or system failures, these NVL-C features include a flexible directive for specifying NVM transactions. So that our implementation might be extended to other compiler front ends and languages, the majority of our compiler analyses are implemented in an extended version of LLVM's intermediate representation (LLVM IR). We evaluate NVL-C on a number of applications to show its flexibility, performance, and correctness.

Denny, Joel↗
DOE OSTI2018

Towards Architecture and OS-Independent Malware Detection via Memory Forensics

In this work, we take a fundamentally different approach to the problem of analyzing a device for compromises via malware; our approach is OS and instruction architecture independent and relies only on having the raw binary data extracted from the memory dump of a device. Our system leverages a multi-hundred TB dataset of both compromised host memory dumps extracted from the MalRec dataset [8] and the first known dataset of benign host memory dumps running normal, non-compromised software. After an average of 30 to 45 seconds of pre-processing on a single memory dump, our system leverages both traditional machine learning and deep learning algorithms to achieve an average of 98% accuracy of detecting a compromised host.

Petrik, Rachel L.↗
DOE OSTI2023

PERKS: a Locality-Optimized Execution Model for Iterative Memory-bound GPU Applications

Iterative memory-bound solvers commonly occur in HPC codes. Typical GPU implementations have a loop on the host side that invokes the GPU kernel as much as time/algorithm steps there are. The termination of each kernel implicitly acts the barrier required after advancing the solution every time step. We propose an execution model for running memory-bound iterative GPU kernels: PERsistent KernelS (PERKS). In this model, the time loop is moved inside persistent kernel, and device-wide barriers are used for synchronization. We then reduce the traffic to device memory by caching subset of the output in each time step in the unused registers and shared memory. PERKS can be generalized to any iterative solver: they largely independent of the solver's implementation. We explain the design principle of PERKS and demonstrate effectiveness of PERKS for a wide range of iterative 2D/3D stencil benchmarks (geomean speedup of 2.12x for 2D stencils and 1.24x for 3D stencils over state-of-art libraries), and a Krylov subspace conjugate gradient solver (geomean speedup of 4.86x in smaller SpMV datasets from SuiteSparse and 1.43x in larger SpMV datasets over a state-of-art library). All PERKS-based implementations available at: https://github.com/neozhang307/PERKS.

Zhang, Lingqi↗
DOE OSTI2024

Understanding GPU Memory Corruption at Extreme Scale: The Summit Case Study

GPU memory corruption and in particular double-bit errors (DBEs) remain one of the least understood aspects of HPC system reliability. Albeit rare, their occurrences always lead to job termination and can potentially cost thousands of node-hours, either from wasted computations or as the overhead from regular checkpointing needed to minimize the losses. As supercomputers and their components simultaneously grow in scale, density, failure rates, and environmental footprint, the efficiency of HPC operations becomes both an imperative and a challenge. We examine DBEs using system telemetry data and logs collected from the Summit supercomputer, equipped with 27,648 Tesla V100 GPUs with 2nd-generation high-bandwidth memory (HBM2). Using exploratory data analysis and statistical learning, we extract several insights about memory reliability in such GPUs. We find that GPUs with prior DBE occurrences are prone to experience them again due to otherwise harmless factors, correlate this phenomenon with GPU placement, and suggest manufacturing variability as a factor. On the general population of GPUs, we link DBEs to short- and long-term high power consumption modes while finding no significant correlation with higher temperatures. We also show that the workload type can be a factor in memory’s propensity to corruption.

Oles, Vlad↗
DOE OSTI2024

MemFriend: Understanding Memory Performance with Spatial-Temporal Affinity

In HPC applications, memory access behavior is one of the main factors affecting performance. Improving an application’s memory access behavior involves optimizing data layout and/or restructuring code, and requires studying spatial-temporal data locality. Existing data locality analyses focus on single-location metrics and are restricted to evaluating temporal locality. We introduce spatial-temporal affinity metrics that quantify temporal access proximity, forward access correlation, and nearby access correlation between pairs of memory locations. We describe methods for distinguishing between potential vs. realized affinity and for reasoning about affinity at multiple resolutions (3D, 2D, 1D). Finally, we construct spatial-temporal affinity signatures that classify memory behavior and that be used to reason about changes in software (data relayout, code refactoring) or hardware (caching, prefetching). We describe methods for signature visualization, interpretation, and quantitative comparison of signatures. We evaluate our methodology using applications with variants that contrast data structures, data layouts and algorithms. We show that spatial-temporal affinity analysis provides novel insights and enables predictive reasoning about application performance when contrasted with reuse distance analysis.

Suriyakumar, Yasodhadevi↗
DOE OSTI2025

SpecSims: A Scalable Speculative Tree-based Simulation Cloning Framework for Finite Memory Machines

Simulation cloning is a technique in which cloned simulations whose state spaces differ partially from their parent simulation due to intervening events are spawned at runtime and concurrently advanced. It is a powerful method to carry out what-if analysis by speculatively exploring and evaluating the impact of various permutations of intervening cascade of events. Due to the exponential growth in the number of possible clones even for a small number of distinct intervening events, the practical efficacy of the approach is often severely limited by the maximum available memory of the computing host. In this paper, we introduce a novel speculative simulation cloning framework that executes a simulation cloning campaign capable of efficiently exploring an exponentially large space of clone simulations created by permutation of intervening events under a finite memory constraint. We provide a theoretical analysis of the runtime characteristics of our proposed approach and highlight its novel advantages such as memory-aware and as-long-as-needed execution. Furthermore, in support of our analytical findings and to demonstrate its practical feasibility, we implement a prototype of the cloning framework on a shared memory system and report its performance characteristics in the context of a heat diffusion simulation, and a power grid simulation subject to cascading disruptions from geomagnetic disturbances.

Simulation framework↗
DOE OSTI2022

Longitudinal Trajectories of Memory Performance in Patients with Early-Stage Breast Cancer

Background. While breast cancer and its treatments may affect cognition, the longitudinal trajectories of cognition among those receiving differing cancer treatment types remain poorly understood. Prior research suggests hippocampal-prefrontal cortex network integrity may influence cognition, although how this network predicts performance over time remains unclear. Methods. We conducted a prospective trial including 69 patients with early-stage breast cancer receiving adjuvant therapy and 12 controls. Longitudinal cognitive testing was conducted at four visits: pretreatment-baseline, 6-7 months, 14-15 months, and 23-24 months. Cognitive composite scores of episodic memory, executive functioning, and processing speed were assessed at each timepoint. Baseline structural MRI was obtained in a subset of these participants, and hippocampal and prefrontal cortex regional volumes were extracted. Results. Longitudinal linear mixed modeling revealed significant group by time interactions on memory performance, controlling for age and education. Post hoc analyses revealed this effect was driven by patients treated with chemotherapy or chemotherapy plus hormone therapy, who demonstrated the least improvement in memory scores over time. Treatment group did not significantly influence the relationship between time and processing speed or executive functioning. Neither pretreatment hippocampal nor prefrontal volume differed between groups, and there were no significant group by time by baseline regional volume effects on cognition. Conclusion. Patients with early-stage breast cancer treated with chemotherapy or chemotherapy plus hormone therapy benefit less from practice effects seen in healthy controls on memory tests. Loss of longitudinal practice effect may be a new and clinically relevant measure for capturing patients’ experience of cognitive difficulties after treatment.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Scalable low-loss cryogenic packaging of quantum memories in CMOS-foundry processed photonic chips

Optically linked solid-state quantum memories such as color centers in diamond are a promising platform for distributed quantum information processing and networking. Photonic integrated circuits (PICs) have emerged as a crucial enabling technology for these systems, integrating quantum memories with efficient electrical and optical interfaces in a compact and scalable platform. Packaging these hybrid chips into deployable modules while maintaining low optical loss and resiliency to temperature cycling is a central challenge to their practical use. We demonstrate a packaging method for PICs using surface grating couplers and angle-polished fiber arrays that is robust to temperature cycling, offers scalable channel count, applies to a wide variety of PIC platforms and wavelengths, and offers pathways to automated high-throughput packaging. Using this method, we show optically and electrically packaged quantum memory modules integrating all required qubit controls on chip, operating at millikelvin temperatures with <3 dB losses achievable from fiber to quantum memory for the TE 0 mode at a wavelength of 737 nm.

Bernson, Robert [Tyndall National Institute, Cork ↗
DOE OSTI2015

The Art of War: Beyond Memory-one Strategies in Population Games

We show that the history of play in a population game contains exploitable information that can be successfully used by sophisticated strategies to defeat memory-one opponents, including zero determinant strategies. The history allows a player to label opponents by their strategies, enabling a player to determine the population distribution and to act differentially based on the opponent’s strategy in each pairwise interaction. For the Prisoner’s Dilemma, these advantages lead to the natural formation of cooperative coalitions among similarly behaving players and eventually to unilateral defection against opposing player types. We show analytically and empirically that optimal play in population games depends strongly on the population distribution. For example, the optimal strategy for a minority player type against a resident TFT population is ALLC, while for a majority player type the optimal strategy versus TFT players is ALLD. Such behaviors are not accessible to memory-one strategies. Drawing inspiration from Sun Tzu’s the Art of War, we implemented a non-memory-one strategy for population games based on techniques from machine learning and statistical inference that can exploit the history of play in this manner. Via simulation we find that this strategy is essentially uninvadable and can successfully invade (significantly more likely than a neutral mutant) essentially all known memory-one strategies for the Prisoner’s Dilemma, including ALLC (always cooperate), ALLD (always defect), tit-for-tat (TFT), winstay-lose-shift (WSLS), and zero determinant (ZD) strategies, including extortionate and generous strategies.

60 APPLIED LIFE SCIENCES↗