Search NASA⌕ Search

SEARCH · Search NASA

Results for “memory efficiency”

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,495 records · Page 83

Speed and Memory Improvements to MCNP6 Delayed-Gamma Line Treatment

The delayed-gamma (DG) line-emission (line) sampling was first introduced into MCNPX in 2005. At the time, storage demands for problems with large numbers of DG lines was a major concern. In order to accommodate large amounts of line data while keeping the memory footprint of such a problem from exceeding memory limits, complicated logic was included to sift through various storage options. In mid-2015 concerns arose over the adequacy of the MCNP6 DG source option (inherited from MCNPX) with line sampling for modeling high-fidelity problems. One indication that there was a problem came when studying the MCNP6 produced DG spectra of U-238 and its progeny using high-fidelity spectroscopic tallies when compared to DG line amplitudes directly from ENDF/B-VII.1 emission data. Despite producing a correct integral number of gammas, the comparison to ENDF data showed a broadening in the energy lines and a reduction in the amplitude of more prominent lines. It was later found that the cause of this broadening was one of the memory-saving techniques used to store DG line data when problems required many DG lines. Specifically, the DG lines were integrated into fine energy bins for sampling. When a DG line was to be sampled, a random number would be used to choose which energy bin to sample based on emission probability. Once chosen, a second random number was used to perform nearest-line sampling in that bin. The integration of lines led to an oversampling of low-probability lines, especially when in close proximity to high-probability lines. This treatment also caused a similar issue with the time-dependent behavior of DG line emission which occurred when low-probability lines were sampled near high probability lines with the former decay constant being used. The effect on time-dependent gamma production was demonstrated in analytic benchmarks performed by Weldon et al.. To address these issues a new gamma line storage and sampling treatment was introduced in 2015. This new treatment, stores gamma emission data in a line-by-line CDF which is sampled directly, thereby resolving both the line-broadening issue, and the time-dependence issue as was demonstrated by Tutt el al.. In addition, the new DG sampling treatment was written to use dynamically dimensioned storage arrays as opposed to large fixed-dimensioned arrays, as in the former treatment, and also makes more efficient use of line data that is stored by reducing or eliminating repeated data. As a result, storage arrays are generated only for DG data relevant to the problem being executed. The result should be a reduction in both memory requirements and runtime. However, these reductions could not be realized until the logic for the old treatment could be removed. This paper provides an update on recent work which has focused on the removal of the old DG sampling logic and attempts to quantify the memory reduction and speed up of selected problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Effect of Firn-Aquifer Drainage on the Greenland Subglacial System or Subglacial Efficiency and Storage Modified by the Temporal Pattern of High-Elevation Meltwater Input

Ice flow in marginal region of the Greenland Ice Sheet dynamically responds to summer melting as surface meltwater is routed through the supraglacial hydrologic system to the bed of the ice sheet via crevasses and moulins. Given the expected increases in surface melt production and extent, and the potential for high elevation surface-to-bed connections, it is imperative to understand how meltwater delivered to the bed from different high-elevation supraglacial storage features affects the evolution of the subglacial hydrologic system and associated ice dynamics. Here, we use the two-dimensional subglacial hydrologic model, GLaDS, which includes distributed and channelized water flow, to test how the subglacial system of an idealized outlet glacier responds to cases of high-elevation firn-aquifer-type and supraglacial-lake-type englacial drainage over the course of 5 years. Model outputs driven by these high elevation drainage types are compared to steady-state model results, where the subglacial system only receives the 1980- 2016 mean MERRA-2 runoff via low-elevation moulins. Across all experiments, the subglacial hydrologic system displays inter-annual memory, resulting in multiyear declines in subglacial pressure during the onset of seasonal melting and growth of subglacial channels. The gradual addition of water in firn-aquifer-type drainage scenarios resulted in small increases in subglacial water storage but limited changes in subglacial efficiency and channelization. Rapid, supraglacial- lake-type drainage resulted in short-term local increases in subglacial water pressure and storage, which gave way to spatially extensive decreases in subglacial pressure and downstream channelization. These preliminary results suggest that the character of high-elevation englacial drainage can have a strong, and possibly outsized, control on subglacial efficiency throughout the ablation zone. Therefore, understanding both how high elevation meltwater is stored supraglacially and the probability of crevassing at high elevations will play an important role in how the subglacial system, proglacial discharge and ice motion will respond to future increases in surface melt production and runoff.

