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 613 records · Page 34

Multiple transient memories in sheared suspensions: Robustness, structure, and routes to plasticity

Multiple transient memories, first discovered in charge-density-wave conductors, are a remarkable and initially counterintuitive example of how a system can store information about its driving. In this class of memories, a system can learn multiple driving inputs, nearly all of which are eventually forgotten despite their continual input. If sufficient noise is present, the system regains plasticity so that it can continue to learn new memories indefinitely. Recently, Keim and Nagel [Phys. Rev. Lett. 107, 010603 (2011)] showed how multiple transient memories could be generalized to a generic driven disordered system with noise, giving as an example simulations of a simple model of a sheared non-Brownian suspension. Here, we further explore simulation models of suspensions under cyclic shear, focusing on three main themes: robustness, structure, and overdriving. We show that multiple transient memories are a robust feature independent of many details of the model. The steady-state spatial distribution of the particles is sensitive to the driving algorithm; nonetheless, the memory formation is independent of such a change in particle correlations. Finally, we demonstrate that overdriving provides another means for controlling memory formation and retention.

42 ENGINEERING↗

Strongly coupling a cavity to inhomogeneous ensembles of emitters: Potential for long-lived solid-state quantum memories

We investigate theoretically the coupling of a cavity mode to a continuous distribution of emitters. We discuss the influence of the emitters' inhomogeneous broadening on the existence and on the coherence properties of the polaritonic peaks. We find that their coherence depends crucially on the shape of the distribution and not only on its width. Under certain conditions the coupling to the cavity protects the polaritonic states from inhomogeneous broadening, resulting in a longer storage time for a quantum memory based on emitter ensembles. When two different ensembles of emitters are coupled to the resonator, they support a peculiar collective dark state, which is also very attractive for the storage of quantum information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model reduction for a power grid model

We examine the complexity of constructing reduced order models for subsets of the variables needed to represent the state of the power grid. In particular, we apply model reduction techniques to the DeMarco-Zheng power grid model. We show that due to the oscillating nature of the solutions and the absence of timescale separation between resolved and unresolved variables, the construction of accurate reduced models becomes highly non-trivial because one has to account for long memory effects. In addition, we show that a reduced model that includes even a short memory is drastically better than a memoryless model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Tuning the Mechanical Properties of Shape Memory Metallic Glass Composites with Brick and Mortar Designs

We use molecular dynamics simulations to characterize the tensile deformation and failure of shape memory alloy-bulk metallic glass composites (BMGCs). As the failure in BMGCs shifts from the MG matrix to the second phase different strategies are required to further improve their mechanical properties. Results show that a staggered brick BMGC displays enhanced ductility with mild strength loss following a homogeneously distributed plasticity. This demonstrates that judiciously designed BMGCs can effectively synergize the mechanical properties of metallic glasses and shape memory alloys by effectively distributing stress and preventing the generation of critical shear bands and premature failure while preserving strength.

36 MATERIALS SCIENCE↗

Quartile and Outlier Detection on Heterogeneous Clusters Using Distributed Radix Sort.

In the past few years, performance improvements in CPUs and memory technologies have outpaced those of storage systems. When extrapolated to the exascale, this trend places strict limits on the amount of data that can be written to disk for full analysis, resulting in an increased reliance on characterizing in-memory data. Many of these characterizations are simple, but require sorted data. This paper explores an example of this type of characterization - the identification of quartiles and statistical outliers - and presents a performance analysis of a distributed heterogeneous radix sort as well as an assessment of current architectural bottlenecks.

Spafford, Kyle L↗

Userspace Squash Filesystem for Launching Linux Containers on HPC Systems [Thesis]

The demand for user defined software stacks (UDSS) has been increasing in the high-performance computing (HPC) community. Container technology has become popular due to the flexibility and isolation it provides to HPC users. Container images must be available to all nodes involved for use in HPC and can be distributed to compute nodes in a variety of ways. A common method for container image distribution is to simply copy the container image to memory on each compute node, which can be time consuming at scale, and uses valuable memory on each node. The kernel mounted squash filesystem (squashfs) has proven fast and efficient for this task but requires root-level access. This paper will show a user space mounted squashfs is an efficient and secure solution for container image distribution.

