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 253 records · Page 14

Kinetics of the xanthophyll cycle and its role in photoprotective memory and response

Efficiently balancing photochemistry and photoprotection is crucial for survival and productivity of photosynthetic organisms in the rapidly fluctuating light levels found in natural environments. The ability to respond quickly to sudden changes in light level is clearly advantageous. In the alga Nannochloropsis oceanica we observed an ability to respond rapidly to sudden increases in light level which occur soon after a previous high-light exposure. This ability implies a kind of memory. In this work, we explore the xanthophyll cycle in N. oceanica as a short-term photoprotective memory system. By combining snapshot fluorescence lifetime measurements with a biochemistry-based quantitative model, we show that short-term memory arises from the xanthophyll cycle. In addition, the model enables us to characterize the relative quenching abilities of the three xanthophyll cycle components. Given the ubiquity of the xanthophyll cycle in photosynthetic organisms the model described here will be of utility in improving our understanding of vascular plant and algal photoprotection with important implications for crop productivity.

59 BASIC BIOLOGICAL SCIENCES↗

Highly scalable distributed-memory sparse triangular solution algorithms.

This paper presents a highly efficient distributed-memory parallel sparse triangular solver. The triangular solution phase is often performed following factorization phase in the sparse linear solvers and has become increasingly computa­tionally expensive for direct solvers with many right hand sides (RHSs) or preconditioned iterative solvers. However, the low arithmetic intensity and sequential nature of the triangular solve algorithm pose performance challenges for its large-scale distributed-memory parallelization. In this work, we propose several strategies to enhance scalability of an algorithm with 2D block cyclic process layout. First, an asynchronous binary-tree-based communication scheme implemented via non-blocking MPI functions is leveraged to broadcast partial solutions and reduce partial updates among a subset of processes for each block column and row of the triangular matrix, respectively. This scheme reduces message latency, improves communication load balance and significantly accelerates asynchronous execution of the triangular solve. In addition, efficient BLAS operations and threading implementations are exploited to accelerate local computations and further reduce process idle time. The proposed strategies are implemented in SuperLU_DIST and numerical experiments show up to 4.4x improvement with one right-hand side and up to 6.1x improvement with 50 right- hand sides on 4096 processes, compared to the current release. This is the first time that sparse triangular solution is demonstrated strong scaling on more than 4000 cores.

Liu, Yang↗

Flash memory management system and method utilizing multiple block list windows

The present invention provides a flash memory management system and method with increased performance. The flash memory management system provides the ability to efficiently manage and allocate flash memory use in a way that improves reliability and longevity, while maintaining good performance levels. The flash memory management system includes a free block mechanism, a disk maintenance mechanism, and a bad block detection mechanism. The free block mechanism provides efficient sorting of free blocks to facilitate selecting low use blocks for writing. The disk maintenance mechanism provides for the ability to efficiently clean flash memory blocks during processor idle times. The bad block detection mechanism provides the ability to better detect when a block of flash memory is likely to go bad. The flash status mechanism stores information in fast access memory that describes the content and status of the data in the flash disk. The new bank detection mechanism provides the ability to automatically detect when new banks of flash memory are added to the system. Together, these mechanisms provide a flash memory management system that can improve the operational efficiency of systems that utilize flash memory.

Chow, James↗

Multi-Level Bitmap Indexes for Flash Memory Storage

Due to their low access latency, high read speed, and power-efficient operation, flash memory storage devices are rapidly emerging as an attractive alternative to traditional magnetic storage devices. However, tests show that the most efficient indexing methods are not able to take advantage of the flash memory storage devices. In this paper, we present a set of multi-level bitmap indexes that can effectively take advantage of flash storage devices. These indexing methods use coarsely binned indexes to answer queries approximately, and then use finely binned indexes to refine the answers. Our new methods read significantly lower volumes of data at the expense of an increased disk access count, thus taking full advantage of the improved read speed and low access latency of flash devices. To demonstrate the advantage of these new indexes, we measure their performance on a number of storage systems using a standard data warehousing benchmark called the Set Query Benchmark. We observe that multi-level strategies on flash drives are up to 3 times faster than traditional indexing strategies on magnetic disk drives.

97 MATHEMATICS AND COMPUTING↗

Temperature effects in spin-dependent Hall currents in an ideal skyrmion gas

The quest of novel reliable and fast performing logic and memory elements in classical and quantum computing requires discoveries of new effects in novel quantum materials. Skyrmions are such magnetic textures where electron scattering can essentially change the shape and location of the skyrmion, which can be used as a memory element being more efficient than domain walls as memory device in classical computing. Because the skyrmion motion is sensitive even to very small currents, we study electron scattering by skyrmions in an ideal skyrmion gas in ferromagnetic environment. In such systems, the direct and Hall currents become spin-dependent. For applications it is important to consider a Hall effect in the whole range of temperatures under the assumption of the skyrmion existence. In this study we find the nonmonotonic temperature dependence of the direct spin-up conductivity, i. e., the conductivity for the current directed along the applied electric field due to the electrons with the spin parallel to the ferromagnetic moment. Such a behavior contradicts the traditional understanding where the temperature only increases the value of the conductivity. The spin-down Hall conductivity is found to be even more dramatic exhibiting the conductivity sign change (i.e., the change in the current direction) with temperature for small skyrmion sizes. The found effects strongly depend on Fermi energy. The most pronounced dependencies take place if the Fermi energy is slightly below and above the bottom of the upper (spin-down) energy band of an ideal 2D electron gas. In addition, we also find that the direct and Hall resistivities, ρ xx and ρ xy , are independent of the exchange integral J for 2J > ε F .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient construction of generalized master equation memory kernels for multi-state systems from nonadiabatic quantum-classical dynamics

