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,099 records · Page 61

Effects of ZrO{sub 2} doping on HfO{sub 2} resistive switching memory characteristics

A resistive switching (RS) random access memory device with ZrO{sub 2}-doped HfO{sub 2} exhibits better RS performance than that with pure HfO{sub 2}. In particular, I{sub res}, V{sub res}, and V{sub set} are reduced by approximately 58%, 38%, and 39%, respectively, when HfO{sub 2} is doped with ZrO{sub 2} (9 at. %). In addition, the ZrO{sub 2} doping in HfO{sub 2} makes the distribution of most parameters steeper. Transmission electron microscopy (TEM) analysis reveals that the deposited zirconium-doped hafnium oxide (HZO) (9 at. %) is polycrystalline. Elemental mapping results by scanning TEM–energy dispersive spectroscopy also prove that ZrO{sub 2} is uniformly distributed in the HZO (9 at. %) film. The possible mechanism for the improvement in the RS characteristics is also suggested on the basis of the X-ray photoelectron spectroscopy results and filamentary RS mechanism. These results suggest that the ZrO{sub 2} doping into HfO{sub 2} likely not only will reduce power consumption but also will improve cyclic endurance by controlling the nonstoichiometric phase.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Delta size and plant patchiness as controls on channel network organization in experimental deltas

Understanding the feedbacks between water, sediment, and vegetation in deltas is an important part of understanding deltas as ecomorphodynamic systems. Here, we conducted a set of laboratory experiments using alfalfa (Medicago sativa) as a proxy for delta vegetation to investigate (1) the effects of plants on delta growth and channel network formation and (2) the timescales controlling delta evolution in the presence of plants. Experiments were conducted with fluctuating discharge (i.e. flood and base flow periods) and variable seeding densities. We found that when deltas were small, channels had no memory across flood cycles, as floods could completely fill the incised channel network. When deltas were large, the larger channel volume could remain underfilled to keep channel memory. Plant patches also helped to increase the number of channels and make a more distributive network. Patchiness increased over time to continually aid in bifurcation, but as vegetation cover and patch sizes increased, patches began to merge. Larger patches blocked the flow to enhance topset deposition and channel filling, even for the case of large deltas with a high channel volume. We conclude that both plant patchiness and delta size affect the development of the channel network, and we hypothesize that their influences are manifested through two competing timescales. The first timescale, T v , defines the time when the delta is large enough for channels to have memory (i.e., remain underfilled), and the second, T p , defines the time when vegetation patches merge, amplifying deposition and blocking channels. Finally, when run time is between these two timescales, the delta can develop a persistent distributary network of channels aided by bifurcation around plant patches, but once T p is reached, the channel network can again be destroyed by vegetation.

58 GEOSCIENCES↗

Using process groups to implement failure detection in asynchronous environments

Agreement on the membership of a group of processes in a distributed system is a basic problem that arises in a wide range of applications. Such groups occur when a set of processes cooperate to perform some task, share memory, monitor one another, subdivide a computation, and so forth. The group membership problems is discussed as it relates to failure detection in asynchronous, distributed systems. A rigorous, formal specification for group membership is presented under this interpretation. A solution is then presented for this problem.

Ricciardi, Aleta M.↗

Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems

Communication requirements of Cholesky factorization of dense and sparse symmetric, positive definite matrices are analyzed. The communication requirement is characterized by the data traffic generated on multiprocessor systems with local and shared memory. Lower bound proofs are given to show that when the load is uniformly distributed the data traffic associated with factoring an n x n dense matrix using n to the alpha power (alpha less than or equal 2) processors is omega(n to the 2 + alpha/2 power). For n x n sparse matrices representing a square root of n x square root of n regular grid graph the data traffic is shown to be omega(n to the 1 + alpha/2 power), alpha less than or equal 1. Partitioning schemes that are variations of block assignment scheme are described and it is shown that the data traffic generated by these schemes are asymptotically optimal. The schemes allow efficient use of up to O(n to the 2nd power) processors in the dense case and up to O(n) processors in the sparse case before the total data traffic reaches the maximum value of O(n to the 3rd power) and O(n to the 3/2 power), respectively. It is shown that the block based partitioning schemes allow a better utilization of the data accessed from shared memory and thus reduce the data traffic than those based on column-wise wrap around assignment schemes.