97 MATHEMATICS AND COMPUTING↗

Accelerating shared file checkpoint with local burst buffers

A data management system and method for accelerating shared file checkpointing. Written application data is aggregated in an application data file created in a local burst buffer memory at a compute node, and an associated data mapping built index to maintain information related to the offsets into a shared file at which segments of the application data is to be stored in a parallel file system, and where in the buffer those segments are located. The node asynchronously transfers a data file containing the application data and the associated data mapping index to a file server for shared file storage. The data management system and method further accelerates shared file checkpointing in which a shared file, together with a map file that specifies how the shared file is to be distributed, is asynchronously transferred to local burst buffer memories at the nodes to accelerate reading of the shared file.

Gooding, Thomas↗

The effects of dose calculation resolution on dose accuracy for radiation therapy treatments of the lung. Part II. A comparison of dose distributions from an explicit lung model to dose distributions derived from a CT representation

Purpose: Due to limitations in computer memory and computation time, typical radiation therapy treatments are calculated with a voxel dimension on the order of several millimeters. The anatomy below this practical resolution is approximated as a homogeneous region uniform in atomic composition and density. The purpose of this article is to examine whether the exclusion of anatomic structure below the practical dose calculation resolution produces deviations in the resulting dose distributions. Methods: EGSnrc calculated dose distributions from the BRANCH lung model of Part I are compared and contrasted to dose distributions from a CT representation of the same BRANCH model for three different phases of the respiration cycle. Results: The exclusion of branching structures below a CT resolution of 1x1x2 mm{sup 3} resulted in a deviation in dose. The deviation in dose was as high as 14% but was localized around the branching structures. There was no significant variation in the dose deviation as a function of either field size or lung density. Conclusions: The exclusion of explicit branching structures of the lung in a CT representation creates localized deviations in dose. To ensure accurate dose calculations, CT resolution must be increased.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Comprehensive Study of the Polarization Behavior of LiFePO 4 Electrodes Based on a Many-Particle Model

The unique polarization behavior of LiFePO 4 electrodes was investigated using mathematical simulations with a many-particle model, which have a non-monotonic potential profile for each LiFePO 4 particle, and analyzed by the active population concept. The present simulations reveal two known polarization behaviors, namely the memory effect and path dependence. Notably, a hitherto unknown polarization behavior, the so-called relaxation-induced polarization (RIP), was also identified. The memory effect requires, at a minimum, a sequential four-step operation. By comparison, RIP is triggered only by a one-step operation, namely a long rest. In effect, the polarization associated with the memory effect and RIP was caused by a reduction of the active particles in the two-phase region via relaxation during a rest. The path-dependence mechanism was attributed to kinetically inhomogeneous reactions for each particle. We further found that narrowing the particle size distribution was an effective means to reduce polarization viz. the memory effect and path dependence of LiFePO 4 electrodes. However, RIP could not be suppressed by narrowing the particle size distribution. Furthermore, a comprehensive understanding of these polarization behaviors with our model provides a more accurate way to estimate the state of charge in Li-ion batteries with LiFePO 4 electrodes.

25 ENERGY STORAGE↗

SU-F-BRF-01: A GPU Framework for Developing Interactive High-Resolution Patient-Specific Biomechanical Models

