Search NASA⌕ Search

SEARCH · Search NASA

Results for “Memory systems”

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 523 records · Page 29

Curvature Memory in Electrically Stimulated Lipid Membranes

Here, we demonstrate, using non-equilibrium molecular dynamics simulations, that lipid membrane capacitance varies with surface charge accumulation linked to membrane shape and curvature changes. Specifically, we show that lipid membranes exhibit a hysteretic response when exposed to oscillatory electric fields. The electromechanical coupling in these membranes leads to hysteretic buckling, in which the membrane can spontaneously buckle in one of two distinct directions along the electric field, even for the same ionic charge accumulation at the water–membrane interface. In this regard, these binary buckled membrane states suggest potential applications in neuromorphic computing. Their bistable nature, characterized by two distinct and stable configurations, could serve as a foundation for implementing memory storage systems and logic operations. Furthermore, we introduce a circuit model that captures these dynamic effects, offering insights into emergent memory effects in electrically stimulated lipid membranes. Finally, this work presents lipid bilayers as dynamic, adaptable elements and suggests a new platform for exploring energy storage, information processing, and memory encoding at the lipid membrane level.

59 BASIC BIOLOGICAL SCIENCES↗

Low Temperature Shape Memory Alloys for Adaptive, Autonomous Systems Project

The objective of this joint activity between Kennedy Space Center (KSC) and Glenn Research Center (GRC) is to develop and evaluate the applicability of 2-way SMAs in proof-of-concept, low-temperature adaptive autonomous systems. As part of this low technology readiness (TRL) activity, we will develop and train low-temperature novel, 2-way shape memory alloys (SMAs) with actuation temperatures ranging from 0 C to 150 C. These experimental alloys will also be preliminary tested to evaluate their performance parameters and transformation (actuation) temperatures in low- temperature or cryogenic adaptive proof-of-concept systems. The challenge will be in the development, design, and training of the alloys for 2-way actuation at those temperatures.

Falker, John↗

Dynamic memory of a single voltage-gated potassium ion channel: A stochastic nonequilibrium thermodynamic analysis

In this work, we have studied the stochastic response of a single voltage-gated potassium ion channel to a periodic external voltage that keeps the system out-of-equilibrium. The system exhibits memory, resulting from time-dependent driving, that is reflected in terms of dynamic hysteresis in the current-voltage characteristics. The hysteresis loop area has a maximum at some intermediate voltage frequency and disappears in the limits of low and high frequencies. However, the (average) dissipation at long-time limit increases and finally goes to saturation with rising frequency. This raises the question: how diminishing hysteresis can be associated with growing dissipation? To answer this, we have studied the nonequilibrium thermodynamics of the system and analyzed different thermodynamic functions which also exhibit hysteresis. Interestingly, by applying a temporal symmetry analysis in the high-frequency limit, we have analytically shown that hysteresis in some of the periodic responses of the system does not vanish. On the contrary, the rates of free energy and internal energy change of the system as well as the rate of dissipative work done on the system show growing hysteresis with frequency. Hence, although the current-voltage hysteresis disappears in the high-frequency limit, the memory of the ion channel is manifested through its specific nonequilibrium thermodynamic responses.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Grundy - Parallel processor architecture makes programming easy

The hardware, software, and firmware of the parallel processor, Grundy, are examined. The Grundy processor uses a simple processor that has a totally orthogonal three-address instruction set. The system contains a relative and indirect processing mode to support the high-level language, and uses pseudoprocessors and read-only memory. The system supports high-level language in which arbitrary degrees of algorithmic parallelism is expressed. The functions of the compiler and invocation frame are described. Grundy uses an operating system that can be accessed by an arbitrary number of processes simultaneously, and the access time grows only as the logarithm of the number of active processes. Applications for the parallel processor are discussed.

Meier, R. J., Jr.↗

Dynamic memory remapping to reduce row-buffer conflicts

