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,009 records · Page 56

Ionic Tuning of Cobaltites at the Nanoscale

Control of materials through custom design of ionic distributions is one of the most promising approaches for developing future technologies ranging from spintronic logic and memory devices to energy storage. Perovskites have shown particular promise for ionic-devices due to their high ion mobility and sensitivity to chemical stoichiometry. In this work, we demonstrate control of ion distributions in (La,Sr)CoO3. Commensurate with control of the oxygen stoichiometry, the Co valence and saturation magnetization show a smooth continuous variation. In contrast, magnetoresistance measurements show a sharp, step-wise transition in the magnetic anisotropy and resistivity over the same range of oxygen stoichiometry. These results suggest significant phase separation, with conductive magnetic regions and oxygen-deficient, insulating, non-magnetic regions, forming percolated networks. Indeed, X-ray diffraction identifies oxygen vacancy ordering, including the emergence of Brownmillerite ordering. The unusual appearance of the Brownmillerite phase under ambient temperature is further confirmed by high resolution scanning transmission electron microscopy. This work demonstrates room-temperature ionic control of magnetism, electrical conductivity and crystalline structure, in a 40 nm film, presenting new opportunities for ionic devices that leverage multiple material properties.

thin films, magnetism, xmcd, pnr, STEM, defects↗

The number of stable points of an infinite-range spin glass memory

A rigorous asymptotic expression for the number of stable points of an infinite-range spin glass with independently identically distributed (i.i.d) zero-mean gaussian exchange interactions is discussed. The result also applies tot he number of stable points of a Hopfield Memory (a kind of associative memory) when the memory connections are i.i.d. zero-mean gaussians. The result is that the number of stable points is asymptotic to a constant slightly larger than 1 times 2 to a power slightly larger thann/4, where n is the number of spins in the glass, or the length of the n-tuples to be remembered by the memory. The answer is easily derived using simple asymptotic techniques from an exact expression for the probability that an arbitrary plus or minus 1 n-tuple of spins is a fixed point. This expression is obtained from the fact that any distribution of joint zero-mean gaussians of given covariances is specified solely by these covariances. This is a far shorter derivation of the result than those existing.

Posner, E. C.↗

NASA 14 Day Undersea Missions: A Short-Duration Spaceflight Analog for Immune System Dysregulation

BACKGROUND Spaceflight-associated immune dysregulation (SAID) occurs during spaceflight and may represent specific clinical risks for exploration-class missions. An appropriate ground analog for spaceflight-associated immune dysregulation would offer a platform for ground-evaluation of various potential countermeasures. This study evaluated the NASA Undersea Mission Operations ( NEEMO ), consisting of 14 day undersea deployment at the Aquarius station, as an analog for SAID. Sixteen Aquanauts from missions NEEMO-12, 13 and 14 participated in the study. RESULTS Mid-mission alterations leukocyte distribution occurred, including granulocytosis and elevations in central-memory CD8+ T-cells. General T cell function was reduced during NEEMO missions in roughly 50% of subjects. Secreted cytokines profiles were evaluated following whole blood stimulation with CD3/CD28 (T cells) or LPS (monocytes). T cell production of IFNg, IL-5, IL-10, IL-2, TNFa and IL-6 were all reduced before and during the mission. Conversely, monocyte production of TNFa, IL-10, IL-6, IL-1b and IL-8 were elevated during mission, moreso at the MD-14 timepoint. Antibodies to Epstein-Barr virus (EBV) viral capsid antigen and early antigen were increased in approximately 40% of the subjects. Changes in EBV tetramer-positive CD8+ T-cells exhibited a variable pattern. Antibodies against Cytomegalovirus (CMV) were marginally increased during the mission. Herpesvirus reactivation was determined by PCR. EBV viral load was generally elevated at L-6. Higher levels of salivary EBV were found during the NEEMO mission than before and after as well as than the healthy controls. No VZV or CMV was found in any pre, during and after NEEMO mission or control samples. Plasma cortisol was elevated at L-6. CONCLUSION Unfortunately, L-6 may be too near to mission start to be an appropriate baseline measurement. The general immune changes in leukocyte distribution, T cell function, cytokine production, virus specific immunity and viral reactivation are similar to those observed during or following spaceflight. The NEEMO platform may thus have utility for short-duration, ground-based spaceflight-immune research, such as investigations of mechanism or countermeasures validation.

Crucian, B. E.↗

TAZeR: Hiding the Cost of Remote I/O in Distributed Scientific Workflows

