Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distributed 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,027 records · Page 57

Set statistics in conductive bridge random access memory device with Cu/HfO{sub 2}/Pt structure

The switching parameter variation of resistive switching memory is one of the most important challenges in its application. In this letter, we have studied the set statistics of conductive bridge random access memory with a Cu/HfO{sub 2}/Pt structure. The experimental distributions of the set parameters in several off resistance ranges are shown to nicely fit a Weibull model. The Weibull slopes of the set voltage and current increase and decrease logarithmically with off resistance, respectively. This experimental behavior is perfectly captured by a Monte Carlo simulator based on the cell-based set voltage statistics model and the Quantum Point Contact electron transport model. Our work provides indications for the improvement of the switching uniformity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimizing CGYRO HPC Communication Costs in Ensembles with XGYRO by Sharing the Collisional Constant Tensor Structure

First-principles fusion plasma simulations are both compute and memory intensive, and CGYRO is no exception. The use of many HPC nodes to fit the problem in the available memory thus results in significant communication overhead, which is hard to avoid for any single simulation. That said, most fusion studies are composed of ensembles of simulations, so we developed a new tool, named XGYRO, that executes a whole ensemble of CGYRO simulations as a single HPC job. By treating the ensemble as a unit, XGYRO can alter the global buffer distribution logic and apply optimizations that are not feasible on any single simulation, but only on the ensemble as a whole. The main saving comes from the sharing of the collisional constant tensor structure, since its values are typically identical between parameter-sweep simulations. This data structure dominates the memory consumption of CGYRO simulations, so distributing it among the whole ensemble results in drastic memory savings for each simulation, which in turn results in overall lower communication overhead.

CGYRO↗

Modeling and simulation of space-based entanglement distribution

In this talk we present a model for analyzing space-based entanglement distribution links. In particular, we analyze deterministic entanglement distribution links relevant to quantum communication applications where all communication nodes must be synchronized with deterministic photon arrival times. The focus is on systems operating within practical limitations set by current technology. The architectures studied in this work are based on all-photonic links with probabilistic (memory-less) entanglement swapping used to signal the success of the entanglement distribution without destroying the entangled state. An end-to-end link model is described which accounts for satellite orbital mechanics as well as the physical effects of entangled photon pair sources, space-to-ground atmospheric channels, two-photon interference, pointing and tracking, and photon counting detectors with and without photon number resolution (this is joint work with Robert Manning, Ian Nemitz, and Bryan Welch).

quantum communication↗

Implementing Access to Data Distributed on Many Processors

A reference architecture is defined for an object-oriented implementation of domains, arrays, and distributions written in the programming language Chapel. This technology primarily addresses domains that contain arrays that have regular index sets with the low-level implementation details being beyond the scope of this discussion. What is defined is a complete set of object-oriented operators that allows one to perform data distributions for domain arrays involving regular arithmetic index sets. What is unique is that these operators allow for the arbitrary regions of the arrays to be fragmented and distributed across multiple processors with a single point of access giving the programmer the illusion that all the elements are collocated on a single processor. Today's massively parallel High Productivity Computing Systems (HPCS) are characterized by a modular structure, with a large number of processing and memory units connected by a high-speed network. Locality of access as well as load balancing are primary concerns in these systems that are typically used for high-performance scientific computation. Data distributions address these issues by providing a range of methods for spreading large data sets across the components of a system. Over the past two decades, many languages, systems, tools, and libraries have been developed for the support of distributions. Since the performance of data parallel applications is directly influenced by the distribution strategy, users often resort to low-level programming models that allow fine-tuning of the distribution aspects affecting performance, but, at the same time, are tedious and error-prone. This technology presents a reusable design of a data-distribution framework for data parallel high-performance applications. Distributions are a means to express locality in systems composed of large numbers of processor and memory components connected by a network. Since distributions have a great effect on the performance of applications, it is important that the distribution strategy is flexible, so its behavior can change depending on the needs of the application. At the same time, high productivity concerns require that the user be shielded from error-prone, tedious details such as communication and synchronization.

James, Mark↗

