Search NASA⌕ Search

SEARCH · Search NASA

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 1,315 records · Page 73

Passive Thermal Management Systems Employing Shape Memory Alloys

A thermal management system includes a first substrate having a first conductive inner surface. A second substrate has a second conductive inner surface. A connecting structure is attached to the first and second substrates to space apart the first and second inner surfaces defining an insulating space for a single architecture. One or more passively-acting elements are attached to the inner surface of at least one substrate and including a shape memory material such as a shape memory alloy (SMA). The SMA passively reacts to the temperature of the first substrate by thermally contacting or separating from the second inner surface of the second substrate for the control of the conduction of heat energy in either direction.

Trigwell, Steven↗

Recent Advances in Commercial Memories and Potential Contribution to GN&C Miniaturation

The last few years have seen a surge in technology, device, and architecture introductions in commercial memories such as SDRAM and NAND driven by the explosion of handheld and portable electronics. Some of the resultant devices provide high density in very small and light packages, which may be possible to leverage for the miniaturization of future GN&C systems in addition to providing considerable memory capacity to enable advanced capabilities such as image-based navigation or adaptive/autonomous operations. We will show that these advanced SDRAM and NAND technologies are worth serious consideration for the next generation of GN&C needs by highlighting reliability and radiation effects results from some of these devices.

Yang-Scharlotta, Jean Y.↗

Ab Initio Simulations of Martensitic Phase Transformations in NiTi-based High Temperature Ternary Shape Memory Alloys: NiTiHf and NiTiZr

Ab initio simulations of phase stability and martensitic phase transitions are performed for NiTi-based ternary shape memory alloys (SMAs). Specifically, we considered NiTiHf and NiTiZr, which are highly studied for high temperature SMA applications. Previously, we performed investigations of ordered NiTi and related binaries [1,2]. However, similar approaches for chemically disordered compounds present additional difficulties. In this work, special quasi-random structures (SQS) were generated for various compositions, x∈[0,0.5], of Ni0.5Ti(0.5-x)Hfx and Ni0.5Ti(0.5-x)Zrx to capture chemical disorder of off-stoichiometric compounds. Phase stability was evaluated through analysis of finite temperature phonon spectra using temperature dependent effective potential (TDEP) method. Free energies for the cubic B2 phase of NiTiHf and NiTiZr were computed using ab initio thermodynamic integration (AITI) developed previously [1,2]. Free energies for monoclinic B19’ and orthorhombic B33 phases were evaluated via quasi harmonic approximations (QHA). Our results show a critical composition (xc) where the three phases of B2, B19’ and B33 meet, i.e. there is a tri-critical point. For x xc, the transition is between B33 and B2, i.e. it is not a shape memory transition. The approach presented here opens the door to ab initio based predictions of MTT for arbitrary ternary SMAs.

Hessam Malmir↗

Controlling properties by chemistry in doped shape memory alloys

Shape memory alloys find increasing use in airspace applications. Using theoretical and computational methods, we investigate correlations between the selected properties and composition in doped NiTi-based shape memory alloys. Among the properties we consider relative energies, phase transition temperature, and hysteresis. We compare predictions to experimental data. Our theoretical guidance facilitates design of future alloys.

Nikolai A Zarkevich↗

Using Long-Short Term Memory Models to Predict Solar Active Regions Emergence

We train Long Short-Term Memory (LSTM) models that predict the formation of active regions (ARs), the main source of eruptive solar activity. Using the Doppler shift velocity, the continuum intensity and the magnetic field full-disk maps from SDO/HMI we have created time-series datasets of acoustic power and magnetic flux which are used to train Long Short-Term Memory (LSTM) models on predicting decreases in continuum intensity 12 hours in advance. Testing of the models' performance was done on data from 5 ARs, unseen from the model during training. The model predicted the emergence of AR11726, AR13165 and AR13179, 10, 29 and 5 hours in advance, and variations of this model achieved average RMSE values of 0.11 for both active and quiet parts of the solar disc, showing the ability of the model to capture acoustic power anomalies and predict continuum intensity variations. This work sets the foundations for the very first ML-aided prediction of solar ARs.

SMD↗