A data processing system includes a memory that includes a first memory bank and a second memory bank. The data processing system also includes a conflict detector connected to the memory and adapted to receive memory access information. The conflict detector tracks memory access statistics of the first memory bank, and determines if the first memory bank contains frequent row conflicts. The conflict detector also remaps a frequent row conflict in the first memory bank to the second memory bank. An indirection table is connected to the conflict detector and adapted to receive a memory access request, and redirects an address into a dynamically selected physical memory address in response to a remapping of the frequent row conflict to the second memory bank.

97 MATHEMATICS AND COMPUTING↗

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite. The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.

97 MATHEMATICS AND COMPUTING↗

Application Characterization at Scale: Lessons learned from developing a distributed Open Community Runtime system for High Performance Computing

Since 2012, the U.S. Department of Energy’s X-Stack program has been developing solutions including runtime systems, programming models, languages, compilers, and tools for the Exascale system software to address crucial performance and power requirements. Fine grain programming models and runtime systems show a great potential to efficiently utilize the underlying hardware. Thus, they are essential to many X-Stack efforts. An abundant amount of small tasks can better utilize the vast parallelism available on current and future machines. Moreover, finer tasks can recover faster and adapt better, due to a decrease in state and control. Nevertheless, current applications have been written to exploit old paradigms (such as Communicating Sequential Processor and Bulk Synchronous Parallel processing). To fully utilize the advantages of these new systems, applications need to be adapted to these new paradigms. As part of the applications’ porting process, in-depth characterization studies, focused on both application characteristics and runtime features, need to take place to fully understand the application performance bottlenecks and how to resolve them. This paper presents a characterization study for a novel high performance runtime system, called the Open Community Runtime, using key HPC kernels as its vehicle. This study has the following contributions: one of the first high performance, fine grain, distributed memory runtime system implementing the OCR standard (version 0.99a); and a characterization study of key HPC kernels in terms of runtime primitives running on both intra and inter node environments. Running on a general purpose cluster, we have found up to 1635x relative speed-up for a parallel tiled Cholesky Kernels on 128 nodes with 16 cores each and a 1864x relative speed-up for a parallel tiled Smith-Waterman kernel on 128 nodes with 30 cores.

Application characterization↗

YAPPA: a Compiler-Based Parallelization Framework for Irregular Applications on MPSoCs

Modern embedded systems include hundreds of cores. Because of the difficulty in providing a fast, coherent memory architecture, these systems usually rely on non-coherent, non-uniform memory architectures with private memories for each core. However, programming these systems poses significant challenges. The developer must extract large amounts of parallelism, while orchestrating communication among cores to optimize application performance. These issues become even more significant with irregular applications, which present data sets difficult to partition, unpredictable memory accesses, unbalanced control flow and fine grained communication. Hand-optimizing every single aspect is hard and time-consuming, and it often does not lead to the expected performance. There is a growing gap between such complex and highly-parallel architectures and the high level languages used to describe the specification, which were designed for simpler systems and do not consider these new issues. In this paper we introduce YAPPA (Yet Another Parallel Programming Approach), a compilation framework for the automatic parallelization of irregular applications on modern MPSoCs based on LLVM. We start by considering an efficient parallel programming approach for irregular applications on distributed memory systems. We then propose a set of transformations that can reduce the development and optimization effort. The results of our initial prototype confirm the correctness of the proposed approach.

Irregular applications↗

Open-system quantum dynamics with correlated initial states, not completely positive maps, and non-Markovianity

Dynamical A and B maps have been employed extensively by Sudarshan and co-workers to investigate open-system evolution of quantum systems. A canonical structure of the A map is introduced here. It is shown that this canonical A map enables us to investigate whether the dynamics is completely positive (CP) or not completely positive (NCP) in an elegant way and, hence, it subsumes the basic results on open-system dynamics. Identifying memory effects in open-system evolution is gaining increasing importance recently and, here, a criterion of non-Markovianity, based on the relative entropy of the dynamical state is proposed. The relative entropy difference of the dynamical system serves as a complementary characterization--though not related directly--to the fidelity difference criterion proposed recently. Three typical examples of open-system evolution of a qubit, prepared initially in a correlated state with another qubit (environment), and evolving jointly under a specific unitary dynamics--which corresponds to a NCP dynamical map--are investigated by employing both the relative entropy difference and fidelity difference tests of non-Markovianity. The two-qubit initial states are chosen to be (i) a pure entangled state, (ii) the Werner state, which exemplifies both entangled and separable states of qubits, depending on a real parameter, and (iii) a separable mixed state. Both the relative entropy and fidelity criteria offer a nice display of how non-Markovianity manifests itself in all three examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High Performance Parallel Computational Nanotechnology

