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 919 records · Page 51

Distribution of nanoscale nuclei in the amorphous dome of a phase change random access memory

The nanoscale crystal nuclei in an amorphous Ge{sub 2}Sb{sub 2}Te{sub 5} bit in a phase change memory device were evaluated by fluctuation transmission electron microscopy. The quench time in the device (∼10 ns) afforded more and larger nuclei in the melt-quenched state than in the as-deposited state. However, nuclei were even more numerous and larger in a test structure with a longer quench time (∼100 ns), verifying the prediction of nucleation theory that slower cooling produces more nuclei. It also demonstrates that the thermal design of devices will strongly influence the population of nuclei, and thus the speed and data retention characteristics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A simple and efficient random walk solution of multi-rate mobile/immobile mass transport equations

We extend the particle-tracking method to simulate general multi-rate mass transfer (MRMT) equations. Previous methods for single-rate equations used two-state Markov chains and found that the time a par- ticle spends in the mobile state between waiting time epochs is random and exponentially distributed. Using Bochner's subordination technique for Markov processes, we find that the random mobile times are still exponential for the stochastic process that corresponds to the MRMT equations. The random times in the immobile phase have a distribution that is directly related to the memory function of the MRMT equation. This connection allows us to interpret the MRMT memory function as the rate at which particles of a certain age, measured by residence time in the immobile zone, exit to become mobile once again. Because the exact distributions of mobile and immobile times are known from the MRMT equa- tions, they can be simulated very simply and efficiently using random walks.

58 GEOSCIENCES↗

Experimental investigation of the residues produced in the {sup 136}Xe+Pb and {sup 124}Xe+Pb fragmentation reactions at 1A GeV

The nuclide cross sections and longitudinal velocity distributions of residues produced in the reactions of {sup 136}Xe and {sup 124}Xe at 1A GeV in a lead target were measured at the high-resolution magnetic spectrometer, the fragment separator (FRS) of GSI. The data cover a broad range of isotopes of the elements between Z=3 and Z=56 for {sup 136}Xe and between Z=5 and Z=55 for {sup 124}Xe, reaching down to cross sections of a few microbarns. The velocity distributions exhibit a Gaussian shape for masses above A=20, while more complex behavior is observed for lighter masses. The isotopic distributions for both reactions preserve a memory on the projectile N/Z ratio over the whole residue mass range.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dark matter transfer function: Free streaming, particle statistics, and memory of gravitational clustering

The transfer function T(k) of dark matter (DM) perturbations during matter domination is obtained by solving the linearized collisionless Boltzmann-Vlasov equation. We provide an exact expression for T(k) for arbitrary distribution functions of decoupled particles and initial conditions, which can be systematically expanded in a Fredholm series. An exhaustive numerical study of thermal relics for different initial conditions reveals that the first two terms in the expansion of T(k) provide a remarkably accurate and simple approximation valid on all scales of cosmological relevance for structure formation in the linear regime. The natural scale of suppression is the free-streaming wave vector at matter-radiation equality, k{sub fs}(t{sub eq})=[4{pi}{rho}{sub 0M}/[<V-vector{sup 2}>(1+z{sub eq})]]{sup 1/2}. An important ingredient is a nonlocal kernel determined by the distribution functions of the decoupled particles which describes the memory of the initial conditions and gravitational clustering and yields a correction to the fluid description. This correction is negligible at large scales k<<k{sub fs}(t{sub eq}) but it becomes important at small scales k{>=}k{sub fs}(t{sub eq}). Distribution functions that favor the small momentum region yield longer-range memory kernels and lead to an enhancement of power at small scales k>k{sub fs}(t{sub eq}). Fermi-Dirac and Bose-Einstein statistics lead to long-range memory kernels, with longer-range for bosons, both resulting in enhancement of T(k) at small scales. For DM thermal relics that decoupled while ultrarelativistic we find k{sub fs}(t{sub eq}){approx_equal}0.003(g{sub d}/2){sup 1/3} (m/keV) [kpc]{sup -1}, where g{sub d} is the number of degrees of freedom at decoupling. For WIMPS we obtain k{sub fs}(t{sub eq})=5.88(g{sub d}/2){sup 1/3} (m/100 GeV){sup 1/2} (T{sub d}/10 MeV){sup 1/2} [pc]{sup -1}. For k<<k{sub fs}(t{sub eq}), T(k){approx}1-C[k/k{sub fs}(t{sub eq})]{sup 2} where C=O(1) and independent of statistics for thermal relics. We provide simple and accurate fits for T(k) in a wide range of small scales k>k{sub fs}(t{sub eq}) for thermal relics and different initial conditions. The numerical and analytic results for arbitrary distribution functions and initial conditions allow an assessment of DM candidates through their impact on structure formation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multiplexed color centers in a silicon photonic cavity array