Cache directory look-up re-use as conflict check mechanism for speculative memory requests

In a cache memory, energy and other efficiencies can be realized by saving a result of a cache directory lookup for sequential accesses to a same memory address. Where the cache is a point of coherence for speculative execution in a multiprocessor system, with directory lookups serving as the point of conflict detection, such saving becomes particularly advantageous.

97 MATHEMATICS AND COMPUTING↗

Distributed trace using central performance counter memory

A plurality of processing cores, are central storage unit having at least memory connected in a daisy chain manner, forming a daisy chain ring layout on an integrated chip. At least one of the plurality of processing cores places trace data on the daisy chain connection for transmitting the trace data to the central storage unit, and the central storage unit detects the trace data and stores the trace data in the memory co-located in with the central storage unit.

97 MATHEMATICS AND COMPUTING↗

Using DMA for copying performance counter data to memory

A device for copying performance counter data includes hardware path that connects a direct memory access (DMA) unit to a plurality of hardware performance counters and a memory device. Software prepares an injection packet for the DMA unit to perform copying, while the software can perform other tasks. In one aspect, the software that prepares the injection packet runs on a processing core other than the core that gathers the hardware performance data.

97 MATHEMATICS AND COMPUTING↗

Tier identification (TID) for tiered memory characteristics

A tier identification (TID) is to indicate a characteristic of a memory region associated with a virtual address in a tiered memory system. A thread may be serviced according to a first path based on the TID indicating a first characteristic. The thread may be serviced according to a second path based on the TID indicating a second characteristic.

97 MATHEMATICS AND COMPUTING↗

Reader set encoding for directory of shared cache memory in multiprocessor system

In a parallel processing system with speculative execution, conflict checking occurs in a directory lookup of a cache memory that is shared by all processors. In each case, the same physical memory address will map to the same set of that cache, no matter which processor originated that access. The directory includes a dynamic reader set encoding, indicating what speculative threads have read a particular line. This reader set encoding is used in conflict checking. A bitset encoding is used to specify particular threads that have read the line.

97 MATHEMATICS AND COMPUTING↗

Post polymerization cure shape memory polymers

This invention relates to chemical polymer compositions, methods of synthesis, and fabrication methods for devices regarding polymers capable of displaying shape memory behavior (SMPs) and which can first be polymerized to a linear or branched polymeric structure, having thermoplastic properties, subsequently processed into a device through processes typical of polymer melts, solutions, and dispersions and then crossed linked to a shape memory thermoset polymer retaining the processed shape.

36 MATERIALS SCIENCE↗

High-Performance Computation of Distributed-Memory Parallel 3D Voronoi and Delaunay Tessellation

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets: N-body simulations, molecular dynamics codes, and LIDAR point clouds are just a few examples. Such computational geometry methods are common in data analysis and visualization; but as the scale of simulations and observations surpasses billions of particles, the existing serial and shared-memory algorithms no longer suffice. A distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this paper is a new parallel Delaunay and Voronoi tessellation algorithm that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include periodic and wall boundary conditions, comparison of our method using two popular serial libraries, and application to numerous science datasets.

97 MATHEMATICS AND COMPUTING↗

Case Study in Corporate Memory Recovery: Hanford Tank Farms Miscellaneous Underground Waste Storage Tanks - 15344

In addition to managing the 177 underground waste storage tanks containing 212,000 m3 (56 million gal) of radioactive waste at the U. S. Department of Energy’s Hanford Site 200 Area Tank Farms, Washington River Protection Solutions LLC is responsible for managing numerous small catch tanks and special surveillance facilities. These are collectively known as “MUSTs” - Miscellaneous Underground Storage Tanks. The MUSTs typically collected drainage and flushes during waste transfer system piping changes; special surveillance facilities supported Tank Farm processes including post-World War II uranium recovery and later fission product recovery from tank wastes. Most were removed from service following deactivation of the single-shell tank system in 1980 and stabilized by pumping the remaining liquids from them. The MUSTs were isolated by blanking connecting transfer lines and adding weatherproofing to prevent rainwater entry. Over the next 30 years MUST operating records were dispersed into large electronic databases or transferred to the National Archives Regional Center in Seattle, Washington. During 2014 an effort to reacquire the historical bases for the MUSTs’ published waste volumes was undertaken. Corporate Memory Recovery from a variety of record sources allowed waste volumes to be initially determined for 21 MUSTs, and waste volumes to be adjusted for 37 others. Precursors and symptoms of Corporate Memory Loss were identified in the context of MUST records recovery.