Andrews, Lauren C.↗

kokkos-fft: A shared-memory FFT for the Kokkos ecosystem

kokkos-fft provides a unified, performance-portable interface for Fast Fourier Transforms (FFTs) within the Kokkos ecosystem (C. Trott et al., 2021). It seamlessly integrates with leading local FFT libraries including FFTW, cuFFT, rocFFT, and oneMKL. Designed for simplicity and efficiency, kokkos-fft offers a user experience akin to numpy.fft for in-place and out-of-place transforms, while leveraging the raw speed of vendor-optimized libraries. A demonstration solving 2D Hasegawa-Wakatani turbulence with the Fourier spectral method illustrates how kokkos-fft can deliver significant speedups over Python-based alternatives without drastically increasing code complexity, empowering researchers to perform high-performance FFTs simply and effectively.

97 MATHEMATICS AND COMPUTING↗

AYUSH: A Technique for Extending Lifetime of SRAM-NVM Hybrid Caches

Recently, researchers have explored way-based hybrid SRAM-NVM (non-volatile memory) last level caches (LLCs) to bring the best of SRAM and NVM together. However, the limited write endurance of NVMs restricts the lifetime of these hybrid caches. We present AYUSH, a technique to enhance the lifetime of hybrid caches, which works by using data-migration to preferentially use SRAM for storing frequently-reused data. Microarchitectural simulations confirm that AYUSH achieves larger improvement in lifetime than a previous technique and also maintains performance and energy efficiency. For single, dual and quad-core workloads, the average increase in cache lifetime with AYUSH is 6.90X, 24.06X and 47.62X, respectively.

device lifetime↗

Parallel projection—An improved return mapping algorithm for finite element modeling of shape memory alloys

Here, we present a novel finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to resolve. Finite element analysis methods, which rely on Gauss quadrature integration schemes, must solve two sets of coupled differential equations: one at the global level and the other at the local, i.e. Gauss point level. In contrast to the conventional return mapping algorithm, which solves these two sets of coupled differential equations separately using a nested Newton procedure, we propose a scheme to solve the local and global differential equations simultaneously. In the process we also derive closed-form expressions used to update the internal/constitutive state variables, and unify the popular closest-point and cutting plane methods with our formulas. Numerical testing indicates that our method allows for larger thermomechanical loading steps and provides increased computational efficiency, over the standard return mapping algorithm.

42 ENGINEERING↗

Performance assessment of ensembles of in situ workflows under resource constraints

Summary Scientific breakthroughs in biomolecular methods and improvements in hardware technology have shifted from a long‐running simulation to a large set of shorter simulations running simultaneously, called an ensemble. In an ensemble, simulations are usually coupled with analyses of data produced by the simulations. In situ methods can be used to analyze large volumes of data generated by scientific simulations at runtime (i.e., simulations and analyses are performed concurrently). In this work, we study the execution of ensemble‐based simulations paired with in situ analyses using in‐memory staging methods. Using an ensemble of molecular dynamics in situ workflows with multiple simulations and analyses, we first show that collecting traditional metrics such as makespan, instructions per cycle, memory usage, or cache miss ratio is not sufficient to characterize complex behaviors of ensembles. We propose a method to evaluate the performance of ensembles of workflows that captures multiple resource usage aspects: resource efficiency, resource allocation, and resource provisioning. Experimental results demonstrate that the proposed method can effectively distinguish the performance of different component placements in an ensemble with up to 32 ensemble members. By evaluating different co‐location scenarios, our proposed performance indicators demonstrate benefits of co‐locating simulation and coupled analyses within a compute node.

Do, Tu Mai Anh↗

A fast matrix-free approach to the high-order control volume finite element method with application to low-Mach flow

Here, a fast matrix-free formulation of the control volume finite element method is presented, requiring much less memory and computational work than previous efforts. The method is implemented and evaluated as a solver for low-Mach flow, including the evaluation of a preconditioning strategy for the pressure Poisson equation. The efficiency and scaling with polynomial order is evaluated on simple turbulent flows of interest, with appropriate solution quality metrics, and compared with a reference node-centered finite volume discretization. For a turbulent channel flow test, we show improvement in computational work for a given accuracy with the high-order scheme. The performance on a GPU accelerated platform is also investigated, with benefit shown for the matrix-free discretization.

42 ENGINEERING↗

Role of chaos in quantum communication through a dynamical dephasing channel