Techniques derived from the generalized quantum master equation (GQME) framework have provided the basis for elucidating energy and charge transfer in systems ranging from molecular solids to photosynthetic complexes. Recently, the nonperturbative combination of the GQME with quantum-classical methods has resulted in approaches whose accuracy and efficiency exceed those of the original quantumclassical schemes while offering significant accuracy improvements over perturbative expansions of the GQME. In this work, we show that, while the non-Markovian memory kernel required to propagate the GQME scales quartically with the number of subsystem states, the number of trajectories required scales at most quadratically when using quantum-classical methods to construct the kernel. We then present an algorithm that allows further acceleration of the quantum-classical GQME by offering a way to selectively sample the kernel matrix elements that are most important to the process of interest. We demonstrate the utility of these advances by applying the combination of Ehrenfest mean field theory with the GQME (MF-GQME) to models of the Fenna-Matthews-Olson (FMO) complex and the light harvesting complex II (LHCII), with 7 and 14 states, respectively. This allows us to show that the MF-GQME is able to accurately capture all the relevant dynamical time scales in LHCII: the initial nonequilibrium population transfer on the femtosecond time scale, the steady state-type trapping on the picosecond time scale, and the long time population relaxation. Remarkably, all of these physical effects spanning tens of picoseconds can be encoded in a memory kernel that decays only after ~65 fs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Algorithmic optimization of quantum optical storage in solids

Quantum memory devices with high storage efficiency and bandwidth are essential elements for future quantum networks. Solid-state quantum memories can provide broadband storage, but they primarily suffer from low storage efficiency. We use passive optimization and algorithmic optimization techniques to demonstrate nearly a sixfold enhancement in quantum memory efficiency. In this regime, we demonstrate coherent and single-photon-level storage with a high signal-to-noise ratio. The optimization technique presented here can be applied to most solid-state quantum memories to significantly improve the storage efficiency without compromising the memory bandwidth. Published by the American Physical Society 2024

Lei, Yisheng↗

Automatic generation of efficient array redistribution routines for distributed memory multicomputers

Appropriate data distribution has been found to be critical for obtaining good performance on Distributed Memory Multicomputers like the CM-5, Intel Paragon and IBM SP-1. It has also been found that some programs need to change their distributions during execution for better performance (redistribution). This work focuses on automatically generating efficient routines for redistribution. We present a new mathematical representation for regular distributions called PITFALLS and then discuss algorithms for redistribution based on this representation. One of the significant contributions of this work is being able to handle arbitrary source and target processor sets while performing redistribution. Another important contribution is the ability to handle an arbitrary number of dimensions for the array involved in the redistribution in a scalable manner. Our implementation of these techniques is based on an MPI-like communication library. The results presented show the low overheads for our redistribution algorithm as compared to naive runtime methods.

Ramaswamy, Shankar↗

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗

Umpire: Application-Focused Management and Coordination of Complex Hierarchical Memory

Advanced architectures like Sierra provide a wide range of memory resources that must often be carefully controlled by the user. These resources have varying capacities, access timing rules, and visibility to different compute resources. Applications must intelligently allocate data in these spaces, and depending on the total amount of memory required, applications may also be forced to move data between different parts of the memory hierarchy. Finally, applications using multiple packages must coordinate effectively to ensure that each package can use the memory resources it needs. To address these challenges, we present Umpire, an application-oriented library for managing memory resources. Specifically, Umpire provides support for querying memory resources, provisioning and allocating memory, and memory introspection. It allows computer scientists and computational physicists to efficiently program the memory hierarchies of current and future high-performance computing architectures, without tying their application to specific hardware or software. In this paper, we describe the design and implementation of Umpire and present case studies from the integration of Umpire into applications that are currently running on Sierra.

97 MATHEMATICS AND COMPUTING↗

PDG: A Composite Method Based on the Resolution of the Identity