Washenfelder, D. J.↗

Method for training honeybees to respond to olfactory stimuli and enhancement of memory retention therein

A specialized conditioning protocol for honeybees that is designed for use within a complex agricultural ecosystem. This method ensures that the conditioned bees will be less likely to exhibit a conditioned response to uninfected plants, a false positive response that would render such a biological sensor unreliable for agricultural decision support. Also described is a superboosting training regime that allows training without the aid of expensive equipment and protocols for training in out in the field. Also described is a memory enhancing cocktail that aids in long term memory retention of a vapor signature. This allows the bees to be used in the field for longer durations and with fewer bees trained overall.

59 BASIC BIOLOGICAL SCIENCES↗

A Screen Space GPGPU Surface LIC Algorithm for Distributed Memory Data Parallel Sort Last Rendering Infrastructures

The surface line integral convolution(LIC) visualization technique produces dense visualization of vector fields on arbitrary surfaces. We present a screen space surface LIC algorithm for use in distributed memory data parallel sort last rendering infrastructures. The motivations for our work are to support analysis of datasets that are too large to fit in the main memory of a single computer and compatibility with prevalent parallel scientific visualization tools such as ParaView and VisIt. By working in screen space using OpenGL we can leverage the computational power of GPUs when they are available and run without them when they are not. We address efficiency and performance issues that arise from the transformation of data from physical to screen space by selecting an alternate screen space domain decomposition. We analyze the algorithm's scaling behavior with and without GPUs on two high performance computing systems using data from turbulent plasma simulations.

Loring, Burlen↗

Mini-Ckpts: Surviving OS Failures in Persistent Memory

Concern is growing in the high-performance computing (HPC) community on the reliability of future extreme-scale systems. Current efforts have focused on application fault-tolerance rather than the operating system (OS), despite the fact that recent studies have suggested that failures in OS memory are more likely. The OS is critical to a system's correct and efficient operation of the node and processes it governs -- and in HPC also for any other nodes a parallelized application runs on and communicates with: Any single node failure generally forces all processes of this application to terminate due to tight communication in HPC. Therefore, the OS itself must be capable of tolerating failures. In this work, we introduce mini-ckpts, a framework which enables application survival despite the occurrence of a fatal OS failure or crash. Mini-ckpts achieves this tolerance by ensuring that the critical data describing a process is preserved in persistent memory prior to the failure. Following the failure, the OS is rejuvenated via a warm reboot and the application continues execution effectively making the failure and restart transparent. The mini-ckpts rejuvenation and recovery process is measured to take between three to six seconds and has a failure-free overhead of between 3-5% for a number of key HPC workloads. In contrast to current fault-tolerance methods, this work ensures that the operating and runtime system can continue in the presence of faults. This is a much finer-grained and dynamic method of fault-tolerance than the current, coarse-grained, application-centric methods. Handling faults at this level has the potential to greatly reduce overheads and enables mitigation of additional fault scenarios.

Fiala, David↗

Method for programming a flash memory

A method of programming a flash memory is described. The method includes partitioning a flash memory into a first group having a first level of write-protection, a second group having a second level of write-protection, and a third group having a third level of write-protection. The write-protection of the second and third groups is disabled using an installation adapter. The third group is programmed using a Software Installation Device.

97 MATHEMATICS AND COMPUTING↗

Post polymerization cure shape memory polymers

This invention relates to chemical polymer compositions, methods of synthesis, and fabrication methods for devices regarding polymers capable of displaying shape memory behavior (SMPs) and which can first be polymerized to a linear or branched polymeric structure, having thermoplastic properties, subsequently processed into a device through processes typical of polymer melts, solutions, and dispersions and then crossed linked to a shape memory thermoset polymer retaining the processed shape.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