In this article we treat the subject of chaotic environments with few degrees of freedom in quantum communication by investigating a conservative dynamical map as a model of a dephasing quantum channel. When the channel's dynamics is chaotic, we investigate the model's semi-classical limit and show that the entropy exchange grows at a constant rate which depends on a single parameter (the interaction strength), analogous to stochastic models of dephasing channels. We analyze memory effects in the channel and present strong physical arguments to support that the present model is forgetful in the chaotic regime while memory effects in general cannot be ignored when channel dynamics is regular. In order to render the nonchaotic channel forgetful, it becomes necessary to apply a reset to the channel and this reset can efficiently be modeled by application of a chaotic map. We may then refer to encoding theorems (valid in the case of forgetful channels) to present evidence of a transition from noiseless to noisy channel due to the environment's transition from regular to chaotic dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast emulation of quantum three-body scattering

Here, we develop a class of emulators for solving quantum three-body scattering problems. They are based on combining the variational method for scattering observables and the recently proposed eigenvector continuation concept. The emulators are first trained by the exact scattering solutions of the governing Hamiltonian at a small number of points in its parameter space, and then employed to make interpolations and extrapolations in that space. Through a schematic nuclear-physics model with finite-range two and three-body interactions, we demonstrate the emulators to be extremely accurate and efficient. The computing time for emulation is on the scale of milliseconds (on a laptop), with relative errors ranging from 10 –13 to 10 –4 depending on the case. The emulators also require little memory. We argue that these emulators can be generalized to even more challenging scattering problems. Furthermore, this general strategy may be applicable for building the same type of emulators in other fields, wherever variational methods can be developed for evaluating physical models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Harnessing Data Movement in Virtual Clusters for In-Situ Execution

As a result of increasing data volume and velocity, Big Data science at exascale has shifted towards the in-situ paradigm, where large scale simulations run concurrently alongside data analytics. With in-situ, data generated from simulations can be processed while still in memory, thereby avoiding the slow storage bottleneck. However, running simulations and analytics together on shared resources will likely result in substantial contention if left unmanaged, as demonstrated in this work, leading to much reduced efficiency of simulations and analytics. Recently, virtualization technologies such as Linux containers have been widely applied to data centers and physical clusters to provide highly efficient and elastic resource provisioning for consolidated workloads including scientific simulations and data analytics. In this paper, we investigate to facilitate network traffic manipulation and reduce mutual interference on the network for in-situ applications in virtual clusters. In order to dynamically allocate the network bandwidth when it is needed, we adopt SARIMA-based techniques to analyze and predict MPI traffic issued from simulations. Although this can be an effective technique, the naïve usage of network virtualization can lead to performance degradation for bursty asynchronous transmissions within an MPI job. Here, we analyze and resolve this performance degradation in virtual clusters.

97 MATHEMATICS AND COMPUTING↗

Low cost automated precise time measurement system

The Aerospace Guidance and Metrology Center (AGMC) has the responsibility for the dissemination of Precise Time and Time Interval (PTTI) to Air Force timing systems requiring microsecond time. In order to maintain traceability to the USNO Master Clock in Washington D.C., and accomplish efficient logging of time and frequency data on individual precision clocks, a simple automatic means of acquiring precise time has been devised. The Automatic Time Interval Measurement System (ATIMS) consists of a minicomputer (8K Memory), teletype terminal, electronic counter, Loran C receiver, time base generator and locally-manufactured relay matrix panel. During the measurement process, the computer controls the relay matrix which selects for comparison 13 atomic clocks against a reference clock and the reference versus Loran C. Through use of the system teletype, the operator is able to set the system clock (hours, minutes and seconds), examine and/or modify all clock data and constants, and set measurement intervals. This is done in a conversational manner. A logic flow diagram, system schematic, source listing and software components are included in the presentation.

Alpert, A.↗

Computational aerodynamics on large computers

Three examples of advances in computational aerodynamics; (1) three-dimensional inviscid transonic analysis, (2) design calculations for wings, and (3) the computation of viscous-induced aileron buzz, are reviewed. Attention is given to wing surface pressures, design optimization, computer memory, speed and advanced solution methods on parallel computer architecture. It is determined that many implicit approximate-factorization schemes, that have been developed for Navier-Stokes equations, can be coded to run efficiently on microprocessors.

Ballhaus, W. F.↗

Parallel supercomputing with commodity components