Entanglement distribution is central to the modular scaling of quantum processors and establishing quantum networks. Color centers with telecom-band transitions and long spin coherence times are suitable candidates for long-distance entanglement distribution. However, high-bandwidth memory-enhanced quantum communication is limited by high-yield, scalable creation of efficient spin-photon interfaces. Here, we develop a silicon photonics platform consisting of arrays of bus-coupled cavities. The coupling to a common bus waveguide enables simultaneous access to individually addressable cavity-enhanced T center arrays. We demonstrate frequency-multiplexed operation of two T centers in separate photonic crystal cavities. In addition, we investigate the cavity enhancement of a T center through hybridized modes formed between physically distant cavities. Our results show that bus-coupled arrays of cavity-enhanced color centers could enable efficient on-chip and long-distance entanglement distribution.

Komza, Lukasz↗

Theory and modeling of atmospheric turbulence, part 1

The cascade transfer which is the only function to describe the mode coupling as the result of the nonlinear hydrodynamic state of turbulence is discussed. A kinetic theory combined with a scaling procedure was developed. The transfer function governs the non-linear mode coupling in strong turbulence. The master equation is consistent with the hydrodynamical system that describes the microdynamic state of turbulence and has the advantages to be homogeneous and have fewer nonlinear terms. The modes are scaled into groups to decipher the governing transport processes and statistical characteristics. An equation of vorticity transport describes the microdynamic state of two dimensional, isotropic and homogeneous, geostrophic turbulence. The equation of evolution of the macrovorticity is derived from group scaling in the form of the Fokker-Planck equation with memory. The microdynamic state of turbulence is transformed into the Liouville equation to derive the kinetic equation of the singlet distribution in turbulence. The collision integral contains a memory, which is analyzed with pair collision and the multiple collision. Two other kinetic equations are developed in parallel for the propagator and the transition probability for the interaction among the groups.

Source record↗

Clustering properties of a sterile neutrino dark matter candidate

The clustering properties of sterile neutrinos are studied within a simple extension of the minimal standard model, where these neutrinos are produced via the decay of a gauge singlet scalar. The distribution function after decoupling is strongly out of equilibrium and features an enhancement at small comoving momentum {proportional_to}1/{radical}(p). Dark matter abundance and phase space density constraints from dwarf spheroidal galaxies constrain the mass in the keV range consistent with a Yukawa coupling to a gauge singlet with mass and vacuum expectation value in the range {approx}100 GeV and a decoupling temperature of this order. The dark matter transfer function and power spectrum are obtained from the solution of the nonrelativistic Boltzmann-Vlasov equation in the matter dominated era. The small momentum enhancement of the nonequilibrium distribution function leads to long range memory of gravitational clustering and a substantial enhancement of the power spectrum at small scales as compared to a thermal relic or sterile neutrino produced via nonresonant mixing with active neutrinos. The scale of suppression of the power spectrum for a sterile neutrino with m{approx}keV produced by scalar decay that decouples at {approx}100 GeV is {lambda}{approx}488 kpc. At large scales T(k){approx}1-Ck{sup 2}/k{sub fs}{sup 2}(t{sub eq})+{center_dot}{center_dot}{center_dot} with C{approx}O(1). At small scales 65 kpc < or approx. {lambda} < or approx. 500 kpc corrections to the fluid description and memory of gravitational clustering become important, and we find T(k){approx_equal}1.902e{sup -k/k{sub fs}(t{sub eq})}, where k{sub fs}(t{sub eq}){approx}0.013/kpc is the free-streaming wave vector at matter-radiation equality. The enhancement of power at small scales may provide possible relief to the tension between the constraints from x-ray and Lyman-{alpha} forest data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗

Quantitative Analysis of Charge Injection and Discharging of Si Nanocrystals and Arrays by Electrostatic Force Microscopy

NASA requirements for computing and memory for microspacecraft emphasize high density, low power, small size, and radiation hardness. The distributed nature of storage elements in nanocrystal floating-gate memories leads to intrinsic fault tolerance and radiation hardness. Conventional floating-gate non-volatile memories are more susceptible to radiation damage. Nanocrystal-based memories also offer the possibility of faster, lower power operation. In the pursuit of filling these requirements, the following tasks have been accomplished: (1) Si nanocrystal charging has been accomplished with conducting-tip AFM; (2) Both individual nanocrystals on an oxide surface and nanocrystals formed by implantation have been charged; (3) Discharging is consistent with tunneling through a field-lowered oxide barrier; (4) Modeling of the response of the AFM to trapped charge has allowed estimation of the quantity of trapped charge; and (5) Initial attempts to fabricate competitive nanocrystal non-volatile memories have been extremely successful.

Bell, L. D.↗

Scalable Transparent Checkpoint-Restart of Global Address Space Applications on Virtual Machines over Infiniband

Checkpoint-Restart is one of the most used software approaches to achieve fault-tolerance in high-end clusters. While standard techniques typically focus on user-level solutions, the advent of virtualization software has enabled efficient and transparent system-level approaches. In this paper, we present a scalable transparent system-level solution to address fault-tolerance for applications based on global address space (GAS) programming models on Infiniband clusters. In addition to handling communication, the solution addresses transparent checkpoint of user-generated files. We exploit the support for the Infiniband network in the Xen virtual machine environment. We have developed a version of the Aggregate Remote Memory Copy Interface (ARMCI) one-sided communication library capable of suspending and resuming applications. We present efficient and scalable mechanisms to distribute checkpoint requests and to backup virtual machines memory images and file systems. We tested our approach in the context of NWChem, a popular computational chemistry suite. We demonstrated that NWChem can be executed, without any modification to the source code, on a virtualized 8-node cluster with very little overhead (below 3%). We observe that the total checkpoint time is limited by disk I/O. Finally, we measured system-size depended components of the checkpoint time on up to 1024 cores (128 nodes), demonstrating the scalability of our approach in medium/large-scale systems.

97 MATHEMATICS AND COMPUTING↗

UNITY: Unified Memory and Storage Space

UNITY is a 36-month project focused on providing design and evaluate a new distributed storage paradigm that unifies the traditionally distinct application views of memory- and file-based data storage into a single scalable and resilient environment. The project is a collaboration among Oak Ridge National Laboratory (ORNL, Lead institution), Los Alamos National Labs (LANL), and Georgia Tech (GT). The main contributions of the GT team have been around development of low level systems software for best leveraging the capabilities of new types of persistent memory technologies, and for development of methods for intelligent data management across memory/storage substrates with heterogeneous components. GT contributed the Phoenix library for optimized checkpoint/restart for HPC I/O for systems with non-volatile memory (NVM), the NVStream library for NVM-specialized streaming I/O for HPC workflows, the CoMerge, Mnemo and Kleio solutions for intelligent data management on NVM-based systems. These contributions result in significant improvements in both application performance and system efficiency.

97 MATHEMATICS AND COMPUTING↗

Reusable, Extensible High-Level Data-Distribution Concept