The Gaussian-3 (G3) composite approach for thermochemical properties is revisited in light of the enhanced computational efficiency and reduced memory costs by applying the resolution-of-the-identity (RI) approximation for two-electron repulsion integrals (ERIs) to the computationally demanding component methods in the G3 model: the energy and gradient computations via the second-order Møller–Plesset perturbation theory (MP2) and the energy computations using the coupled-cluster singles–doubles method augmented with noniterative triples corrections [CCSD(T)]. Efficient implementation of the RI-based methods is achieved by employing a hybrid distributed/shared memory model based on MPI and OpenMP. The new variant of the G3 composite approach based on the RI approximation is termed the RI-G3 scheme, or alternatively the PDG method. The accuracy of the new RI-G3/PDG scheme is compared to the “standard” G3 composite approach that employs the memory-expensive four-center ERIs in the MP2 and CCSD(T) calculations. Taking the computation of the heats of formation of the closed-shell molecules in the G3/99 test set as a test case, it is demonstrated that the RI approximation introduces negligible changes to the mean absolute errors relative to the standard G3 model (less than 0.1 kcal/mol), while the standard deviations remain unaltered. Furthermore, the efficiency and memory requirements for the RI-MP2 and RI-CCSD(T) methods are compared to the standard MP2 and CCSD(T) approaches, respectively. The hybrid MPI/OpenMP-based RI-MP2 energy plus gradient computation is found to attain a 7.5× speedup over the standard MP2 calculations. For the most demanding CCSD(T) calculations, the application of the RI approximation is found to nearly halve the memory demand, confer about a 4–5× speedup for the CCSD iterations, and reduce the computational time for the compute-intensive triples correction step by several hours.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Killing of targets by effector CD8 T cells in the mouse spleen follows the law of mass action

In contrast with antibody-based vaccines, it has been difficult to measure the efficacy of T cell-based vaccines and to correlate the efficacy of CD8 T cell responses with protection again viral infections. In part, this difficulty is due to poor understanding of the in vivo efficacy of CD8 T cells produced by vaccination. Using a: recently developed experimental method of in vivo cytotoxicity we have investigated quantitative aspects of killing of peptide-pulsed targets by effector and memory CD8 T cells, specific to three epitopes of lymphocytic choriomeningitis virus (LCMV), in the mouse spleen. By analyzing data on killing of targets with varying number of epitope-specific effector and memory CD8 T cells, we find that killing of targets by effectors follows the law of mass-action, that is the death rate of peptide-pulsed targets is proportional to the frequency of CTLs in the spleen. In contrast, killing of targets by memory CD8 T cells does not follow the mass action law because the death rate of targets saturates at high frequencies of memory CD8 T cells. For both effector and memory cells, we also find little support for the killing term that includes the decrease of the death rate of targets with target cell density. Interestingly, our analysis suggests that at low CD8 T cell frequencies, memory CD8 T cells on the per capita basis are more efficient at killing peptide-pulsed targets than effectors, but at high frequencies, effectors are more efficient killers than memory T cells. Comparison of the estimated killing efficacy of effector T cells with the value that is predicted from theoretical physics and based on motility of T cells in lymphoid tissues, suggests that limiting step in the killing of peptide-pulsed targets is delivering the lethal hit and not finding the target. Our results thus form a basis for quantitative understanding of the process of killing of virus-infected cells by T cell responses in tissues and can be used to correlate the phenotype of vaccine-induced memory CD8 T cells with their killing efficacy in vivo.

59 BASIC BIOLOGICAL SCIENCES↗

Coherent spin control of a nanocavity-enhanced qubit in diamond

A central aim of quantum information processing is the efficient entanglement of multiple stationary quantum memories via photons. Among solid-state systems, the nitrogen-vacancy centre in diamond has emerged as an excellent optically addressable memory with second-scale electron spin coherence times. Recently, quantum entanglement and teleportation have been shown between two nitrogen-vacancy memories, but scaling to larger networks requires more efficient spin-photon interfaces such as optical resonators. Here we report such nitrogen-vacancy nanocavity systems in strong Purcell regime with optical quality factors approaching 10,000 and electron spin coherence times exceeding 200 µs using a silicon hard-mask fabrication process. This spin-photon interface is integrated with on-chip microwave striplines for coherent spin control, providing an efficient quantum memory for quantum networks.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Network-aware cache coherence protocol enhancement

A non-uniform memory access system includes several nodes that each have one or more processors, caches, local main memory, and a local bus that connects a node's processor(s) to its memory. The nodes are coupled to one another over a collection of point-to-point interconnects, thereby permitting processors in one node to access data stored in another node. Memory access time for remote memory takes longer than local memory because remote memory accesses have to travel across a communications network to arrive at the requesting processor. In some embodiments, inter-cache and main-memory-to-cache latencies are measured to determine whether it would be more efficient to satisfy memory access requests using cached copies stored in caches of owning nodes or from main memory of home nodes.

Roberts, David A.↗

A Case Study on Neural Inspired Dynamic Memory Management Strategies for High Performance Computing.

As high performance computing architectures pursue more computational power there is a need for increased memory capacity and bandwidth as well. A multi-level memory (MLM) architecture addresses this need by combining multiple memory types with different characteristics as varying levels of the same architecture. How to efficiently utilize this memory infrastructure is an unknown challenge, and in this research we sought to investigate whether neural inspired approaches can meaningfully help with memory management. In particular we explored neurogenesis inspired re- source allocation, and were able to show a neural inspired mixed controller policy can beneficially impact how MLM architectures utilize memory.

97 MATHEMATICS AND COMPUTING↗