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 793 records · Page 44

High Damping of Lightweight TiNi-Ti{sub 2}Ni Shape Memory Composites for Wide Temperature Range Usage

A bimodal porous TiNi-Ti{sub 2}Ni shape memory alloy composite (SMAC) with 59% porosity was fabricated by sintering Ti-46at.%Ni elemental powders with pore-forming agent. The porous TiNi-Ti{sub 2}Ni SMAC contains two irregular pores of about 400 and 120 μm. We investigated the microstructure and pore morphology correlated with the mechanical properties and damping capacities of the SMAC. Ti{sub 2}Ni intermetallic phases with size of 1-3 μm were homogeneously distributed in the TiNi matrix. The porous TiNi-Ti{sub 2}Ni SMAC exhibits exceptionally high inverse mechanical quality factor (Q{sup −1}) of ~0.25 at < 40 °C, which is among the highest value reported for porous/dense shape memory alloys or composites to best of our knowledge, and it shows very high compressive fracture strain of about 25%. Moreover, the fabricated porous SMAC at relatively low strain amplitude can exhibit considerable high Q{sup −1} of 0.06 ~ 0.11 for a wide range of temperature between − 90 and 200 °C, which is attributed to the stress concentration distribution provided by the bimodal structure of pores and the massive interfaces between pore/matrix and TiNi/Ti{sub 2}Ni. These porous SMACs can be an ideal candidate for using as a lightweight damping material in the energy-saving applications.

36 MATERIALS SCIENCE↗

Reducing uncertainty in personnel dosimetry calculations in the VHTR plant using MAVRIC

This work analyzes the efficacy of the MAVRIC sequence of the Scale 6.1 code package with respect to the accuracy of results and the ability to utilize large-memory, parallel machines. MAVRIC implements the hybrid FW-CADIS methodology to solve neutron and photon transport for shielding applications. Using the discrete ordinates method to solve the Boltzmann transport equation, an importance map is generated which MAVRIC then uses to bias a stochastic Monte Carlo simulation. The MAVRIC sequence is applied to generate neutron and photon dose rate distributions of improved accuracy in a model of a proposed VHTR power plant. Problems like this one, with a size on the order of magnitude of a nuclear power plant, require a prohibitive amount of memory to store complete importance maps. The issue is addressed by refining the mesh in areas around the source through the detector regions, while leaving a coarse mesh elsewhere. Additionally through the use of parallel computing, the angular flux can be expanded in higher quadrature sets, which leads to a better importance map while requiring no extra memory requirements during the Monte Carlo portion of the sequence. The final Monte Carlo simulations can be run concurrently on several machines with results combined after the fact, emulating parallelism that is not yet available in MAVRIC sequence. Using a combination of strategies, the MAVRIC sequence is shown to be able to scale across available computational resources, allowing the user to more quickly obtain Monte Carlo results with lower relative uncertainties in large, deep-penetration shielding problems. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

High-Q cavity interface for color centers in thin film diamond

Quantum information technology offers the potential to realize unprecedented computational resources via secure channels distributing entanglement between quantum computers. Diamond, as a host to optically-accessible spin qubits, is a leading platform to realize quantum memory nodes needed to extend such quantum links. Photonic crystal (PhC) cavities enhance light-matter interaction and are essential for an efficient interface between spins and photons that are used to store and communicate quantum information respectively. Here, we demonstrate one- and two-dimensional PhC cavities fabricated in thin-film diamonds, featuring quality factors (Q) of 1.8 × 10 5 and 1.6 × 10 5 , respectively, the highest Qs for visible PhC cavities realized in any material. Importantly, our fabrication process is simple and high-yield, based on conventional planar fabrication techniques, in contrast to the previous with complex undercut processes. We also demonstrate fiber-coupled 1D PhC cavities with high photon extraction efficiency, and optical coupling between a single SiV center and such a cavity at 4 K achieving a Purcell factor of 18. The demonstrated photonic platform may fundamentally improve the performance and scalability of quantum nodes and expedite the development of related technologies.