At a recent press conference, NASA Administrator Dan Goldin encouraged NASA Ames Research Center to take a lead role in promoting research and development of advanced, high-performance computer technology, including nanotechnology. Manufacturers of leading-edge microprocessors currently perform large-scale simulations in the design and verification of semiconductor devices and microprocessors. Recently, the need for this intensive simulation and modeling analysis has greatly increased, due in part to the ever-increasing complexity of these devices, as well as the lessons of experiences such as the Pentium fiasco. Simulation, modeling, testing, and validation will be even more important for designing molecular computers because of the complex specification of millions of atoms, thousands of assembly steps, as well as the simulation and modeling needed to ensure reliable, robust and efficient fabrication of the molecular devices. The software for this capacity does not exist today, but it can be extrapolated from the software currently used in molecular modeling for other applications: semi-empirical methods, ab initio methods, self-consistent field methods, Hartree-Fock methods, molecular mechanics; and simulation methods for diamondoid structures. In as much as it seems clear that the application of such methods in nanotechnology will require powerful, highly powerful systems, this talk will discuss techniques and issues for performing these types of computations on parallel systems. We will describe system design issues (memory, I/O, mass storage, operating system requirements, special user interface issues, interconnects, bandwidths, and programming languages) involved in parallel methods for scalable classical, semiclassical, quantum, molecular mechanics, and continuum models; molecular nanotechnology computer-aided designs (NanoCAD) techniques; visualization using virtual reality techniques of structural models and assembly sequences; software required to control mini robotic manipulators for positional control; scalable numerical algorithms for reliability, verifications and testability. There appears no fundamental obstacle to simulating molecular compilers and molecular computers on high performance parallel computers, just as the Boeing 777 was simulated on a computer before manufacturing it.

Saini, Subhash↗

NASA Tech Briefs, January 2006

Topics covered include: Semiautonomous Avionics-and-Sensors System for a UAV; Biomimetic/Optical Sensors for Detecting Bacterial Species; System Would Detect Foreign-Object Damage in Turbofan Engine; Detection of Water Hazards for Autonomous Robotic Vehicles; Fuel Cells Utilizing Oxygen From Air at Low Pressures; Hybrid Ion-Detector/Data-Acquisition System for a TOF-MS; Spontaneous-Desorption Ionizer for a TOF-MS; Equipment for On-Wafer Testing From 220 to 325 GHz; Computing Isentropic Flow Properties of Air/R-134a Mixtures; Java Mission Evaluation Workstation System; Using a Quadtree Algorithm To Assess Line of Sight; Software for Automated Generation of Cartesian Meshes; Optics Program Modified for Multithreaded Parallel Computing; Programs for Testing Processor-in-Memory Computing Systems; PVM Enhancement for Beowulf Multiple-Processor Nodes; Ion-Exclusion Chromatography for Analyzing Organics in Water; Selective Plasma Deposition of Fluorocarbon Films on SAMs; Water-Based Pressure-Sensitive Paints; System Finds Horizontal Location of Center of Gravity; Predicting Tail Buffet Loads of a Fighter Airplane; Water Containment Systems for Testing High-Speed Flywheels; Vapor-Compression Heat Pumps for Operation Aboard Spacecraft; Multistage Electrophoretic Separators; Recovering Residual Xenon Propellant for an Ion Propulsion System; Automated Solvent Seaming of Large Polyimide Membranes; Manufacturing Precise, Lightweight Paraboloidal Mirrors; Analysis of Membrane Lipids of Airborne Micro-Organisms; Noninvasive Diagnosis of Coronary Artery Disease Using 12-Lead High-Frequency Electrocardiograms; Dual-Laser-Pulse Ignition; Enhanced-Contrast Viewing of White-Hot Objects in Furnaces; Electrically Tunable Terahertz Quantum-Cascade Lasers; Few-Mode Whispering-Gallery-Mode Resonators; Conflict-Aware Scheduling Algorithm; and Real-Time Diagnosis of Faults Using a Bank of Kalman Filters.