A framework for high-level specification of data distributions in data-parallel application programs has been conceived. [As used here, distributions signifies means to express locality (more specifically, locations of specified pieces of data) in a computing system composed of many processor and memory components connected by a network.] Inasmuch as distributions exert a great effect on the performances of application programs, it is important that a distribution strategy be flexible, so that distributions can be adapted to the requirements of those programs. At the same time, for the sake of productivity in programming and execution, it is desirable that users be shielded from such error-prone, tedious details as those of communication and synchronization. As desired, the present framework enables a user to refine a distribution type and adjust it to optimize the performance of an application program and conceals, from the user, the low-level details of communication and synchronization. The framework provides for a reusable, extensible, data-distribution design, denoted the design pattern, that is independent of a concrete implementation. The design pattern abstracts over coding patterns that have been found to be commonly encountered in both manually and automatically generated distributed parallel programs. The following description of the present framework is necessarily oversimplified to fit within the space available for this article. Distributions are among the elements of a conceptual data-distribution machinery, some of the other elements being denoted domains, index sets, and data collections (see figure). Associated with each domain is one index set and one distribution. A distribution class interface (where "class" is used in the object-oriented-programming sense) includes operations that enable specification of the mapping of an index to a unit of locality. Thus, "Map(Index)" specifies a unit, while "LocalLayout(Index)" specifies the local address within that unit. The distribution class can be extended to enable specification of commonly used distributions or novel user-defined distributions. A data collection can be defined over a domain. The term "data collection" in this context signifies, more specifically, an abstraction of mappings from index sets to variables. Since the index set is distributed, the addresses of the variables are also distributed.

James, Mark↗

Authenticating cache

The aim of the Authenticating Cache architecture is to ensure that machine instructions in a Read Only Memory (ROM) are legitimate from the time the ROM image is signed (immediately after compilation) to the time they are placed in the cache for the processor to consume. The proposed architecture allows the detection of ROM image modifications during distribution or when it is loaded into memory. It also ensures that modified instructions will not execute in the processor-as the cache will not be loaded with a page that fails an integrity check. The authenticity of the instruction stream can also be verified in this architecture. The combination of integrity and authenticity assurance greatly improves the security profile of a system.

97 MATHEMATICS AND COMPUTING↗

Persistent Octrees for Parallel Mesh Refinement Through Non-Volatile Byte-Addressable Memory

We report that octree-based mesh adaptation has enabled simulations of complex physical phenomena. Existing meshing algorithms were proposed with the assumption that computer memory is volatile. Consequently, for failure recovery, the in-core algorithms need to save memory states as snapshots with slow file I/Os. The out-of-core algorithms store octants on disks for persistence. However, neither of them was designed to leverage unique characteristics of non-volatile byte-addressable memory (NVBM). In this paper, we propose a novel data structure Distributed Persistent Merged octree (DPM-octree) for both meshing and in-memory storage of persistent octrees using NVBM. It is a multi-version data structure and can recover from failures using its earlier persistent version stored in NVBM. In addition, we design a feature-directed sampling approach to help dynamically transform the DPM-octree layout for reducing NVBM-induced memory write latency. DPM-octree uses parity trees which are created using erasure coding and stored in NVBM to support low-latency in-memory octant recovery after data loss. DPM-octree has been successfully integrated with Gerris software for simulation of fluid dynamics. Finally, our experimental results with real-world scientific workloads show that DPM-octree scales up to 1.1 billion mesh elements with 1000 processors on the Titan supercomputer.

97 MATHEMATICS AND COMPUTING↗

Distributed seams for gigapixel panoramas

Gigapixel panoramas are an increasingly popular digital image application. They are often created as a mosaic of many smaller images. The mosaic acquisition can take many hours causing the individual images to differ in exposure and lighting conditions. A blending operation is often necessary to give the appearance of a seamless image. The blending quality depends on the magnitude of discontinuity along the image boundaries. Often, new boundaries, or seams, are first computed that minimize this transition. Current techniques based on multi-labeling Graph Cuts are too slow and memory intensive for gigapixel sized panoramas. In this paper, we present a parallel, out-of-core seam computing technique that is fast, has small memory footprint, and is capable of running efficiently on different types of parallel systems. Its maximum memory usage is configurable, in the form of a cache, which can improve performance by reducing redundant disk I/O and computations. It shows near-perfect scaling on symmetric multiprocessing systems and good scaling on clusters and distributed shared memory systems. Lastly, our technique improves the time required to compute seams for gigapixel imagery from many hours (or even days) to just a few minutes, while still producing boundaries with energy that is on-par with Graph Cuts.