A method for direct numerical integration of the Boltzmann equation

The principal difficulties in numerical solution of the Boltzmann equation are considered. The study is aimed at formulating a numerical solution in such a manner that it contains a minimum amount of excess information at the distribution function level. It is pointed out that the accurate calculation of the distribution function at each point in phase space requires a tremendous number of operations, due to the necessity of solving five-fold quadratures in the collision integral. This results in the operational memory of the digital computer being insufficient to store all the data on the distribution functions at the necessary points in phase space. An algorithm is constructed involving successive iterations of the Boltzmann equation which does not require storage of each step of the new distribution function.

Cheremisin, F. G.↗

Classical non-Markovian Boltzmann equation

The modeling of particle transport involves anomalous diffusion, (x²(t) ) ∝ t{sup α} with α ≠ 1, with subdiffusive transport corresponding to 0 < α < 1 and superdiffusive transport to α > 1. These anomalies give rise to fractional advection-dispersion equations with memory in space and time. The usual Boltzmann equation, with only isolated binary collisions, is Markovian and, in particular, the contributions of the three-particle distribution function are neglected. We show that the inclusion of higher-order distribution functions give rise to an exact, non-Markovian Boltzmann equation with resulting transport equations for mass, momentum, and kinetic energy with memory in both time and space. The two- and the three-particle distribution functions are considered under the assumption that the two- and the three-particle correlation functions are translationally invariant that allows us to obtain advection-dispersion equations for modeling transport in terms of spatial and temporal fractional derivatives.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Techniques for storing data to enhance recovery and detection of data corruption errors

Often there are errors when reading data from computer memory. To detect and correct these errors, there are multiple types of error correction codes. Disclosed is an error correction architecture that creates a codeword having a data portion and an error correction code portion. Swizzling rearranges the order of bits and distributes the bits among different codewords. Because the data is redistributed, a potential memory error of up to N contiguous bits, where N for example equals 2 times the number of codewords swizzled together, only affects up to, at most, two bits per swizzled codeword. This keeps the error within the error detecting capabilities of the error correction architecture. Furthermore, this can allow improved error correction and detection without requiring a change to error correcting code generators and checkers.

Mills, Peter↗

Techniques for storing data to enhance recovery and detection of data corruption errors

Often there are errors when reading data from computer memory. To detect and correct these errors, there are multiple types of error correction codes. Disclosed is an error correction architecture that creates a codeword having a data portion and an error correction code portion. Swizzling rearranges the order of bits and distributes the bits among different codewords. Because the data is redistributed, a potential memory error of up to N contiguous bits, where N for example equals 2 times the number of codewords swizzled together, only affects up to, at most, two bits per swizzled codeword. This keeps the error within the error detecting capabilities of the error correction architecture. Furthermore, this can allow improved error correction and detection without requiring a change to error correcting code generators and checkers.

Mills, Peter↗

Connectivity, Pathology, and ApoE4 Interactions Predict Longitudinal Tau Spatial Progression and Memory

ABSTRACT Tau pathology spread into neocortex indicates a transition from healthy aging to Alzheimer's disease (AD). Connectivity between tau epicenters and later accumulating regions of cortex has been proposed as a mechanism of tau spread, but how this relationship changes with greater AD pathology burden or genotype is not understood. We investigated tau accumulation in two key regions, precuneus and inferior temporal cortex, using resting state functional connectivity (rsFC) and longitudinal PET imaging from a multicohort sample of cognitively unimpaired older adults. We examined how baseline tau PET, Aβ PET, and ApoE4 genotype status interact with rsFC between hippocampus and these downstream regions to predict rate of tau accumulation in neocortex. We found that the 3‐way interaction between connectivity, baseline tau, and baseline Aβ or ApoE4 status was associated with neocortical tau accumulation in precuneus and inferior temporal cortex. In addition, baseline tau, Aβ, and ApoE4 status also moderated the association between connectivity and rate of memory decline. Together, these results suggest that the extent and distribution of future tau accumulation may be predicted by the interaction of baseline connectivity, AD pathology, and genetic risk.

Neurosciences & Neurology↗