Source record↗

A Single-Chip Programmable Digital CMOS Imager with Enhanced Low Light Detection Capability

Low-power, low-cost, miniature and integrated digital imaging systems are expected to be widely used in consumer electronics in the near future. While CMOS technology has been responsible for the phenomenal growth in consumer electronics, micro-porcessors, memory, audio systems, and radio-frequency circuits (e.g. cellular phones), till recently, the video technology remained outside this mainstream.

digital↗

Low Power, Radiation Resilient Synchronous Edge Processing for Remote Monitoring

Next-generation space remote sensing systems may be equipped with imaging arrays that sense data at a rate that outstrips the processing capability of any computing hardware that can operate within a satellite’s power budget. This project developed novel convolutional and recurrent neural networks to detect and estimate point-like events amid clutter, and investigated their efficient and accurate implementation on analog in-memory computing systems that are 10-1000× more energy-efficient than digital processors. This project leveraged two memory devices at different levels of technological maturity: a large-scale analog computing prototype using commercial SONOS charge-trap memory, and electrochemical memory (ECRAM) with intrinsic radiation hardness. We experimentally demonstrated end-to-end analog processing of our neural networks on SONOS and characterized the radiation response of both SONOS and ECRAM. We advanced the state-of-the-art in ECRAM precision and reliability, and developed co-design methods to enable accurate long-term operation of SONOS analog accelerators in space radiation environments.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Memorial Pools Energy Efficiency Retrofits

The National September 11 Memorial & Museum completed a retrofit of the submergible LED lighting fixtures in its North and South Memorial Pools, located at the World Trade Center site in New York City. The two one-acre pools are illuminated nightly by custom LED fixtures set into their base, and the original lights — in place since 2011 — had begun reaching the end of their useful life, leaving sections of the pools dim or dark. Rather than fully replacing the fixtures, the project team worked with the original manufacturer, Acuity Brands, to retrofit and reuse existing components across all eight pool walls (34 fixtures per wall), reducing cost and waste. Fixtures were shipped in custom crates to Minnesota for retrofitting, then reinstalled onsite by Memorial & Museum staff and contractor ABM. The team addressed two key technical challenges during the project: early leakage in retrofitted fixtures, resolved by introducing vacuum-sealing and nitrogen-fill testing before shipment; and chord damage during transit, resolved with custom-designed shipping crates. All eight pool walls were successfully retrofitted and reinstalled by August 27, 2025, ahead of the 25th anniversary of the September 11, 2001 attacks. Sitewide electrical consumption in September 2025 reflected an approximate 7% reduction, contributing to the institution's broader net-zero and LEED Gold sustainability goals.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Personal annunciation device

A personal annunciation device (PAD) providing, in an area of interest, compensatory annunciation of the presence of an abnormal condition in a hazardous area and accountability of the user of the PAD. Compensatory annunciation supplements primary annunciation provided by an emergency notification system (ENS). A detection system detects an abnormal condition, and a wireless transmission system transmits a wireless transmission to the PAD. The PAD has a housing enclosing the components of the PAD including a communication module for receiving the wireless transmission, a power supply, processor, memory, annunciation system, and RFID module. The RFID module has an RFID receiver that listens for an RFID transmission from an RFID reader disposed in a portal of an area of interest. The PAD identifies the transmission and changes its operating state based on the transmission. The RFID readers recognize, record, and transmit the state of the PAD to a base station providing accountability of the wearer.

47 OTHER INSTRUMENTATION↗

Sage: parallel semi-asymmtric graph algorithms for NVRAMs

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

97 MATHEMATICS AND COMPUTING↗