97 MATHEMATICS AND COMPUTING↗

A Communication-Optimal Framework for Contracting Distributed Tensors

Tensor contractions are extremely compute intensive generalized matrix multiplication operations encountered in many computational science fields, such as quantum chemistry and nuclear physics. Unlike distributed matrix multiplication, which has been extensively studied, limited work has been done in understanding distributed tensor contractions. In this paper, we characterize distributed tensor contraction algorithms on torus networks. We develop a framework with three fundamental communication operators to generate communication-efficient contraction algorithms for arbitrary tensor contractions. We show that for a given amount of memory per processor, our framework is communication optimal for all tensor contractions. We demonstrate performance and scalability of our framework on up to 262,144 cores of BG/Q supercomputer using five tensor contraction examples.

communication efficiency↗

The Development of a Generalized Riser Flow Regime Map Based Upon Higher Moment and Chaotic Statistics Using Electrical Capacitance Volume Tomography (ECVT)

Dynamic analyses have been applied to the temporal signals from an Electro Capacitance Volume Tomography instrument located near mid-height on the riser of an industrial-scale cold-flow circulating fluidized bed to characterize gas-solids flow behavior in the riser. Twelve capacitance electrodes surround the cylindrical riser over a height of 1.3 m. The instrument used a neural network deconvolution algorithm to determine the spatially resolved solids fraction recorded at 52 Hz. Experiments were carried out over a range of gas and solids flows in the transport regime using a Geldart Group B bed material, high density polyethylene with mean particle size of 880 μm. The radial solids distribution was found to vary from one-time step to the next between profiles typical of laminar and turbulent flow. The duration of time spent in each of these flow profiles depended upon the operating regime – dilute, core-annular, or fast fluidized bed. The chaotic structure of the temporal data was characterized using the three conventional approaches: the first 4 moments from the distribution of signal in time, system memory parameters from the autocorrelation function and the Hurst exponent, and analysis of the correlationentropy and correlation dimension of the attractor. These signal analysis techniques were used to clearly distinguish differences between different transport operating regimes. Specifically, it was experimentally observed that a riser transitions from core annular flow profile to dilute and dense regimes via increasing the frequency of short term transients to either dilute or dense flow profiles, respectively. A regime map was generated based upon these dynamics using solids flux and gas velocity axes. Fast fluidized, core annular, and dilute each exhibited different degree of dynamic characteristics typical of fluid dominated or particle compromising behavior. It should be noted that the magnitude for the different statistics was in the same range regardless of the regime, it was the radial profile for the statistic that changed and subsequently identified that there was a change in the regime. Finally, a reduced regime map was developed consisting of plotting the gas velocity normalized by the upper transport velocity versus the solids flux normalized by the saturation carrying capacity. The use of this reduced plot allowed the data from widely different conditions to be plotted and compared on the same<p>graph. Note that in many instances, some of the statistics identified the operating point as being in one regime while others indicated that it was in another indicating a transition region between dilute or core annular regimes and between the core annular and fast fluidization regimes. This now provides a tool that can be used to optimize process performance, identify changes in operating states, or replicate process dynamics during process scaling or changing operating parameters. </p>

Breault, Ronald↗

Impact of Random Spatial Fluctuation in Non-Uniform Crystalline Phases on the Device Variation of Ferroelectric FET

In this work, a comprehensive study of random spatial fluctuation of the ferroelectric (FE) phase and dielectric (DE) phase in FeFETs is conducted to understand its impact on device variation. It is found that: i) there exists a certain DE percentage threshold that below which the increase of the DE phase does not significantly impact the device memory window and variation and only above which evident device degradation can be observed; ii) increasing the DE phase increases the variation in the memory window and the coercive field distribution further exacerbates the variation, hence degrading the sensing margin; iii) decreasing the number of grains degrades the device variation, which calls for further grain size engineering for variation suppression.

42 ENGINEERING↗