97 MATHEMATICS AND COMPUTING↗

In-situ high resolution transmission electron microscopy observation of silicon nanocrystal nucleation in a SiO{sub 2} bilayered matrix

Solid-state nucleation of Si nanocrystals in a SiO{sub 2} bilayered matrix was observed at temperatures as low as 450 °C. This was achieved by aberration corrected high-resolution transmission electron microscopy (HRTEM) with real-time in-situ heating up to 600 °C. This technique is a valuable characterization tool especially with the recent interest in Si nanostructures for light emitting devices, non-volatile memories, and third-generation photovoltaics which all typically require a heating step in their fabrication. The control of size, shape, and distribution of the Si nanocrystals are critical for these applications. This experimental study involves in-situ observation of the nucleation of Si nanocrystals in a SiO{sub 2} bilayered matrix fabricated through radio frequency co-sputtering. The results show that the shapes of Si nanocrystals in amorphous SiO{sub 2} bilayered matrices are irregular and not spherical, in contrast to many claims in the literature. Furthermore, the Si nanocrystals are well confined within their layers by the amorphous SiO{sub 2}. This study demonstrates the potential of in-situ HRTEM as a tool to observe the real time nucleation of Si nanocrystals in a SiO{sub 2} bilayered matrix. Furthermore, ideas for improvements on this in-situ heating HRTEM technique are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

UPC++ V1.0

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE's Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

ECP↗

UPC++ Specification v1.0, Draft 4