A perennial bottleneck in distributed workflow analytics is long access latencies for remote data. We ask the question: assuming that data must be accessed remotely, can latencies be hidden? We present TAZeR, a framework that reduces data access latency while increasing data reuse. TAZeR transparently converts POSIX I/O into operations that interleave application work with data transfer, i.e. read, prefetching, and write stage-out. TAZeR ensures read data moves directly to application memory without synchronous intervention (soft zero-copy). TAZeR uses distributed bandwidth-aware staging to exploit reuse across application tasks and to manage the capacity constraints of fast hierarchical storage. We evaluate TAZeR on a High Energy Physics workflow that requests remote data at 48 Gb/s (over two 1 Gb/s WAN links) using complex access patterns. TAZeR is 12× and 22× faster than XRootD (state-of-the-art) and file copies (current approach), respectively; and within 7% of optimal. We discuss conditions when TAZeR can hide I/O accesses; and evaluate performance as effective staging sizes change.

Tazer, remote I/O, data staging↗

Task Assignment Heuristics for Distributed CFD Applications

CFD applications require high-performance computational platforms: 1. Complex physics and domain configuration demand strongly coupled solutions; 2. Applications are CPU and memory intensive; and 3. Huge resource requirements can only be satisfied by teraflop-scale machines or distributed computing.

Lopez-Benitez, N.↗

Applications of Fuzzy Set Theory to Satellite Soundings

The introduction of an appropriate fuzzy setting for satellite soundings and its application to clustering methods via unimodal fuzzy sets in the future is proposed. Methods of hard clustering analysis and fuzzy partitioned clustering were applied on simulated data with very encouraging results. The proposed clustering technique is discussed. The notion of a unimodal fuzzy set was chosen to represent the partition of a data set for two reasons: (1) it detects all the locations in the vector space where highly concentrated clusters of points exist; and (2) the notion is general enough to represent clusters that exhibit quite general distributions of points. The technique detects all of the existing unimodal fuzzy sets and realizes the maximum separation among them. It is economical in memory space and computational time requirements and also detects groups that are fairly generally distributed in the feature space.

Munteanu, M. J.↗

Efficient Heterogeneous Execution on Large Multicore and Accelerator Platforms: Case Study Using a Block Tridiagonal Solver

The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing block-level linear algebra operations in the overall, distributed solver algorithm. Optimizations incorporated include: (1) an efficient memory mapping and synchronization interface to minimize data movement, (2) multi-process sharing of the accelerator within a node to obtain balanced load with multicore processors, and (3) an automatic memory management system to efficiently utilize accelerator memory when sub-matrices spill over the limits of device memory. Results are reported from our novel implementation that uses MAGMA and CUBLAS accelerator software systems simultaneously with ACML for multithreaded execution on processors. Overall, using 940 nVidia Tesla X2090 accelerators and 15,040 cores, the best heterogeneous execution delivers a 10.9-fold reduction in run time relative to an already efficient parallel multicore-only baseline implementation that is highly optimized with intra-node and inter-node concurrency and computation-communication overlap. Detailed quantitative results are presented to explain all critical runtime components contributing to hybrid performance.

Park, Alfred J↗

Reconfigurable perovskite nickelate electronics for artificial intelligence

Reconfigurable devices offer the ability to program electronic circuits on demand. Here, in this work, we demonstrated on-demand creation of artificial neurons, synapses, and memory capacitors in post-fabricated perovskite NdNiO 3 devices that can be simply reconfigured for a specific purpose by single-shot electric pulses. The sensitivity of electronic properties of perovskite nickelates to the local distribution of hydrogen ions enabled these results. With experimental data from our memory capacitors, simulation results of a reservoir computing framework showed excellent performance for tasks such as digit recognition and classification of electrocardiogram heartbeat activity. Using our reconfigurable artificial neurons and synapses, simulated dynamic networks outperformed static networks for incremental learning scenarios. The ability to fashion the building blocks of brain-inspired computers on demand opens up new directions in adaptive networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Progressive CPU Volume Rendering with Sample Accumulation

Here, we present a new method for progressive volume rendering by accumulating object-space samples over successively rendered frames. Existing methods for progressive refinement either use image space methods or average pixels over frames, which can blur features or integrate incorrectly with respect to depth. Our approach stores samples along each ray, accumulates new samples each frame into a buffer, and progressively interleaves and integrates these samples. Though this process requires additional memory, it ensures interactivity and is well suited for CPU architectures with large memory and cache. This approach also extends well to distributed rendering in cluster environments. We implement this technique in Intel’s open source OSPRay CPU ray tracing framework and demonstrate that it is particularly useful for rendering volumetric data with costly sampling functions.