Naik, Vijay K.↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this paper, we propose a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on large-scale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

Computer Science↗

NVMalloc: Exposing an Aggregate SSD Store as a Memory Partition in Extreme-Scale Machines

DRAM is a precious resource in extreme-scale machines and is increasingly becoming scarce, mainly due to the growing number of cores per node. On future multi-petaflop and exaflop machines, the memory pressure is likely to be so severe that we need to rethink our memory usage models. Fortunately, the advent of non-volatile memory (NVM) offers a unique opportunity in this space. Current NVM offerings possess several desirable properties, such as low cost and power efficiency, but suffer from high latency and lifetime issues. We need rich techniques to be able to use them alongside DRAM. In this talk, we present a novel approach for exploiting NVM as a secondary memory partition so that applications can explicitly allocate and manipulate memory regions therein. More specifically, we propose an NVMalloc library with a suite of services that enables applications to access a distributed NVM storage system. We have devised ways within NVMalloc so that the storage system, built from compute node-local NVM devices, can be accessed in a byte-addressable fashion using the memory mapped I/O interface. Our approach has the potential to re-energize out-of-core computations on largescale machines by having applications allocate certain variables through NVMalloc, thereby increasing the overall memory capacity available. Our evaluation on a 128-core cluster shows that NVMalloc enables applications to compute problem sizes larger than the physical memory in a cost-effective manner. It can bring more performance/efficiency gain with increased computation time between NVM memory accesses or increased data access locality. In addition, our results suggest that while NVMalloc enables transparent access to NVM-resident variables, the explicit control it provides is crucial to optimize application performance.

99 GENERAL AND MISCELLANEOUS↗

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variably Saturated Flow and Multicomponent Biogeochemical Reactive Transport Modeling of a Uranium Bioremediation Field Experiment

Field experiments at a former uranium mill tailings site have identified the potential for stimulating indigenous bacteria to catalyze the conversion of aqueous uranium in the +6 oxidation state to immobile solid-associated uranium in the +4 oxidation state. This effectively removes uranium from solution resulting in groundwater concentrations below actionable standards. Three-dimensional, coupled variably-saturated flow and biogeochemical reactive transport modeling of a 2008 in situ uranium bioremediation field experiment is used to better understand the interplay of transport rates and biogeochemical reaction rates that determine the location and magnitude of key reaction products. A comprehensive reaction network, developed largely through previous 1-D modeling studies, was used to simulate the impacts on uranium behavior of pulsed acetate amendment, seasonal water table variation, spatially-variable physical (hydraulic conductivity, porosity) and geochemical (reactive surface area) material properties. A principal challenge is the mechanistic representation of biologically-mediated terminal electron acceptor process (TEAP) reactions whose products significantly alter geochemical controls on uranium mobility through increases in pH, alkalinity, exchangeable cations, and highly reactive reduction products. In general, these simulations of the 2008 Big Rusty acetate biostimulation field experiment in Rifle, Colorado confirmed previously identified behaviors including (1) initial dominance by iron reducing bacteria that concomitantly reduce aqueous U(VI), (2) sulfate reducing bacteria that become dominant after {approx}30 days and outcompete iron reducers for the acetate electron donor, (3) continuing iron-reducer activity and U(VI) bioreduction during dominantly sulfate reducing conditions, and (4) lower apparent U(VI) removal from groundwater during dominantly sulfate reducing conditions. New knowledge on simultaneously active metal and sulfate reducers has been incorporated into the modeling. In this case, an initially small population of slow growing sulfate reducers is active from the initiation of biostimulation. Three-dimensional, variably saturated flow modeling was used to address impacts of a falling water table during acetate injection. These impacts included a significant reduction in aquifer saturated thickness and isolation of residual reactants and products, as well as unmitigated uranium, in the newly unsaturated vadose zone. High permeability sandy gravel structures resulted in locally high flow rates in the vicinity of injection wells that increased acetate dilution. In downgradient locations, these structures created preferential flow paths for acetate delivery that enhanced local zones of TEAP reactivity and subsidiary reactions. Conversely, smaller transport rates associated with the lower permeability lithofacies (e.g., fine) and vadose zone were shown to limit acetate access and reaction. Once accessed by acetate, however, these same zones limited subsequent acetate dilution and provided longer residence times that resulted in higher concentrations of TEAP products when terminal electron donors and acceptors were not limiting. Finally, facies-based porosity and reactive surface area variations were shown to affect aqueous uranium concentration distributions; however, the ranges were sufficiently small to preserve general trends. Large computer memory and high computational performance were required to simulate the detailed coupled process models for multiple biogeochemical components in highly resolved heterogeneous materials for the 110-day field experiment and 50 days of post-biostimulation behavior. In this case, a highly-scalable subsurface simulator operating on 128 processor cores for 12 hours was used to simulate each realization. An equivalent simulation without parallel processing would have taken 60 days, assuming sufficient memory was available.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Efficient Multiscale Optoelectronic Prediction for Conjugated Polymers