UPC++ is a C++11 library providing classes and functions that support Asynchronous Partitioned Global Address Space (APGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

UPC++ Specification v1.0, Draft 6

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

UPC++ Specification v1.0, Draft 10

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

UPC++ v1.0 Specification (Revision 2019.9.0)

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

UPC++ Specification v1.0, Draft 8

UPC++ is a C++11 library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. We are revising the library under the auspices of the DOE’s Exascale Computing Project, to meet the needs of applications requiring PGAS support. UPC++ is intended for implementing elaborate distributed data structures where communication is irregular or fine-grained. The UPC++ interfaces for moving non-contiguous data and handling memories with different optimal access methods are composable and similar to those used in conventional C++. The UPC++ programmer can expect communication to run at close to hardware speeds. The key facilities in UPC++ are global pointers, that enable the programmer to express ownership information for improving locality, one-sided communication, both put/get and RPC, futures and continuations. Futures capture data readiness state, which is useful in making scheduling decisions, and continuations provide for completion handling via callbacks. Together, these enable the programmer to chain together a DAG of operations to execute asynchronously as high-latency dependencies become satisfied.

97 MATHEMATICS AND COMPUTING↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

Effect of sintering temperature on the optical properties of BiFeO{sub 3} nanoparticles

BiFeO{sub 3} is a multiferroic material which exhibits excellent optical properties. BiFeO{sub 3} nanoparticles are synthesized by using sol-gel method. The prepared samples are sintered at 500°C, 600°C, 700°C, 800°C and 850°C. In this paper, the effect of sintering temperature on the optical properties in BiFeO{sub 3} nanoparticles is studied. Field emission electron microscopy (FESEM) images show that particles are nearly spherical in shape. It is found that the particles size increases from 37 nm to 51 nm with increasing the sintering temperature. FESEM images also reveal a homogenous size distribution of nanoparticles. All the functional groups are indexed in the Fourier transform infrared spectroscopy (FTIR) spectra. It is found that Fe-O stretching peaks are appeared in the wave number range 447 and 507 cm{sup −1}. The value of energy band gap are found 2.14, 2.26, 2.30, 2.36, and 2.54 eV for the samples sintered at 500°C, 600°C, 700°C, 800°C and 850°C respectively. Thus, the increase in band gap with increasing temperature has been observed. The present samples can be used as photo-catalyst, in non-volatile memories and to make spintronics devices.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Knowledge-guided graph machine learning for spatially distributed prediction of daily discharge and nitrogen export dynamics

Spatially distributed prediction of streamflow and nitrogen export dynamics is essential for precision management of agricultural watersheds. While temporal deep learning models such as Long Short-Term Memory (LSTM) have shown strong performance at basin scales, their ability to generalize spatially is limited by insufficient representation of spatial dependencies and flow paths, particularly under data-scarce conditions. To address this gap, we propose HydroGraphNet, a knowledge-guided graph machine learning framework that integrates process-based knowledge and explicit spatial learning into temporal modeling. This framework incorporates directed graph topology to encode watershed connectivity and upstream inflows, with mass balance constraints to improve physical consistency. To enhance generalization in sparsely monitored regions, HydroGraphNet is pretrained on synthetic data generated by the SWAT+ (Soil and Water Assessment Tool Plus) model. We evaluated HydroGraphNet in the Upper Sangamon River Basin (44 HUC-12 subwatersheds, 2001–2020) against two LSTM baselines: a lumped basin-level model and a distributed variant. When benchmarked on SWAT+ simulations in pretraining, HydroGraphNet improved test NSEs by 8.9% (discharge) and 13.7% (NO₃–N load) in temporal extrapolation, and by 27.1% and 34.7% in spatial extrapolation, relative to the Lumped LSTM baseline. After fine-tuning with USGS monitoring data, the model achieved mean test NSE (KGE) scores of 0.768 (0.861) for discharge and 0.626 (0.664) for NO₃–N load, substantially outperforming baselines. Attribution analysis further highlighted the importance of upstream inflow representation and graph-based spatial learning in capturing cross-subwatershed dependencies. The model also reproduced seasonal hydrological and biogeochemical patterns consistent with known processes, demonstrating its robustness and process fidelity for spatially distributed prediction. Altogether, HydroGraphNet advances the integration of physical knowledge and spatially explicit learning in hydrological modeling, offering a generalizable framework for distributed modeling to support spatially targeted water quality management in data-scarce watersheds.

54 ENVIRONMENTAL SCIENCES↗

Method, memory media and apparatus for detection of grid disconnect

A phase shift procedure for detecting a disconnect of a power grid from a feeder that is connected to a load and a distributed generator. The phase shift procedure compares a current phase shift of the output voltage of the distributed generator with a predetermined threshold and if greater, a command is issued for a disconnect of the distributed generator from the feeder. To extend the range of detection, the phase shift procedure is used when a power mismatch between the distributed generator and the load exceeds a threshold and either or both of an under/over frequency procedure and an under/over voltage procedure is used when any power mismatch does not exceed the threshold.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Latent uncertainties of the precalculated track Monte Carlo method

Purpose: While significant progress has been made in speeding up Monte Carlo (MC) dose calculation methods, they remain too time-consuming for the purpose of inverse planning. To achieve clinically usable calculation speeds, a precalculated Monte Carlo (PMC) algorithm for proton and electron transport was developed to run on graphics processing units (GPUs). The algorithm utilizes pregenerated particle track data from conventional MC codes for different materials such as water, bone, and lung to produce dose distributions in voxelized phantoms. While PMC methods have been described in the past, an explicit quantification of the latent uncertainty arising from the limited number of unique tracks in the pregenerated track bank is missing from the paper. With a proper uncertainty analysis, an optimal number of tracks in the pregenerated track bank can be selected for a desired dose calculation uncertainty. Methods: Particle tracks were pregenerated for electrons and protons using EGSnrc and GEANT4 and saved in a database. The PMC algorithm for track selection, rotation, and transport was implemented on the Compute Unified Device Architecture (CUDA) 4.0 programming framework. PMC dose distributions were calculated in a variety of media and compared to benchmark dose distributions simulated from the corresponding general-purpose MC codes in the same conditions. A latent uncertainty metric was defined and analysis was performed by varying the pregenerated track bank size and the number of simulated primary particle histories and comparing dose values to a “ground truth” benchmark dose distribution calculated to 0.04% average uncertainty in voxels with dose greater than 20% of D{sub max}. Efficiency metrics were calculated against benchmark MC codes on a single CPU core with no variance reduction. Results: Dose distributions generated using PMC and benchmark MC codes were compared and found to be within 2% of each other in voxels with dose values greater than 20% of the maximum dose. In proton calculations, a small (≤1 mm) distance-to-agreement error was observed at the Bragg peak. Latent uncertainty was characterized for electrons and found to follow a Poisson distribution with the number of unique tracks per energy. A track bank of 12 energies and 60000 unique tracks per pregenerated energy in water had a size of 2.4 GB and achieved a latent uncertainty of approximately 1% at an optimal efficiency gain over DOSXYZnrc. Larger track banks produced a lower latent uncertainty at the cost of increased memory consumption. Using an NVIDIA GTX 590, efficiency analysis showed a 807 × efficiency increase over DOSXYZnrc for 16 MeV electrons in water and 508 × for 16 MeV electrons in bone. Conclusions: The PMC method can calculate dose distributions for electrons and protons to a statistical uncertainty of 1% with a large efficiency gain over conventional MC codes. Before performing clinical dose calculations, models to calculate dose contributions from uncharged particles must be implemented. Following the successful implementation of these models, the PMC method will be evaluated as a candidate for inverse planning of modulated electron radiation therapy and scanned proton beams.

07 ISOTOPE AND RADIATION SOURCES↗

Portable SHMEMCache: A High-Performance Key-Value Store on OpenSHMEM and MPI

The integration of Big Data frameworks and HPC capabilities has drawn enormous interests in recent years. SHMEMCache is a distributed key-value store built on the OpenSHMEM global address space. It has solved several practical issues in leveraging OpenSHMEM’s one-sided operations for a distributed key-value store and providing efficient key-value operations on both commodity machines and supercomputers. However, being based solely on OpenSHMEM, SHMEMCache cannot leverage one-sided operations from a variety of software packages. This results in several limitations for SHMEMCache. First, we cannot make SHMEMCache available to a wider range of platforms. Second, an opportunity for potential performance improvement is missed. Third, there is a lack of deep understanding about how different one-sided operations can fit in with SHMEMCache and other distributed key-values in general. For example, the one-sided operations in OpenSHMEM and MPI have many differences in their interfaces, memory semantics and synchronization methods, all of which can have distinct implications and also increase the complexity in supporting both OpenSHMEM and MPI for SHMEMCache. Therefore, we have taken on an effort on leveraging different one-sided operations for SHMEMCache and proposed a design of portable SHMEMCache. Based on this new framework, we have supported both OpenSHMEM and MPI for SHMEMCache. We have also conducted an extensive set of experiments to compare the performance of the two versions on both commodity machines and the Titan supercomputer.

Computer Science↗

Rate analysis for a hybrid quantum repeater

We present a detailed rate analysis for a hybrid quantum repeater assuming perfect memories and using optimal probabilistic entanglement generation and deterministic swapping routines. The hybrid quantum repeater protocol is based on atomic qubit-entanglement distribution through optical coherent-state communication. An exact, analytical formula for the rates of entanglement generation in quantum repeaters is derived, including a study on the impacts of entanglement purification and multiplexing strategies. More specifically, we consider scenarios with as little purification as possible and we show that for sufficiently low local losses, such purifications are still more powerful than multiplexing. In a possible experimental scenario, our hybrid system can create near-maximally entangled (F=0.98) pairs over a distance of 1280 km at rates of the order of 100 Hz.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Shared prefetching to reduce execution skew in multi-threaded systems

Mechanisms are provided for optimizing code to perform prefetching of data into a shared memory of a computing device that is shared by a plurality of threads that execute on the computing device. A memory stream of a portion of code that is shared by the plurality of threads is identified. A set of prefetch instructions is distributed across the plurality of threads. Prefetch instructions are inserted into the instruction sequences of the plurality of threads such that each instruction sequence has a separate sub-portion of the set of prefetch instructions, thereby generating optimized code. Executable code is generated based on the optimized code and stored in a storage device. The executable code, when executed, performs the prefetches associated with the distributed set of prefetch instructions in a shared manner across the plurality of threads.

97 MATHEMATICS AND COMPUTING↗