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,081 records · Page 60

Data-Driven Day-Ahead PV Estimation Using Hybrid Deep Learning

Ongoing smart grid activities and associated automation resulted in rich set of data. Here, these data can be utilized for monitoring and estimation of real time photovoltaic (PV) generation. Inherent variability in PV and related impact on power systems is a challenging problem. Improving the accuracy of PV generation estimation is beneficial for both the PV owners and the grid operators. Recently, deep learning algorithms possible by the availability of data have shown its advantages for time series estimation; however, its application on PV generation estimation is still in the early stage. In this paper, a hybrid estimation model with a combination of long-short-term-memory network (LSTM) and persistence model (PM) is developed to provide day-ahead PV estimation at 15-minute time interval with high accuracy and robustness. Simulation results show the superior performance of the proposed method over existing methods for most of the test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Demonstration of Cost-Effective, High-Performance Computing at Performance and Reliability Levels Equivalent to a 1994 Vector Supercomputer

The Affordable High Performance Computing (AHPC) project demonstrated that high-performance computing based on a distributed network of computer workstations is a cost-effective alternative to vector supercomputers for running CPU and memory intensive design and analysis tools. The AHPC project created an integrated system called a Network Supercomputer. By connecting computer work-stations through a network and utilizing the workstations when they are idle, the resulting distributed-workstation environment has the same performance and reliability levels as the Cray C90 vector Supercomputer at less than 25 percent of the C90 cost. In fact, the cost comparison between a Cray C90 Supercomputer and Sun workstations showed that the number of distributed networked workstations equivalent to a C90 costs approximately 8 percent of the C90.

Babrauckas, Theresa↗

Distributed Order Recording Techniques for Efficient Record-and-Replay of Multi-threaded Programs

After all these years and all these other shared memory programming frameworks, OpenMP is still the most popular one. However, its greater levels of non-deterministic execution makes debugging and testing more challenging. The ability to record and deterministically replay the program execution is key to address this challenge. However, scalably replaying OpenMP programs is still an unresolved problem. In this paper, we propose two novel techniques that use Distributed Clock (DC) and Distributed Epoch (DE) recording schemes to eliminate excessive thread synchronization for OpenMP record and replay. Our evaluation on representative HPC applications with ReOMP, which we used to realize DC and DE recording, shows that our approach is 2-5x more efficient than traditional approaches that synchronize on every shared-memory access. Furthermore, we demonstrate that our approach can be easily combined with MPI-level replay tools to replay non-trivial MPI+OpenMP applications. We achieve this by integrating ReOMP into ReMPI, an existing scalable MPI record-and-replay tool, with only a small MPI-scale-independent runtime overhead.

Fu, Xiang↗

High Temperature, High Pressure Devices for Zonal Isolation in Geothermal Wells

The U.S. Department of Energy is leading the development of alternative energy sources that will ensure the long-term energy independence of our nation. One key renewable resource being advanced is geothermal energy which offers an environmentally benign, reliable source of energy for the nation. To utilize this resource, water will be introduced into wells 3 to 10 km deep to create a geothermal reservoir. This approach is known as an Enhanced Geothermal System (EGS). The high temperatures and pressures at these depths have become a limiting factor in the development of this energy source. For example, reliable zonal isolation for high-temperature applications at high differential pressures is needed to conduct mini-fracs and other stress state diagnostics. Zonal isolation is essential for many EGS reservoir development activities. To date, the capability has not been sufficiently demonstrated to isolate sections of the wellbore to: 1) enable stimulation; and 2) seal off unwanted flow regions in unknown EGS completion schemes and high-temperature (>200°C) environments. In addition, packers and other zonal isolation tools are required to eliminate fluid loss, to help identify and mitigate short circuiting of flow from injectors to producers, and to target individual fractures or fracture networks for testing and validating reservoir models. General-purpose open-hole packers do not exist for geothermal environments, with the primary barrier being the poor stability of elastomeric seals at high temperature above 175°C. Experimental packer systems have been developed for geothermal environments but they currently only operate at low pressure, they are not retrievable, and they are not commercially available. The development of the high-temperature, high-pressure (HTHP) zonal isolation device would provide the geothermal community with the capability to conduct mini-fracs, eliminate fluid loss, to help identify and mitigate short circuiting of flow from injectors to producers, and to target individual fractures or fracture networks for testing and validating reservoir models. The goal of this program, therefore, was to develop and demonstrate reliable high-temperature high-pressure zonal isolation devices that are compatible with the high-temperature downhole environment anticipated for Enhanced Geothermal Systems. Over the course of this 3 year program, CTD designed and demonstrated a high temperature high pressure zonal isolation device. CTD has utilized its expertise in high-temperature materials, shape memory composites and foams, and deployment mechanisms for spacecraft and oil tools to develop a new class of HTHP zonal isolation devices for use in EGS. Specifically, the objective was to demonstrate the ability to isolate sections of an EGS wellbore to: 1) enable stimulation; and 2) seal off unwanted flow regions in unknown EGS completion schemes and high-temperature (>200°C) environments at temperatures upwards of 300°C. A concept for a high-temperature, high-pressure zonal isolation device was designed for use in creating circulation paths in environments where temperatures are in excess of 300°C and differential pressures of up to 10,000 psi are required to stimulate solid granite. This new zonal isolation device distributes the high-pressure differential through a significant length of high temperature, shape memory polymer composite material. The development of differential pressure is initiated by a thermally triggered actuation of a ‘structural seal’ that fills the cross section of the bore with the shape memory material. After this preliminary seal is made, differential pressure begins to build through the material as the seal forces the flow to pass through pores in the shape memory material. The shape memory material is compressed into place to react the force of the internal