Purpose: To develop a GPU-based framework that can generate highresolution and patient-specific biomechanical models from a given simulation CT and contoured structures, optimized to run at interactive speeds, for addressing adaptive radiotherapy objectives. Method: A Massspring-damping (MSD) model was generated from a given simulation CT. The model's mass elements were generated for every voxel of anatomy, and positioned in a deformation space in the GPU memory. MSD connections were established between neighboring mass elements in a dense distribution. Contoured internal structures allowed control over elastic material properties of different tissues. Once the model was initialized in GPU memory, skeletal anatomy was actuated using rigid-body transformations, while soft tissues were governed by elastic corrective forces and constraints, which included tensile forces, shear forces, and spring damping forces. The model was validated by applying a known load to a soft tissue block and comparing the observed deformation to ground truth calculations from established elastic mechanics. Results: Our analyses showed that both local and global load experiments yielded results with a correlation coefficient R{sup 2} > 0.98 compared to ground truth. Models were generated for several anatomical regions. Head and neck models accurately simulated posture changes by rotating the skeletal anatomy in three dimensions. Pelvic models were developed for realistic deformations for changes in bladder volume. Thoracic models demonstrated breast deformation due to gravity when changing treatment position from supine to prone. The GPU framework performed at greater than 30 iterations per second for over 1 million mass elements with up to 26 MSD connections each. Conclusions: Realistic simulations of site-specific, complex posture and physiological changes were simulated at interactive speeds using patient data. Incorporating such a model with live patient tracking would facilitate real time assessment of variations of the actual anatomy and delivered dose for adaptive intervention and re-planning.

60 APPLIED LIFE SCIENCES↗

Near-unit-fidelity entanglement distribution scheme using Gaussian communication

We show how to distribute with percentage success probabilities almost perfectly entangled qubit memory pairs over repeater channel segments of the order of the optical attenuation distance. In addition to some weak, dispersive light-matter interactions, only Gaussian state transmissions and measurements are needed for this scheme. Our protocol outperforms the existing coherent-state-based schemes for entanglement distribution, even those using error-free non-Gaussian measurements. This is achieved through two innovations: First, optical squeezed states are utilized instead of coherent states. Second, the amplitudes of the bright signal pulses are reamplified at each repeater station. This latter variation is a strategy reminiscent of classical repeaters and would be impossible in single-photon-based schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable low-loss cryogenic packaging of quantum memories in CMOS-foundry processed photonic chips

Optically linked solid-state quantum memories such as color centers in diamond are a promising platform for distributed quantum information processing and networking. Photonic integrated circuits (PICs) have emerged as a crucial enabling technology for these systems, integrating quantum memories with efficient electrical and optical interfaces in a compact and scalable platform. Packaging these hybrid chips into deployable modules while maintaining low optical loss and resiliency to temperature cycling is a central challenge to their practical use. We demonstrate a packaging method for PICs using surface grating couplers and angle-polished fiber arrays that is robust to temperature cycling, offers scalable channel count, applies to a wide variety of PIC platforms and wavelengths, and offers pathways to automated high-throughput packaging. Using this method, we show optically and electrically packaged quantum memory modules integrating all required qubit controls on chip, operating at millikelvin temperatures with <3 dB losses achievable from fiber to quantum memory for the TE 0 mode at a wavelength of 737 nm.