Conjugated polymers represent a high-potential material class due to the tunability of their optoelectronic properties via straightforward processing protocols. However, to in silico tailor these optoelectronic properties, one must compute the conformationally dependent electronic structure over mesoscopic length and time scales. This task represents a challenging multiscale computational problem in which quantum chemistry and atomistic or coarse-grained molecular dynamics must be integrated. Recently, we introduced a methodology, called electronic coarse graining (ECG), that utilizes artificial neural networks to compute ab initio quality electronic structures using only the reduced degrees of freedom of coarse-grained models. Here, we adapt ECG to variable-molecular weight conjugated oligomers by casting the problem in the framework of sequence detection. A machine-learning (ML) architecture employing one-dimensional convolutional neural networks and long short-term memory networks is utilized to compute ground-state orbital energies, charge density distributions, and optical spectra solely from the coarse-grained model's configurational degrees of freedom. Robust molecular weight transferability for ECG is established via a A-ML approach that leverages model electronic Hamiltonians for ground and excited-state property determination. The accuracy and transferability of the ECG methodology opens the door for scalable optoelectronic property prediction in conjugated polymers directly from coarse-grained degrees of freedom.

36 MATERIALS SCIENCE↗

Deep Learning Reconstruction of Daily Soil CO 2 Efflux Reveals Biogeochemical Insights and Reduces Annual Estimate Uncertainty Despite Limited Daily Predictability

Soil CO 2 efflux is commonly measured monthly or seasonally, leaving daily dynamics poorly resolved and contributing to global estimation uncertainty. We trained a single Long Short-Term Memory (LSTM) model to predict daily soil CO 2 efflux across 82 globally distributed sites in COSORE, with 0.2%–46.9% daily data coverage from 2003 to 2020. Despite using far fewer sites than are typically used to train a single deep learning model, with observations biased toward temperate mesic sites, the LSTM model performed well at approximately one-third of sites, reconstructed nearly 2 decades of daily efflux, and outperformed commonly used approaches for estimating daily efflux when applied to the same data set. Performance was weakest at pronounced peaks and troughs and at non-temperate sites with <1.5 years of observations and irregular data patterns. Nevertheless, annual efflux from reconstructed daily data had <40% error even at underperforming sites, substantially improving estimates derived from monthly and seasonal sampling (maximum errors of 95% and 136%, respectively). Temperature sensitivity (Q 10 ) estimated from reconstructed daily predictions closely matched estimates from daily observations, whereas Q 10 values derived from monthly or seasonal observations deviated substantially, suggesting that coarse temporal sampling may contribute to uncertainty in reported Q 10 values. Consistent daily reconstructions further enabled trend analyses for well-performing, predominantly temperate sites and showed increasing soil CO 2 efflux at most sites from 2003 to 2020, with more variable summer trends. Despite limitations, these results demonstrate the potential of LSTM models to reconstruct daily soil CO 2 efflux and reduce estimation uncertainties from sparse observations.

