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 991 records · Page 55

Dense LU Factorization on Multicore Supercomputer Nodes

Dense LU factorization is a prominent benchmark used to rank the performance of supercomputers. Many implementations, including the reference code HPL, use block-cyclic distributions of matrix blocks onto a two-dimensional process grid. The process grid dimensions drive a trade-off between communication and computation and are architecture- and implementation-sensitive. We show how the critical panel factorization steps can be made less communication-bound by overlapping asynchronous collectives for pivot identification and exchange with the computation of rank-k updates. By shifting this trade-off, a modified block-cyclic distribution can beneficially exploit more available parallelism on the critical path, and reduce panel factorization's memory hierarchy contention on now-ubiquitous multi-core architectures. The missed parallelism in traditional block-cyclic distributions arises because active panel factorization, triangular solves, and subsequent broadcasts are spread over single process columns or rows (respectively) of the process grid. Increasing one dimension of the process grid decreases the number of distinct processes in the other dimension. To increase parallelism in both dimensions, periodic 'rotation' is applied to the process grid to recover the row-parallelism lost by a tall process grid. During active panel factorization, rank-1 updates stream through memory with minimal reuse. In a column-major process grid, the performance of this access pattern degrades as too many streaming processors contend for access to memory. A block-cyclic mapping in the more popular row-major order does not encounter this problem, but consequently sacrifices node and network locality in the critical pivoting steps. We introduce 'striding' to vary between the two extremes of row- and column-major process grids. As a test-bed for further mapping experiments, we describe a dense LU implementation that allows a block distribution to be defined as a general function of block to processor. Other mappings can be tested with only small, local changes to the code.

99 GENERAL AND MISCELLANEOUS↗

Temporal Forecasting of Distributed Temperature Sensing in a Thermal Hydraulic System With Machine Learning and Statistical Models

We benchmark performance of long-short term memory (LSTM) network machine learning model and autoregressive integrated moving average (ARIMA) statistical model in temporal forecasting of distributed temperature sensing (DTS). Data in this study consists of fluid temperature transient measured with two co-located Rayleigh scattering fiber optic sensors (FOS) in a forced convection mixing zone of a thermal tee. We treat each gauge of a FOS as an independent temperature sensor. We first study prediction of DTS time series using Vanilla LSTM and ARIMA models trained on prior history of the same FOS that is used for testing. The results yield maximum absolute percentage error (MaxAPE) and root mean squared percentage error (RMSPE) of 1.58% and 0.06% for ARIMA, and 3.14% and 0.44% for LSTM, respectively. Next, we investigate zero-shot forecasting (ZSF) with LSTM and ARIMA trained on history of the co-located FOS only, which is advantageous when limited training data is available. The ZSF MaxAPE and RMSPE values for ARIMA are comparable to those of the Vanilla use case, while the error values for LSTM increase. We show that in ZSF, performance of LSTM network can be improved by training on most correlated gauges between the two FOS, which are identified by calculating the Pearson correlation coefficient. The improved ZSF MaxAPE and RMSPE for LSTM are 4.4% and 0.33%, respectively. Performance of ZSF LSTM can be further enhanced through transfer learning (TL), where LSTM is re-trained on a subset of the FOS that is the target of forecasting. We show that LSTM pre-trained on correlated dataset and re-trained on 30% of testing target dataset achieves MaxAPE and RMSPE values of 2.32% and 0.28%, respectively.

ARIMA↗

In-Place Zero-Space Memory Protection for CNN

Convolutional Neural Networks (CNN) are being actively explored for safetycritical applications such as autonomous vehicles and aerospace, where it is essential to ensure the reliability of inference results in the presence of possible memory faults. Traditional methods such as error correction codes (ECC) and Triple Modular Redundancy (TMR) are CNN-oblivious and incur substantial memory overhead and energy cost. This paper introduces in-place zero-space ECC assisted with a new training scheme weight distribution-oriented training. The new method provides the first known zero space cost memory protection for CNNs without compromising the reliability offered by traditional ECC.

Guan, Hui↗

Arithmetic Data Cube as a Data Intensive Benchmark

Data movement across computational grids and across memory hierarchy of individual grid machines is known to be a limiting factor for application involving large data sets. In this paper we introduce the Data Cube Operator on an Arithmetic Data Set which we call Arithmetic Data Cube (ADC). We propose to use the ADC to benchmark grid capabilities to handle large distributed data sets. The ADC stresses all levels of grid memory by producing 2d views of an Arithmetic Data Set of d-tuples described by a small number of parameters. We control data intensity of the ADC by controlling the sizes of the views through choice of the tuple parameters.

Frumkin, Michael A.↗

Computationally efficient implementation of combustion chemistry in parallel PDF calculations

In parallel calculations of combustion processes with realistic chemistry, the serial in situ adaptive tabulation (ISAT) algorithm [S.B. Pope, Computationally efficient implementation of combustion chemistry using in situ adaptive tabulation, Combustion Theory and Modelling, 1 (1997) 41-63; L. Lu, S.B. Pope, An improved algorithm for in situ adaptive tabulation, Journal of Computational Physics 228 (2009) 361-386] substantially speeds up the chemistry calculations on each processor. To improve the parallel efficiency of large ensembles of such calculations in parallel computations, in this work, the ISAT algorithm is extended to the multi-processor environment, with the aim of minimizing the wall clock time required for the whole ensemble. Parallel ISAT strategies are developed by combining the existing serial ISAT algorithm with different distribution strategies, namely purely local processing (PLP), uniformly random distribution (URAN), and preferential distribution (PREF). The distribution strategies enable the queued load redistribution of chemistry calculations among processors using message passing. They are implemented in the software x2f{sub m}pi, which is a Fortran 95 library for facilitating many parallel evaluations of a general vector function. The relative performance of the parallel ISAT strategies is investigated in different computational regimes via the PDF calculations of multiple partially stirred reactors burning methane/air mixtures. The results show that the performance of ISAT with a fixed distribution strategy strongly depends on certain computational regimes, based on how much memory is available and how much overlap exists between tabulated information on different processors. No one fixed strategy consistently achieves good performance in all the regimes. Therefore, an adaptive distribution strategy, which blends PLP, URAN and PREF, is devised and implemented. It yields consistently good performance in all regimes. In the adaptive parallel ISAT strategy, the type and extent of redistribution is determined 'on the fly' based on the prediction of future simulation time. Compared to the PLP/ISAT strategy where chemistry calculations are essentially serial, a speed-up factor of up to 30 is achieved. The study also demonstrates that the adaptive strategy has acceptable parallel scalability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.↗