Characterization of ECRAM materials and devices

As the limits of Moore’s Law approaches, new computing paradigms are developing to breakthrough this bottleneck. One such computer architecture is neuromorphic computing, which models the brain. Electrochemical random-access memory (ECRAM) is a low power and energy efficient memory due to characteristics, such as in-memory compute, ion modulation of the channel conductance, and computation distribution with large scale array integration.

97 MATHEMATICS AND COMPUTING↗

NASA Tech Briefs, August 2013

Topics covered include: Radial Internal Material Handling System (RIMS) for Circular Habitat Volumes; Conical Seat Shut-Off Valve; Impact-Actuated Digging Tool for Lunar Excavation; Flexible Mechanical Conveyors for Regolith Extraction and Transport; Remote Memory Access Protocol Target Node Intellectual Property; Soft Decision Analyzer; Distributed Prognostics and Health Management with a Wireless Network Architecture; Minimal Power Latch for Single-Slope ADCs; Bismuth Passivation Technique for High-Resolution X-Ray Detectors; High-Strength, Super-elastic Compounds; Cu-Cr-Nb-Zr Alloy for Rocket Engines and Other High-Heat- Flux Applications; Microgravity Storage Vessels and Conveying-Line Feeders for Cohesive Regolith; CRUQS: A Miniature Fine Sun Sensor for Nanosatellites; On-Chip Microfluidic Components for In Situ Analysis, Separation, and Detection of Amino Acids; Spectroscopic Determination of Trace Contaminants in High-Purity Oxygen; Method of Separating Oxygen From Spacecraft Cabin Air to Enable Extravehicular Activities; Atomic Force Microscope Mediated Chromatography; Sample Analysis at Mars Instrument Simulator; Access Control of Web- and Java-Based Applications; Tool for Automated Retrieval of Generic Event Tracks (TARGET); Bilayer Protograph Codes for Half-Duplex Relay Channels; Influence of Computational Drop Representation in LES of a Droplet-Laden Mixing Layer.

Source record↗

Regional Medium-Term Hourly Electricity Demand Forecasting Based on LSTM

This paper aims to forecast high-resolution (hourly) aggregated load for a certain region in the medium term (a few days to over a year). One region is defined as some places with similar climate characteristics because the climate influences people's daily lifestyles and hence the electric usage. We decompose the electric usage records into two parts: base load and seasonal load. Considering both temperature and time factors, different deep-learning methods are adopted to characterize them. The first goal of our approach is to predict the peak load which is critical for power system planning. Furthermore, our proposed forecast method can provide the depiction of the hourly load profile to provide customized load curves for high-level real-time applications. The proposed method is tested on real-world historical data collected by CAISO, BPA, and PACW. The experimental results show that trained by three years of data, our method could reduce the prediction error for a one-year lead hourly load below $5\%$ MAPE, and predict the occurrence of the peak load for next year in CAISO with an error within three days. Furthermore, as a byproduct, an interesting observation on the impact of COVID-19 on human life was made and discussed based on these case studies.

deep learning↗

Nuclear fission dynamics within a generalized Langevin approach

Within the generalized (non-Markovian) multidimensional Langevin approach, the time and energy characteristics of symmetric fission of highly excited heavy nuclei are studied. In two-dimensional space of the collective deformation parameters, it is considered a nuclear descent from the top of the fission barrier to the scission point. The distributions of descent times and total kinetic energy of fission fragments are calculated as functions of memory time, measuring the relative size of memory effects in the collective dynamics. We found that the peculiarities of the non-Markovian dynamics at fairly large values of the memory time are reflected in the saturation of the mean time of motion from the saddle to scission with the growth of the strength of memory effects in the system.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Spectral Analysis Approach for Acoustic Radiation from Composite Panels