Smykalov, Valerie [Pennsylvania State University, ↗

NAS - Supercomputing master tool for aeronautics

Features, performance objectives and applications planned for the NASA National Aerodynamics Simulator (NAS) are outlined. NAS was conceived in the 1970s as a means to performing numerical aerodynamic simulations beyond the scope of wind tunnel testing for high-speed flight. Present supercomputers cannot deal with problems exhibiting strongly coupled viscous effects, which are being increasingly more accurately represented by approximations to the full Navier-Stokes equations. Located at the NASA-Ames Center, the NAS will by 1990 comprise a distributed computer network capable of a 4 Gflop computing rate and have a memory capacity of 1 billion 64-bit words. Remote access to the system through UNIX-based microcomputers will be available through land lines and satellite links. New supercomputers will be tested on the system without disturbing ongoing work. The core machine will be a Cray-2 with a 2 Gflop rate.

Bailey, F. R.↗

An exact, closed-form expression of the integral chord-length distribution for the calculation of single-event upsets induced by cosmic rays

This paper presents a derivation of an exact closed-form expression of the integral chord-length distribution for the calculation of single-event upsets (SEUs) in an electronic memory cell, caused by cosmic rays. Results computed for two rectangular parallelepipeds using this exact expression are compared with those computed with Bradford's (1979) semiexact expression of C(x). It is found that the values of C(x) are identical for x equal or smaller than b but are vastly different for x greater than b. Moreover, while C(x) of Bradford gives reasonably accurate values of SEU rate for certain sets of computational parameters, it gives values more than 10 times larger than the correct values for other sets of parameters.

Luke, Keung L.↗

Research in software allocation for advanced manned mission communications and tracking systems

An assessment of the planned processing hardware and software/firmware for the Communications and Tracking System of the Space Station Freedom (SSF) was performed. The intent of the assessment was to determine the optimum distribution of software/firmware in the processing hardware for maximum throughput with minimum required memory. As a product of the assessment process an assessment methodology was to be developed that could be used for similar assessments of future manned spacecraft system designs. The assessment process was hampered by changing requirements for the Space Station. As a result, the initial objective of determining the optimum software/firmware allocation was not fulfilled, but several useful conclusions and recommendations resulted from the assessment. It was concluded that the assessment process would not be completely successful for a system with changing requirements. It was also concluded that memory requirements and hardware requirements were being modified to fit as a consequence of the change process, and although throughput could not be quantitized, potential problem areas could be identified. Finally, inherent flexibility of the system design was essential for the success of a system design with changing requirements. Recommendations resulting from the assessment included development of common software for some embedded controller functions, reduction of embedded processor requirements by hardwiring some Orbital Replacement Units (ORUs) to make better use of processor capabilities, and improvement in communications between software development personnel to enhance the integration process. Lastly, a critical observation was made regarding the software integration tasks did not appear to be addressed in the design process to the degree necessary for successful satisfaction of the system requirements.

Warnagiris, Tom↗

Predictive Modeling in Plasma Reactor and Process Design

Research continues toward the improvement and increased understanding of high-density plasma tools. Such reactor systems are lauded for their independent control of ion flux and energy enabling high etch rates with low ion damage and for their improved ion velocity anisotropy resulting from thin collisionless sheaths and low neutral pressures. Still, with the transition to 300 mm processing, achieving etch uniformity and high etch rates concurrently may be a formidable task for such large diameter wafers for which computational modeling can play an important role in successful reactor and process design. The inductively coupled plasma (ICP) reactor is the focus of the present investigation. The present work attempts to understand the fundamental physical phenomena of such systems through computational modeling. Simulations will be presented using both computational fluid dynamics (CFD) techniques and the direct simulation Monte Carlo (DSMC) method for argon and chlorine discharges. ICP reactors generally operate at pressures on the order of 1 to 10 mTorr. At such low pressures, rarefaction can be significant to the degree that the constitutive relations used in typical CFD techniques become invalid and a particle simulation must be employed. This work will assess the extent to which CFD can be applied and evaluate the degree to which accuracy is lost in prediction of the phenomenon of interest; i.e., etch rate. If the CFD approach is found reasonably accurate and bench-marked with DSMC and experimental results, it has the potential to serve as a design tool due to the rapid time relative to DSMC. The continuum CFD simulation solves the governing equations for plasma flow using a finite difference technique with an implicit Gauss-Seidel Line Relaxation method for time marching toward a converged solution. The equation set consists of mass conservation for each species, separate energy equations for the electrons and heavy species, and momentum equations for the gas. The sheath is modeled by imposing the Bohm velocity to the ions near the walls. The DSMC method simulates each constituent of the gas as a separate species which would be analogous in CFD to employing separate species mass, momentum, and energy equations. All particles including electrons are moved and allowed to collide with one another with the stipulation that the electrons remain tied to the ions consistent with the concept of ambipolar diffusion. The velocities of the electrons are allowed to be modified during collisions and are not confined to a Maxwellian distribution. These benefits come at a price in terms of computational time and memory. The DSMC and CFD are made as consistent as possible by using similar chemistry and power deposition models. Although the comparison of CFD and DSMC is interesting, the main goal of this work is the increased understanding of high-density plasma flowfields that can then direct improvements in both techniques. This work is unique in the level of the physical models employed in both the DSMC and CFD for high-density plasma reactor applications. For example, the electrons are simulated in the present DSMC work which has not been done before for low temperature plasma processing problems. In the CFD approach, for the first time, the charged particle transport (discharge physics) has been self-consistently coupled to the gas flow and heat transfer.

Hash, D. B.↗

Temper Foam

Fabricated by Expanded Rubber & Plastics Corporation, Temper Foam provides better impact protection for airplane passengers and enhances passenger comfort on long flights because it distributes body weight and pressure evenly over the entire contact area. Called a "memory foam" it matches the contour of the body pressing against it and returns to its original shape once the pressure is removed. As a shock absorber, a three-inch foam pad has the ability to absorb the impact of a 10-foot fall by an adult. Applications include seat cushioning for transportation vehicles, padding for furniture and a variety of athletic equipment medical applications including wheelchair padding, artificial limb socket lining, finger splint and hand padding for burn patients, special mattresses for the bedridden and dental stools. Production and sales rights are owned by Temper Foam, Inc. Material is manufactured under license by the Dewey and Almy Division of Grace Chemical Corporation. Distributors of the product are Kees Goebel Medical Specialties, Inc. and Alimed, Inc. They sell Temper Foam in bulk to the fabricators who trim it to shapes required by their customers.

Source record↗

Development of a phonon-based sampling method for thermal neutron scattering data

Simulations of reactor systems require access to accurate nuclear data. For many systems, thermal neutron scattering data can have large effects on the eigenvalue and neutron flux distributions. Inelastic thermal neutron scattering can excite or de-excite vibrational, rotational, and translational modes in a material, so thermal scattering evaluations are often obtained by summing over the number of phonons created/destroyed by a scattering event. In recent years, the thermal scattering cross sections and angular distributions have greatly improved in accuracy, but the format in which this data is delivered to simulation codes has remained virtually unchanged. Thermal scattering data is typically either compiled into large tables and sorted by incoming neutron energy, outgoing neutron energy, scattering angle, and material temperature, or represented as cumulative distribution functions of momentum exchange or energy exchange. Either method can be quite memory intensive when fine bins are used. In an effort to decrease the amount of space that processed thermal scattering data requires, an alternate format is proposed. The phonon-based sampling method introduced here can sample the number of phonons excited for each collision, the change in neutron energy, and the scattering angle while avoiding pre-computed angular bins and limiting the amount of data that is dependent on incoming energy. Through this method, the generation and storage of large interpolation tables is avoided, which could have benefits in both memory storage and accuracy. While the initial implementation of this method is slower than current alternatives, it is significantly more resistant to grid coarseness errors and has good potential for improvement. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Study on the activation of styrene-based shape memory polymer by medium-infrared laser light

This paper demonstrates the feasibility of shape memory polymer (SMP) activation by medium-infrared laser light. Medium-infrared light is transmitted by an optical fiber embedded in the SMP matrix, and the shape recovery process and temperature distribution are recorded by an infrared camera. Light-induced SMP exhibits potential applications in biomedicines and flexible displays.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SharP

The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. along with hierarchical-heterogeneous memory, the system typically has a high-performing network ad a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also for running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models and software layer have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. A programming abstraction to address this problem. The programming abstraction is implemented as a software library and runs on pre-exascale and exascale systems supporting current and emerging system architecture. Using distributed data-structures as a central concept, it provides (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications.

Venkata, Manjunath Gorentla↗