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 1,135 records · Page 63

Spin-optomechanical cavity interfaces by deep subwavelength phonon-photon confinement

A central goal of quantum information science is transferring qubits between space, time, and modality. Spin-based systems in solids are promising quantum memories, but high-fidelity transfer of their quantum states to telecom optical fields remains challenging. Here, we introduce a phonon-mediated interface between spins in a diamond nanobeam optomechanical crystal and telecom optical fields by a simultaneous deep-subwavelength confinement of optical and acoustic fields with mode volumes $V_{\textrm{mech}}$$/Λ^3_\textrm{p} ~ 10^{-5}$ and $V_{\textrm{opt}}$$/λ^3 ~ 10^{−3}$, respectively. This confinement boosts the spin-mechanical coupling rate of Group-IV silicon vacancy (SiV − ) centers by an order of magnitude to ~ 32 MHz while retaining high acousto-optical couplings. The optical cavity couples to the spin irrespective of the emitter’s native excited states, avoiding spectral diffusion. Using Quantum Monte Carlo simulations, we estimate heralded entanglement fidelities exceeding 0.96 between two such interfaces. We anticipate broad utility beyond diamond emitter-telecom systems to most solid-state quantum memories.

Raniwala, Hamza [Massachusetts Inst. of Technology↗

Performance Assessment of Emerging Memories Through FPGA Emulation

Emerging memory technologies offer the prospect of large capacity, high bandwidth, and a range of access latencies ranging from DRAM-like to SSD-like. In this paper, we evaluate the performance of parallel applications on CPUs whose main memories sweep a wide range of latencies within a bandwidth cap. We use an FPGA emulator, the logic in memory emulator (LiME) to accelerate evaluation. The LiME framework uses a multiprocessor system on chip (MPSoC) combining multicore CPU, integrated memory controller, and FPGA fabric, and enables emulation orders of magnitude faster than software simulation. This work highlights the performance impact of higher latency on concurrent applications and identifies conditions under which future high latency memories can effectively be used as main memory.

97 MATHEMATICS AND COMPUTING↗

COOLR: A New System for Dynamic Thermal-Aware Computing

Extreme-scale systems need to walk a fine line between the amount of cooling they receive and the thermal-induced performance and reliability degradation they can sustain. System managers are extremely motivated to battle cooling-energy cost: the largest line item in their total operating cost. On the other hand, pushing the nodes to peak performance in tightened cooling regimes places the burden on the dynamic thermal management (DTM) to protect the hardware. DTM schemes throttle performance to relieve heat accumulation within nodes when cooling cannot mitigate the problem. These interventions prevent fatal failures but introduce inevitable performance degradations and variations. Such variations can have drastic consequences on the performance of extreme-scale systems. Furthermore, distribution of heat across different system nodes depends not only on the amount of workload. Even if a strictly equal share of computational load is assigned to all nodes, there are physical attributes and topological features of each system that inherently cause uneven accumulation of heat. These can cause one subcomponent to trigger DTM prematurely and penalize the overall system. Our goal in this project is to create a holistic thermal-aware view of the system, capturing both inherent physical attributes and dynamic system state. We developed COOLR, a dynamic system with the ability to evaluate the interplay between management of computation, data, power dissipation, and thermal state. Thereby, COOLR will achieve higher overall performance at the same energy and cooling cost. First, we performed a systematic power and thermal modeling and of high performance computing architectures. Analytical and empirical techniques were blended to generate a light-weight thermal model of target systems. Second, we developed a thermal-aware OS and runtime system. Policies for managing resources and schedules for processes has been designed to co-optimize the thermal state and performance of the system. The main outcome of our proposed thermal-aware dynamic computing system are scheduling and allocation of processes and memory accesses leading to an appropriately “skewed” distribution of activity across the system. The ultimate result of this new arrangement resulted in reduced occurrences of hotspots and reduced episodes of DTM intervention, leading to improvements in performance. The overall thermal characterization and modeling methodology (thermal instrumentation techniques, model building, and systematic model reduction) resulting from this project can be applied to systems beyond our immediate scope and will be applicable to future scaling. The thermal-aware dynamic computing paradigm will impact the efficiency of extreme-scale systems. The gained “thermal slack” can be given back to further tighten the cooling budget, benefiting the management cost of next generation extreme-scale systems.

97 MATHEMATICS AND COMPUTING↗

A Limited-Memory Multiple Shooting Method for Weakly Constrained Variational Data Assimilation

Maximum-likelihood-based state estimation for dynamical systems with model error raises computational challenges in memory usage due to the much larger number of free variables when compared to the perfect model case. To address this challenge, we present a limited-memory method for maximum-likelihood-based estimation of state space models. We reduce the memory storage requirements by expressing the optimal states as a function of checkpoints bounding a shooting interval. All states can then be recomputed as needed from a recursion stemming from the optimality conditions. The matching of states at checkpoints is imposed, in a multiple shooting fashion, as constraints on the optimization problem, which is solved with an augmented Lagrangian method. We prove that for nonlinear systems under certain assumptions the condition number of the Hessian matrix of the augmented Lagrangian function is bounded above with respect to the number of shooting intervals. Hence the method is stable for increasing time horizon. The assumptions include satisfying the observability conditions of the linearized system on a shooting interval. We also propose a recursion-based gradient evaluation algorithm for computing the gradient, which in turn allows the algorithm to proceed by storing at any time only the checkpoints and the states on a shooting interval. We demonstrate our findings with simulations in different regimes for Burgers' equation.

Xu, Wanting↗

Store-operate-coherence-on-value

A system, method and computer program product for performing various store-operate instructions in a parallel computing environment that includes a plurality of processors and at least one cache memory device. A queue in the system receives, from a processor, a store-operate instruction that specifies under which condition a cache coherence operation is to be invoked. A hardware unit in the system runs the received store-operate instruction. The hardware unit evaluates whether a result of the running the received store-operate instruction satisfies the condition. The hardware unit invokes a cache coherence operation on a cache memory address associated with the received store-operate instruction if the result satisfies the condition. Otherwise, the hardware unit does not invoke the cache coherence operation on the cache memory device.

97 MATHEMATICS AND COMPUTING↗

The Effect of Firn-Aquifer Drainage on the Greenland Subglacial System or Subglacial Efficiency and Storage Modified by the Temporal Pattern of High-Elevation Meltwater Input

Ice flow in marginal region of the Greenland Ice Sheet dynamically responds to summer melting as surface meltwater is routed through the supraglacial hydrologic system to the bed of the ice sheet via crevasses and moulins. Given the expected increases in surface melt production and extent, and the potential for high elevation surface-to-bed connections, it is imperative to understand how meltwater delivered to the bed from different high-elevation supraglacial storage features affects the evolution of the subglacial hydrologic system and associated ice dynamics. Here, we use the two-dimensional subglacial hydrologic model, GLaDS, which includes distributed and channelized water flow, to test how the subglacial system of an idealized outlet glacier responds to cases of high-elevation firn-aquifer-type and supraglacial-lake-type englacial drainage over the course of 5 years. Model outputs driven by these high elevation drainage types are compared to steady-state model results, where the subglacial system only receives the 1980- 2016 mean MERRA-2 runoff via low-elevation moulins. Across all experiments, the subglacial hydrologic system displays inter-annual memory, resulting in multiyear declines in subglacial pressure during the onset of seasonal melting and growth of subglacial channels. The gradual addition of water in firn-aquifer-type drainage scenarios resulted in small increases in subglacial water storage but limited changes in subglacial efficiency and channelization. Rapid, supraglacial- lake-type drainage resulted in short-term local increases in subglacial water pressure and storage, which gave way to spatially extensive decreases in subglacial pressure and downstream channelization. These preliminary results suggest that the character of high-elevation englacial drainage can have a strong, and possibly outsized, control on subglacial efficiency throughout the ablation zone. Therefore, understanding both how high elevation meltwater is stored supraglacially and the probability of crevassing at high elevations will play an important role in how the subglacial system, proglacial discharge and ice motion will respond to future increases in surface melt production and runoff.

Andrews, Lauren C.↗

Unconventional short-range structural fluctuations in cuprate superconductors

Abstract The interplay between structural and electronic degrees of freedom in complex materials is the subject of extensive debate in physics and materials science. Particularly interesting questions pertain to the nature and extent of pre-transitional short-range order in diverse systems ranging from shape-memory alloys to unconventional superconductors, and how this microstructure affects macroscopic properties. Here we use neutron and X-ray diffuse scattering to uncover universal structural fluctuations in La 2-x Sr x CuO 4 and Tl 2 Ba 2 CuO 6+δ , two cuprate superconductors with distinct point disorder effects and with optimal superconducting transition temperatures that differ by more than a factor of two. The fluctuations are present in wide doping and temperature ranges, including compositions that maintain high average structural symmetry, and they exhibit unusual, yet simple scaling behaviour. The scaling regime is robust and universal, similar to the well-known critical fluctuations close to second-order phase transitions, but with a distinctly different physical origin. We relate this behaviour to pre-transitional phenomena in a broad class of systems with structural and magnetic transitions, and propose an explanation based on rare structural fluctuations caused by intrinsic nanoscale inhomogeneity. We also uncover parallels with superconducting fluctuations, which indicates that the underlying inhomogeneity plays an important role in cuprate physics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Performance Analysis of Garbage Collection and Dynamic Reordering in a Lisp System

Generation based garbage collection and dynamic reordering of objects are two techniques for improving the efficiency of memory management in Lisp and similar dynamic language systems. An analysis of the effect of generation configuration is presented, focusing on the effect of a number of generations and generation capabilities. Analytic timing and survival models are used to represent garbage collection runtime and to derive structural results on its behavior. The survival model provides bounds on the age of objects surviving a garbage collection at a particular level. Empirical results show that execution time is most sensitive to the capacity of the youngest generation. A technique called scanning for transport statistics, for evaluating the effectiveness of reordering independent of main memory size, is presented.

Llames, Rene Lim↗

Exploiting Data Similarity to Reduce Memory Footprints

Memory size has long limited large-scale applications on high-performance computing (HPC) systems. Since compute nodes frequently do not have swap space, physical memory often limits problem sizes. Increasing core counts per chip and power density constraints, which limit the number of DIMMs per node, have exacerbated this problem. Further, DRAM constitutes a significant portion of overall HPC system cost. Therefore, instead of adding more DRAM to the nodes, mechanisms to manage memory usage more efficiently - preferably transparently - could increase effective DRAM capacity and thus the benefit of multicore nodes for HPC systems. MPI application processes often exhibit significant data similarity. These data regions occupy multiple physical locations across the individual rank processes within a multicore node and thus offer a potential savings in memory capacity. These regions, primarily residing in heap, are dynamic, which makes them difficult to manage statically. Our novel memory allocation library, SBLLmalloc, automatically identifies identical memory blocks and merges them into a single copy. SBLLmalloc does not require application or OS changes since we implement it as a user-level library. Overall, we demonstrate that SBLLmalloc reduces the memory footprint of a range of MPI applications by 32.03% on average and up to 60.87%. Further, SBLLmalloc supports problem sizes for IRS over 21.36% larger than using standard memory management techniques, thus significantly increasing effective system size. Similarly, SBLLmalloc requires 43.75% fewer nodes than standard memory management techniques to solve an AMG problem.

97 MATHEMATICS AND COMPUTING↗

Switchable Shape Memory Alloys (SMA) Thermal Materials Project

Develop 2-way switchable thermal systems for use in systems that function in cold to hot temperature ranges using different alloy designs for SMA system concepts. In this project, KSC will specifically address designs of two proof of concept SMA systems with transition temperatures in the 65-95 C range and investigate cycle fatigue and "memory loss" due to thermal cycling.

thermal↗

ASA-FTL: An adaptive separation aware flash translation layer for solid state drives

Here, the flash-memory based Solid State Drive (SSD) presents a promising storage solution for increasingly critical data-intensive applications due to its low latency (high throughput), high bandwidth, and low power consumption. Within an SSD, its Flash Translation Layer (FTL) is responsible for exposing the SSD’s flash memory storage to the computer system as a simple block device. The FTL design is one of the dominant factors determining an SSD’s lifespan and performance. To reduce the garbage collection overhead and deliver better performance, we propose a new, low-cost, adaptive separation-aware flash translation layer (ASA-FTL) that combines sampling, data clustering and selective caching of recency information to accurately identify and separate hot/cold data while incurring minimal overhead. We use sampling for light-weight identification of separation criteria, and our dedicated selective caching mechanism is designed to save the limited RAM resource in contemporary SSDs. Using simulations of ASA-FTL with both real-world and synthetic workloads, we have shown that our proposed approach reduces the garbage collection overhead by up to 28% and the overall response time by 15% compared to one of the most advanced existing FTLs. We find that the data clustering using a small sample size provides significant performance benefit while only incurring a very small computation and memory cost. In addition, our evaluation shows that ASA-FTL is able to adapt to the changes in the access pattern of workloads, which is a major advantage comparing to existing fixed data separation methods.

97 MATHEMATICS AND COMPUTING↗

Spontaneous emergence of autocatalytic information-coding polymers

Self-replicating systems based on information-coding polymers are of crucial importance in biology. They also recently emerged as a paradigm in material design on nano- and micro-scales. We present a general theoretical and numerical analysis of the problem of spontaneous emergence of autocatalysis for heteropolymers capable of template-assisted ligation driven by cyclic changes in the environment. Our central result is the existence of the first order transition between the regime dominated by free monomers and that with a self-sustaining population of sufficiently long chains. We provide a simple, mathematically tractable model supported by numerical simulations, which predicts the distribution of chain lengths and the onset of autocatalysis in terms of the overall monomer concentration and two fundamental rate constants. Another key result of our study is the emergence of the kinetically limited optimal overlap length between a template and each of its two substrates. The template-assisted ligation allows for heritable transmission of the information encoded in chain sequences thus opening up the possibility of long-term memory and evolvability in such systems.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

Use of Convex supercomputers for flight simulation at NASA Langley

The use of the Convex Computer Corporation supercomputers for flight simulation is discussed focusing on a real-time input/output system for supporting the flight simulation. The flight simulation computing system is based on two single processor control data corporation CYBER 175 computers, coupled through extended memory. The Advanced Real-Time Simulation System for digital data distribution and signal conversion is a state-of-the-art, high-speed fiber-optic-based, ring network system which is based on the computer automated measurement and control technology.

Cleveland, Jeff I., II↗

Fatigue Resistance of Liquid-assisted Self-repairing Aluminum Alloys Reinforced with Shape Memory Alloys

A self-repairing aluminum-based composite system has been developed using a liquid-assisted healing theory in conjunction with the shape memory effect of wire reinforcements. The metal-metal composite was thermodynamically designed to have a matrix with a relatively even dispersion of a low-melting eutectic phase, allowing for repair of cracks at a predetermined temperature. Additionally, shape memory alloy (SMA) wire reinforcements were used within the composite to provide crack closure. Investigators focused the research on fatigue cracks propagating through the matrix in order to show a proof-of-concept Shape Memory Alloy Self-Healing (SMASH) technology for aeronautical applications.

Wright, M. Clara↗

UNITY: Unified Memory and File Space. In: ROSS '17 Proceedings of the 7th International Workshop on Runtime and Operating Systems for Supercomputers ROSS 2017, Article No. 6

This paper describes the vision for UNITY, a new high-performance computing focused data storage abstraction that places the entire memory hierarchy, including both traditionally separated memory-and file-based data storage, into one storage continuum. Through the use of a novel API and a set of services centered around a smart runtime system, UNITY is able to provide a number of valuable and interesting benefits. The unified storage space provides a scalable and resilient data environment that dynamically manages the mapping of data onto available resources based on multiple factors, including desired persistence and energy budget considerations. By eliminating the need for high-performance computing domain scientists to develop architecture-dependent optimizations for rapidly evolving data storage technologies, UNITY addresses both ease-of-use and performance.

Jones, Terry↗

An organic electrochemical transistor for multi-modal sensing, memory and processing

By integrating sensing, memory and processing functionalities, biological nervous systems are energy and area efficient. Emulating such capabilities in artificial systems is, however, challenging and is limited by the device heterogeneity of sensing and processing cores. Here we report an organic electrochemical transistor capable of sensing, memory and processing. The device has a vertical traverse architecture and a crystalline–amorphous channel that can be selectively doped by ions to enable two reconfigurable modes: a volatile receptor and a non-volatile synapse. As a volatile receptor, the device is capable of multi-modal sensing and is responsive to stimuli such as ions and light. As a non-volatile synapse, it is capable of 10-bit analogue states, low switching stochasticity and good state retention. We also show that the homogeneous integration of the devices could provide functions such as conditioned reflexes and could be used for real-time cardiac disease diagnoses via reservoir computing.

97 MATHEMATICS AND COMPUTING↗

The OpenACC data model: Preliminary study on its major challenges and implementations

This paper describes how the OpenACC data model is implemented in current OpenACC compilers, ranging from research compilers (OpenUH and OpenARC) to a commercial compiler (the PGI OpenACC compiler). First, we summarize various memory architectures in today’s accelerator systems. We then describe details and issues in implementing the OpenACC data model in three different OpenACC compilers. This includes managing page tables, asynchronous data transfers, asynchronous memory allocate and free, host data construct, aliasing on a data directive, reusing device memory, partially present data, and adjacent data. We also discusses ongoing work to manage large, complex dynamic data structures. We measured the present table lookups, device memory allocation, pinned memory allocation, and managed memory in the three OpenACC compilers using eight OpenACC applications (seven from the SPEC ACCEL benchmark suite and a shock-hydrodynamics mini-application called LULESH).

97 MATHEMATICS AND COMPUTING↗