We have implemented a parallel computer architecture based entirely upon commodity personal computer components. Using 16 Intel Pentium Pro microprocessors and switched fast ethernet as a communication fabric, we have obtained sustained performance on scientific applications in excess of one Gigaflop. During one production astrophysics treecode simulation, we performed 1.2 x 10(sup 15) floating point operations (1.2 Petaflops) over a three week period, with one phase of that simulation running continuously for two weeks without interruption. We report on a variety of disk, memory and network benchmarks. We also present results from the NAS parallel benchmark suite, which indicate that this architecture is competitive with current commercial architectures. In addition, we describe some software written to support efficient message passing, as well as a Linux device driver interface to the Pentium hardware performance monitoring registers.

Performance↗

The DUV Stability of Superlattice-Doped CMOS Detector Arrays

JPL and Alacron have recently developed a high performance, DUV camera with a superlattice doped CMOS imaging detector. Supperlattice doped detectors achieve nearly 100% internal quantum efficiency in the deep and far ultraviolet, and a single layer, Al2O3 antireflection coating enables 64% external quantum efficiency at 263nm. In lifetime tests performed at Applied Materials using 263 nm pulsed, solid state and 193 nm pulsed excimer laser, the quantum efficiency and dark current of the JPL/Alacron camera remained stable to better than 1% precision during long-term exposure to several billion laser pulses, with no measurable degradation, no blooming and no image memory at 1000 fps.

silicon detectors↗

Genetic Algorithm-Guided, Adaptive Model Order Reduction of Flexible Aircrafts

This paper presents a methodology for automated model order reduction (MOR) of flexible aircrafts to construct linear parameter-varying (LPV) reduced order models (ROM) for aeroservoelasticity (ASE) analysis and control synthesis in broad flight parameter space. The novelty includes utilization of genetic algorithms (GAs) to automatically determine the states for reduction while minimizing the trial-and-error process and heuristics requirement to perform MOR; balanced truncation for unstable systems to achieve locally optimal realization of the full model; congruence transformation for "weak" fulfillment of state consistency across the entire flight parameter space; and ROM interpolation based on adaptive grid refinement to generate a globally functional LPV ASE ROM. The methodology is applied to the X-56A MUTT model currently being tested at NASA/AFRC for flutter suppression and gust load alleviation. Our studies indicate that X-56A ROM with less than one-seventh the number of states relative to the original model is able to accurately predict system response among all input-output channels for pitch, roll, and ASE control at various flight conditions. The GA-guided approach exceeds manual and empirical state selection in terms of efficiency and accuracy. The adaptive refinement allows selective addition of the grid points in the parameter space where flight dynamics varies dramatically to enhance interpolation accuracy without over-burdening controller synthesis and onboard memory efforts downstream. The present MOR framework can be used by control engineers for robust ASE controller synthesis and novel vehicle design.

Numerical Analysi↗

Finite-difference modeling of Biot's poroelastic equations across all frequencies

An explicit time-stepping finite-difference scheme is presented for solving Biot's equations of poroelasticity across the entire band of frequencies. In the general case for which viscous boundary layers in the pores must be accounted for, the time-domain version of Darcy's law contains a convolution integral. It is shown how to efficiently and directly perform the convolution so that the Darcy velocity can be properly updated at each time step. At frequencies that are low enough compared to the onset of viscous boundary layers, no memory terms are required. At higher frequencies, the number of memory terms required is the same as the number of time points it takes to sample accurately the wavelet being used. In practice, we never use more than 20 memory terms and often considerably fewer. Allowing for the convolution makes the scheme even more stable (even larger time steps might be used) than it is when the convolution is entirely neglected. The accuracy of the scheme is confirmed by comparing numerical examples to exact analytic results.

54 ENVIRONMENTAL SCIENCES↗

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗

Electrooptical properties of hybrid liquid crystalline systems containing CdSe quantum dots

In this paper, we present electrooptical properties of hybrid liquid crystalline systems, which contained CdSe quantum dots (QDs). We have shown by experiments of degenerated two-wave mixing and transverse conductivity measurements that liquid crystal cells filled with nematic and doped with semiconductor nanoparticles exhibit photorefractive effect associated with photoconductivity appearing in the system. We also present the mathematical model, which explains the relationship between the photoconductivity of the layer on which the QDs reside and the generation of holographic gratings. Our research may help to develop better understanding of processes observed in such systems and create more efficient materials for holographic data storage.

77 NANOSCIENCE AND NANOTECHNOLOGY↗