58 GEOSCIENCES↗

GPU-based Image Compression for Efficient Compositing in Distributed Rendering Applications

Visualizations of large-scale data sets are often created on graphics clusters that distribute the rendering task amongst many processes. When using real-time GPU-based graphics algorithms, the most time-consuming aspect of distributed rendering is typically the com-positing phase - combining all partial images from each rendering process into the final visualization. Compo siting requires image data to be copied off the GPU and sent over a network to other processes. While compression has been utilized in existing distributed rendering compositors to reduce the data being sent over the network, this compression tends to occur after the raw images are transferred from the GPU to main memory. In this paper, we present work that leverages OpenGL / CUDA interoperability to compress raw images on the GPU prior to transferring the data to main memory. This approach can significantly reduce the device-to-host data transfer time, thus enabling more efficient compositing of images generated by distributed rendering applications.

Lipinksi, Riley↗

The Raid distributed database system

Raid, a robust and adaptable distributed database system for transaction processing (TP), is described. Raid is a message-passing system, with server processes on each site to manage concurrent processing, consistent replicated copies during site failures, and atomic distributed commitment. A high-level layered communications package provides a clean location-independent interface between servers. The latest design of the package delivers messages via shared memory in a configuration with several servers linked into a single process. Raid provides the infrastructure to investigate various methods for supporting reliable distributed TP. Measurements on TP and server CPU time are presented, along with data from experiments on communications software, consistent replicated copy control during site failures, and concurrent distributed checkpointing. A software tool for evaluating the implementation of TP algorithms in an operating-system kernel is proposed.

Bhargava, Bharat↗

Small tensor product distributed active space (STP-DAS) framework for relativistic and non-relativistic multiconfiguration calculations: Scaling from 10 9 on a laptop to 10 12 determinants on a supercomputer

Despite the power and flexibility of configuration interaction (CI) based methods in computational chemistry, their broader application is limited by an exponential increase in both computational and storage requirements, particularly due to the substantial memory needed for excitation lists that are crucial for scalable parallel computing. Here, the objective of this work is to develop a new CI framework, namely, the small tensor product distributed active space (STP-DAS) framework, aimed at drastically reducing memory demands for extensive CI calculations on individual workstations or laptops, while simultaneously enhancing scalability for extensive parallel computing. Moreover, the STP-DAS framework can support various CI-based techniques, such as complete active space (CAS), restricted active space, generalized active space, multireference CI, and multireference perturbation theory, applicable to both relativistic (two- and four-component) and non-relativistic theories, thus extending the utility of CI methods in computational research. We conducted benchmark studies on a supercomputer to evaluate the storage needs, parallel scalability, and communication downtime using a realistic exact-two-component CASCI (X2C-CASCI) approach, covering a range of determinants from 10 9 to 10 12 . Additionally, we performed large X2C-CASCI calculations on a single laptop and examined how the STP-DAS partitioning affects performance.

Complete-active space self-consistent field↗

Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection

We consider the problem of distinguishing, with minimum probability of error, two optical beam-splitter channels with unequal complex-valued reflectivities using general quantum probe states entangled over M signal and M' idler mode pairs of which the signal modes are bounced off the beam splitter while the idler modes are retained losslessly. We obtain a lower bound on the output state fidelity valid for any pure input state. We define number-diagonal signal (NDS) states to be input states whose density operator in the signal modes is diagonal in the multimode number basis. For such input states, we derive series formulas for the optimal error probability, the output state fidelity, and the Chernoff-type upper bounds on the error probability. For the special cases of quantum reading of a classical digital memory and target detection (for which the reflectivities are real valued), we show that for a given input signal photon probability distribution, the fidelity is minimized by the NDS states with that distribution and that for a given average total signal energy N{sub s}, the fidelity is minimized by any multimode Fock state with N{sub s} total signal photons. For reading of an ideal memory, it is shown that Fock state inputs minimize the Chernoff bound. For target detection under high-loss conditions, a no-go result showing the lack of appreciable quantum advantage over coherent state transmitters is derived. A comparison of the error probability performance for quantum reading of number state and two-mode squeezed vacuum state (or EPR state) transmitters relative to coherent state transmitters is presented for various values of the reflectances. While the nonclassical states in general perform better than the coherent state, the quantitative performance gains differ depending on the values of the reflectances. The experimental outlook for realizing nonclassical gains from number state transmitters with current technology at moderate to high values of the reflectances is argued to be good.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variable Order and Distributed Order Fractional Operators

Many physical processes appear to exhibit fractional order behavior that may vary with time or space. The continuum of order in the fractional calculus allows the order of the fractional operator to be considered as a variable. This paper develops the concept of variable and distributed order fractional operators. Definitions based on the Riemann-Liouville definitions are introduced and behavior of the operators is studied. Several time domain definitions that assign different arguments to the order q in the Riemann-Liouville definition are introduced. For each of these definitions various characteristics are determined. These include: time invariance of the operator, operator initialization, physical realization, linearity, operational transforms. and memory characteristics of the defining kernels. A measure (m2) for memory retentiveness of the order history is introduced. A generalized linear argument for the order q allows the concept of "tailored" variable order fractional operators whose a, memory may be chosen for a particular application. Memory retentiveness (m2) and order dynamic behavior are investigated and applications are shown. The concept of distributed order operators where the order of the time based operator depends on an additional independent (spatial) variable is also forwarded. Several definitions and their Laplace transforms are developed, analysis methods with these operators are demonstrated, and examples shown. Finally operators of multivariable and distributed order are defined in their various applications are outlined.

Lorenzo, Carl F.↗

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↗