A method is developed to predict the vibration response of a composite panel and the resulting far-field acoustic radiation due to acoustic excitation. The acoustic excitation is assumed to consist of obliquely incident plane waves. The panel is modeled by a finite element analysis and the radiated field is predicted using Rayleigh's integral. The approach can easily include other effects such as shape memory alloy (SMA) ber reinforcement, large detection thermal postbuckling, and non-symmetric SMA distribution or lamination. Transmission loss predictions for the case of an aluminum panel excited by a harmonic acoustic pressure are shown to compare very well with a classical analysis. Results for a composite panel with and without shape memory alloy reinforcement are also presented. The preliminary results demonstrate that the transmission loss can be significantly increased with shape memory alloy reinforcement. The mechanisms for further transmission loss improvement are identified and discussed.

Turner, Travis L.↗

Fault latency in the memory - An experimental study on VAX 11/780

Fault latency is the time between the physical occurrence of a fault and its corruption of data, causing an error. The measure of this time is difficult to obtain because the time of occurrence of a fault and the exact moment of generation of an error are not known. This paper describes an experiment to accurately study the fault latency in the memory subsystem. The experiment employs real memory data from a VAX 11/780 at the University of Illinois. Fault latency distributions are generated for s-a-0 and s-a-1 permanent fault models. Results show that the mean fault latency of a s-a-0 fault is nearly 5 times that of the s-a-1 fault. Large variations in fault latency are found for different regions in memory. An analysis of a variance model to quantify the relative influence of various workload measures on the evaluated latency is also given.

Chillarege, Ram↗

Cations Control Lipid Bilayer Memcapacitance Associated with Long-Term Potentiation

Phospholipid bilayers can be described as capacitors whose capacitance per unit area (specific capacitance, C m ) is determined by their thickness and dielectric constant–independent of applied voltage. It is also widely assumed that the C m of membranes can be treated as a “biological constant”. Recently, using droplet interface bilayers (DIBs), it was shown that zwitterionic phosphatidylcholine (PC) lipid bilayers can act as voltage-dependent, nonlinear memory capacitors, or memcapacitors. When exposed to an electrical “training” stimulation protocol, capacitive energy storage in lipid membranes was enhanced in the form of long-term potentiation (LTP), which enables biological learning and long-term memory. LTP was the result of membrane restructuring and the progressive asymmetric distribution of ions across the lipid bilayer during training, which is analogous, for example, to exponential capacitive energy harvesting from self-powered nanogenerators. Here, we describe how LTP could be produced from a membrane that is continuously pumped into a nonequilibrium steady state, altering its dielectric properties. During this time, the membrane undergoes static and dynamic changes that are fed back to the system’s potential energy, ultimately resulting in a membrane whose modified molecular structure supports long-term memory storage and LTP. Here, we also show that LTP is very sensitive to different salts (KCl, NaCl, LiCl, and TmCl 3 ), with LiCl and TmCl 3 having the most profound effect in depressing LTP, relative to KCl. This effect is related to how the different cations interact with the bilayer zwitterionic PC lipid headgroups primarily through electric-field-induced changes to the statistically averaged orientations of water dipoles at the bilayer headgroup interface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficient Memory Access with NumPy Global Arrays using Local Memory Access

This paper discusses the work completed working with Global Arrays of data on distributed multi-computer systems and improving their performance. The tasks completed were done at Pacific Northwest National Laboratory in the Science Undergrad Laboratory Internship program in the summer of 2013 for the Data Intensive Computing Group in the Fundamental and Computational Sciences DIrectorate. This work was done on the Global Arrays Toolkit developed by this group. This toolkit is an interface for programmers to more easily create arrays of data on networks of computers. This is useful because scientific computation is often done on large amounts of data sometimes so large that individual computers cannot hold all of it. This data is held in array form and can best be processed on supercomputers which often consist of a network of individual computers doing their computation in parallel. One major challenge for this sort of programming is that operations on arrays on multiple computers is very complex and an interface is needed so that these arrays seem like they are on a single computer. This is what global arrays does. The work done here is to use more efficient operations on that data that requires less copying of data to be completed. This saves a lot of time because copying data on many different computers is time intensive. The way this challenge was solved is when data to be operated on with binary operations are on the same computer, they are not copied when they are accessed. When they are on separate computers, only one set is copied when accessed. This saves time because of less copying done although more data access operations were done.

Daily, Jeffrey A.↗