97 MATHEMATICS AND COMPUTING↗

Evaluation of error recovery blocks used for cooperating processes

It is pointed out that the increasing computation power and rapidly falling cost of microprocessors and memories have given an impetus to the development of distributed computing systems. There are a number of potential benefits. A number of issues have to be resolved, however, before the full potential of a distributed processing system can be realized. The present investigation is concerned with one such issue, taking into account the effectiveness of implementing recovery blocks (RB's) in backward error recovery for a set of cooperating processes. A quantitative evaluation of three different recovery blocks employed in backward error recovery for concurrent processing is performed.

Shin, K. G.↗

CID-720 aircraft high-environment flight instrumentation system

The high-environment flight instrumentation system was designed to acquire Langley's structural response data during the full scale transport-controlled impact demonstration test. There was only one opportunity for data acquisition. Thus, a high reliability and crashworthy design approach was implemented. The approach featured multi-level redundancy and a vigorous quality assurance testing program. Complying with an accelerated schedule, the instrumentation system was developed, tested and shipped within 18 months to Dryden Flight Research Facility. The flight instrumentation system consists of two autonomous data systems, DAS #1 and #2, and an excellent checkout subsystem. Each data system is partitioned into four pallets. The system was designed to operate on manned and unmanned flights. There are 176 data channels per data system. These channels are sequentially sampled and encoded into 1 megabit/sec pulse code modulation (PCM) data signal. To increase the probability of success, a special PCM distribution subsystem was developed. This subsystem distributes the PCM signal to two transmitters, one delay memory, and eight recorder tracks. The data on four of these trackes was digitally delayed approximately 300 msec to maximize data acquisition during impact. Therefore each data system's data is redundantly recorded onboard and on the ground. There are two time code generators. Parallel time from each is encoded into both data systems. Serial time from each is redundantly recorded on both onboard recorders. Instrumentation power is independent of aircraft power and self-contained.

Calloway, R. S.↗

Parallel discrete event simulation: A shared memory approach

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.

Reed, Daniel A.↗

A kinematic model of ridge-transform geometry evolution

A simple kinematic model is used to study the effects of various parameters on the evolution of zero-offset transforms and very-long-offset transforms. Consideration is given to the effects of initial configuration, degree of asymmetry, and degree of bias in asymmetry on the generation of these ridge transform geometries and on the possible steady-state nature of the transform length spectra. Of the parameters tests, only lack of 'memory' of zero-offset transforms affects transform length distribution.

Stoddard, Paul R.↗

A petabyte size electronic library using the N-Gram memory engine

A model library containing petabytes of data is proposed by Triada, Ltd., Ann Arbor, Michigan. The library uses the newly patented N-Gram Memory Engine (Neurex), for storage, compression, and retrieval. Neurex splits data into two parts: a hierarchical network of associative memories that store 'information' from data and a permutation operator that preserves sequence. Neurex is expected to offer four advantages in mass storage systems. Neurex representations are dense, fully reversible, hence less expensive to store. Neurex becomes exponentially more stable with increasing data flow; thus its contents and the inverting algorithm may be mass produced for low cost distribution. Only a small permutation operator would be recalled from the library to recover data. Neurex may be enhanced to recall patterns using a partial pattern. Neurex nodes are measures of their pattern. Researchers might use nodes in statistical models to avoid costly sorting and counting procedures. Neurex subsumes a theory of learning and memory that the author believes extends information theory. Its first axiom is a symmetry principle: learning creates memory and memory evidences learning. The theory treats an information store that evolves from a null state to stationarity. A Neurex extracts information data without a priori knowledge; i.e., unlike neural networks, neither feedback nor training is required. The model consists of an energetically conservative field of uniformly distributed events with variable spatial and temporal scale, and an observer walking randomly through this field. A bank of band limited transducers (an 'eye'), each transducer in a bank being tuned to a sub-band, outputs signals upon registering events. Output signals are 'observed' by another transducer bank (a mid-brain), except the band limit of the second bank is narrower than the band limit of the first bank. The banks are arrayed as n 'levels' or 'time domains, td.' The banks are the hierarchical network (a cortex) and transducers are (associative) memories. A model Neurex was built and studied. Data were 50 MB to 10 GB samples of text, data base, and images: black/white, grey scale, and high resolution in several spectral bands. Memories at td, S(m(sub td)), were plotted against outputs of memories at td-1. S(m(sub td)) was Boltzman distributed, and memory frequencies exhibited self-organized criticality (SOC); i.e., 'l/f(sup beta)' after long exposures to data. Whereas output signals from level n may be encoded with B(sub output) = O(-log(2)f(sup beta)) bits, and input data encoded with B(sub input) = O((S(td)/S(td-1))(sup n)), B(sup output)/B(sub input) is much less than 1 always, the Neurex determines a canonical code for data and it is a lossless data compressor. Further tests are underway to confirm these results with more data types and larger samples.

Bugajski, Joseph M.↗

Quantum memory for images: A quantum hologram

Matter-light quantum interface and quantum memory for light are important ingredients of quantum information protocols, such as quantum networks, distributed quantum computation, etc. [P. Zoller et al., Eur. Phys. J. D 36, 203 (2005)]. In this paper we present a spatially multimode scheme for quantum memory for light, which we call a quantum hologram. Our approach uses a multiatom ensemble which has been shown to be efficient for a single spatial mode quantum memory. Due to the multiatom nature of the ensemble and to the optical parallelism it is capable of storing many spatial modes, a feature critical for the present proposal. A quantum hologram with the fidelity exceeding that of classical hologram will be able to store quantum features of an image, such as multimode superposition and entangled quantum states, something that a standard hologram is unable to achieve.

74 ATOMIC AND MOLECULAR PHYSICS↗

Some Problems of Distributed and Boundary Control for Systems with Integral Aftereffect

We consider the problem of exact control for a system described by an equation with integral “memory.” It is shown that, under certain conditions, this system can be brought to rest in finite time by distributed control bounded in absolute value, and, in a special one-dimensional case, by control applied to an end-point of the interval. We consider different types of kernels in the integral term of the equation and describe some relationships between problems of controllability of some hyperbolic and parabolic systems.

97 MATHEMATICS AND COMPUTING↗

Role of atomistic structure in the stochastic nature of conductivity in substoichiometric tantalum pentoxide

First-principles calculations of electrical conductivity (σ{sub o}) are revisited to determine the atomistic origin of its stochasticity in a distribution generated from sampling 14 ab-initio molecular dynamics configurations from 10 independently quenched models (n = 140) of substoichiometric amorphous Ta{sub 2}O{sub 5}, where each structure contains a neutral O monovacancy (V{sub O}{sup 0}). Structural analysis revealed a distinct minimum Ta-Ta separation (dimer/trimer) corresponding to each V{sub O}{sup 0} location. Bader charge decomposition using a commonality analysis approach based on the σ{sub o} distribution extremes revealed nanostructural signatures indicating that both the magnitude and distribution of cationic charge on the Ta subnetwork have a profound influence on σ{sub o}. Furthermore, visualization of local defect structures and their electron densities reinforces these conclusions and suggests σ{sub o} in the amorphous oxide is best suppressed by a highly charged, compact Ta cation shell that effectively screens and minimizes localized V{sub O}{sup 0} interaction with the a-Ta{sub 2}O{sub 5} network; conversely, delocalization of V{sub O}{sup 0} corresponds to metallic character and high σ{sub o}. The random network of a-Ta{sub 2}O{sub 5} provides countless variations of an ionic configuration scaffold in which small perturbations affect the electronic charge distribution and result in a fixed-stoichiometry distribution of σ{sub o}; consequently, precisely controlled and highly repeatable oxide fabrication processes are likely paramount for advancement of resistive memory technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

User-level File Systems Specialized for HPC Workloads Year-End Report

High-performance computing (HPC) clusters attract the attention of Deep Learning (DL) training users due to the clusters' powerful computation capabilities. While there have been many existing efforts to enable deep neural works to leverage the powerful CPU and GPU processors from leadership high-performance computing (HPC) systems, large-scale deep learning with larger datasets requires efficient I/O support from the underlying file and storage systems. As some current and upcoming HPC clusters have large on-node memory or are equipped with NVMe SSD on compute nodes, more distributed DL trainings are considered to leverage those storages to store dataset for efficient dataset access. Our project goal is to design a specialized DL-oriented file system to improve datasets loading performance of any DL training applications. Over the past year, the team at Florida State University has performed research activities in three different aspects, including 1) completing a specialized memory-based I/O framework (DeepIO) for improving dataset loading performance on DL applications; 2) proposing a more generalized file system (DLFS) for DL applications on node-local SSDs; 3) completing the BeeGFS performance evaluation project for Deep Neural Networks.

97 MATHEMATICS AND COMPUTING↗