Bernson, Robert [Tyndall National Institute, Cork ↗

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗

Enabling the High Level Synthesis of Data Analytics Accelerators

Conventional High Level Synthesis (HLS) tools mainly tar- get compute intensive kernels typical of digital signal pro- cessing applications. We are developing techniques and ar- chitectural templates to enable HLS of data analytics appli- cations. These applications are memory intensive, present fine-grained, unpredictable data accesses, and irregular, dy- namic task parallelism. We discuss an architectural tem- plate based around a distributed controller to efficiently ex- ploit thread level parallelism. We present a memory in- terface that supports parallel memory subsystems and en- ables implementing atomic memory operations. We intro- duce a dynamic task scheduling approach to efficiently ex- ecute heavily unbalanced workload. The templates are val- idated by synthesizing queries from the Lehigh University Benchmark (LUBM), a well know SPARQL benchmark.

Data Analytics↗

Towards Superior Software Portability with SHAD and HPX C++ Libraries

As hardware architectures and software stacks complexity grows, development productivity, performance and software portability, quickly evolve from desirable features to actual needs. SHAD, the Scalable High-performance Algorithms and Data-structures C++ library is designed to mitigate these issues: it provides general purpose building blocks as well as high-level custom utilities, and offers a shared-memory programming abstraction which facilitates the programming of complex systems, scaling up to High Performance Computing clusters. SHAD’s portability is achieved through an abstract runtime interface, which decouples the upper layers of the library and hides the low level details of the underlying architecture. This layer enables SHAD to interface with different runtime/threading systems, e.g. Intel TBB and Global Memory and Threading (GMT). However, current backends targeting distributed systems, rely on a centralized controller which may possibly limit scalability up to hundreds of nodes and creates a network hot spot due to all to one communication for synchronization, and possibly resulting in degraded performance at high process counts. In this research, we explore HPX, the C++ standard library for parallelism and concurrency, as an additional backend in support of the SHAD library, and present the methodologies in support of local and remote task executions in SHAD with respect to HPX. Finally, we evaluate the proposed system by comparing against existing backends of SHAD and analyzing their performance on C++ Standard Template Library algorithms.

Wu, Nanmiao↗

Ion-Photon Quantum Interface: Entanglement Engineering

Distributed quantum information processing requires a reliable quantum memory and a faithful carrier of quantum information. Trapped ion qubits are the leading realization for quantum information storage, and photonic qubits are the natural choice for the transport of quantum information. The capability to entangle photons with trapped ions in a highly efficient (scalable) fashion is an important achievement. Here, we leverage the active and successful development of micro-fabricated semiconductor ion traps at the Sandia National Laboratory MESA facility, and integrate micro optical components. Compared to current efforts in academic settings combining macro-sized ion traps and optics, a micro device will result in the dramatically increased speed and fidelity of ion-trap based quantum networking protocols. Integrating smaller components will directly allow for a stronger quantum coherent interface between a single trapped ion and a single photon. If successful, this technology could lead to new demonstrations of fundamental physics properties and would open new avenues for scalable quantum networking architectures.

Moehring, David Lynn↗

Demonstrating UPC++/Kokkos Interoperability in a Heat Conduction Simulation (Extended Abstract)

We describe the replacement of MPI with UPC++ in an existing Kokkos code that simulates heat conduction within a rectangular 3D object, as well as an analysis of the new code’s performance on CUDA accelerators. The key challenges were packing the halos in Kokkos data structures in a way that allowed for UPC++ remote memory access, and streamlining synchronization costs. Additional UPC++ abstractions used included global pointers, distributed objects, remote procedure calls, and futures. We also make use of the device allocator concept to facilitate data management in memory with unique properties, such as GPUs. Our results demonstrate that despite the algorithm’s good semantic match to message passing abstractions, straightforward modifications to use UPC++ communication deliver vastly improved performance and scalability in the common case. We find the one-sided UPC++ version written in a natural way exhibits good performance, whereas the message-passing version written in a straightforward way exhibits performance anomalies. We argue this represents a productivity benefit for one-sided communication models.

Waters, Daniel↗

Long Short-Term Memory Networks for Pattern Recognition of Synthetical Complete Earthquake Catalog

Exploring the spatiotemporal distribution of earthquake activity, especially earthquake migration of fault systems, can greatly to understand the basic mechanics of earthquakes and the assessment of earthquake risk. By establishing a three-dimensional strike-slip fault model, to derive the stress response and fault slip along the fault under regional stress conditions. Our study helps to create a long-term, complete earthquake catalog. We modelled Long-Short Term Memory (LSTM) networks for pattern recognition of the synthetical earthquake catalog. The performance of the models was compared using the mean-square error (MSE). Our results showed clearly the application of LSTM showed a meaningful result of 0.08% in the MSE values. Our best model can predict the time and magnitude of the earthquakes with a magnitude greater than Mw = 6.5 with a similar clustering period. These results showed conclusively that applying LSTM in a spatiotemporal series prediction provides a potential application in the study of earthquake mechanics and forecasting of major earthquake events.

58 GEOSCIENCES↗