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,639 records · Page 91

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. II. Linear scaling domain based pair natural orbital coupled cluster theory

Domain based local pair natural orbital coupled cluster theory with single-, double-, and perturbative triple excitations (DLPNO-CCSD(T)) is a highly efficient local correlation method. It is known to be accurate and robust and can be used in a black box fashion in order to obtain coupled cluster quality total energies for large molecules with several hundred atoms. While previous implementations showed near linear scaling up to a few hundred atoms, several nonlinear scaling steps limited the applicability of the method for very large systems. In this work, these limitations are overcome and a linear scaling DLPNO-CCSD(T) method for closed shell systems is reported. The new implementation is based on the concept of sparse maps that was introduced in Part I of this series [P. Pinski, C. Riplinger, E. F. Valeev, and F. Neese, J. Chem. Phys. 143, 034108 (2015)]. Using the sparse map infrastructure, all essential computational steps (integral transformation and storage, initial guess, pair natural orbital construction, amplitude iterations, triples correction) are achieved in a linear scaling fashion. In addition, a number of additional algorithmic improvements are reported that lead to significant speedups of the method. The new, linear-scaling DLPNO-CCSD(T) implementation typically is 7 times faster than the previous implementation and consumes 4 times less disk space for large three-dimensional systems. For linear systems, the performance gains and memory savings are substantially larger. Calculations with more than 20 000 basis functions and 1000 atoms are reported in this work. In all cases, the time required for the coupled cluster step is comparable to or lower than for the preceding Hartree-Fock calculation, even if this is carried out with the efficient resolution-of-the-identity and chain-of-spheres approximations. The new implementation even reduces the error in absolute correlation energies by about a factor of two, compared to the already accurate previous implementation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine-learning based model reduction for partial differential equations

We develop a novel synergistic approach between model reduction and machine learning. The specific goal of this project is to aid in the construction of reduced order models for basis functions that are custom-made to represent the solution of partial differential equations. Partial differential equations (PDEs) are one of the main mathematical tools for describing physical phenomena. However, due to either efficiency or necessity, for many real-world problems, we are interested in constructing reduced order models (ROMs) which focus only on the explicit computation of subsets of the active spatio-temporal scales in the problem, while treating the interaction with the rest of the scales approximately. The task of accurate representation of such interactions (usually called memory terms) constitutes a vast area of research known as model reduction. PI Stinis has significant expertise in the construction of ROMs for complex systems. In addition, in recent work with the project key participant Qadeer, they have utilized machine learning to acquire custom-made basis functions (CBFs) to expand the solutions of PDEs. In the proposed work, we will merge the two concepts by constructing ROMs for subsets of the CBFs needed to represent the solution of a PDE. Specifically, we will use the Mori-Zwanzig model reduction formalism to construct ROMs for subsets of CBFs for nonlinear PDEs of various complexity, as well as investigate the usage of CBFs in the spectral vanishing viscosity method for problems that can form shocks in finite time. The outcome of the research is aimed to be proof-of-concept about a novel synergistic approach between model reduction and machine learning, thus advancing the field of scientific machine learning. Such a capability will benefit the efficient modeling of physical systems appearing in various areas of interest to the DOE.

97 MATHEMATICS AND COMPUTING↗

Angular-spatial hp -adaptivity for radiative transfer with discontinuous Galerkin spectral element methods

Radiative transfer is important for many science and engineering applications, and numerical simulations of radiative transfer can be challenging. For instance, the radiation field is seven-dimensional – three spatial, two angular, one wavelength, and one temporal – and often features steep gradients. Therefore, memory usage is a key issue. To reduce memory, some past work has investigated the use of adaptive mesh refinement (AMR), typically for either the spatial or angular coordinate, and typically for only h -adaptivity. Here, we propose the use of AMR for the spatial and angular coordinates together, and the use of h - and p -adaptivity together as hp -AMR for the potential for further memory savings. We implemented the proposed method for several test cases in two spatial and one angular dimension, with the discontinuous Galerkin spectral element method. These test cases featured highly anisotropic angular radiation, with or without steep spatial gradients. Our primary findings from these test cases were: (1) Angular hp -adaptivity can deliver the radiation solution with the same accuracy as, and with much less computational memory than, uniform angular h - or p -refinements, or angular h -adaptivity alone. This is most obvious when the incoming radiation is highly anisotropic, in which case the savings can be orders of magnitude. (2) Full spatial-angular hp -adaptivity is more efficient in solution representation, compared to solely spatial or solely angular -adaptivity. This is most evident when steep gradients are present in both the spatial and angular distribution. These results suggest that adaptive spatial- hp angular-refinement may perform well in large-scale seven-dimensional applications.

Adaptive refinement↗

An alternative realization of the exact non-Markovian stochastic Schrödinger equation

Based on the path integral approach, we derive a new realization of the exact non-Markovian stochastic Schrödinger equation (SSE). The main difference from the previous non-Markovian quantum state diffusion (NMQSD) method is that the complex Gaussian stochastic process used for the forward propagation of the wave function is correlated, which may be used to reduce the amplitude of the non-Markovian memory term at high temperatures. The new SSE is then written into the recently developed hierarchy of pure states scheme, in a form that is more closely related to the hierarchical equation of motion approach. Numerical simulations are then performed to demonstrate the efficiency of the new method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast entanglement distribution with atomic ensembles and fluorescent detection

Quantum repeaters based on atomic ensemble quantum memories are promising candidates for achieving scalable distribution of entanglement over long distances. Recently, important experimental progress has been made toward their implementation. However, the entanglement rates and scalability of current approaches are limited by relatively low retrieval and single-photon detector efficiencies. We propose a scheme which makes use of fluorescent detection of stored excitations to significantly increase the efficiency of connection and hence the rate. Practical performance and possible experimental realizations of the new protocol are discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Space Tug avionics definition study. Volume 1: Executive summary

A top down approach was used to identify, compile, and develop avionics functional requirements for all flight and ground operational phases. Such requirements as safety mission critical functions and criteria, minimum redundancy levels, software memory sizing, power for tug and payload, data transfer between payload, tug, shuttle, and ground were established. Those functional requirements that related to avionics support of a particular function were compiled together under that support function heading. This unique approach provided both organizational efficiency and traceability back to the applicable operational phase and event. Each functional requirement was then allocated to the appropriate subsystems and its particular characteristics were quantified.

Source record↗

Teleoperated position control of a PUMA robot

A laboratory distributed computer control teleoperator system is developed to support NASA's future space telerobotic operation. This teleoperator system uses a universal force-reflecting hand controller in the local iste as the operator's input device. In the remote site, a PUMA controller recieves the Cartesian position commands and implements PID control laws to position the PUMA robot. The local site uses two microprocessors while the remote site uses three. The processors communicate with each other through shared memory. The PUMA robot controller was interfaced through custom made electronics to bypass VAL. The development status of this teleoperator system is reported. The execution time of each processor is analyzed, and the overall system throughput rate is reported. Methods to improve the efficiency and performance are discussed.

Austin, Edmund↗

Multiprocessor architecture: Synthesis and evaluation

Multiprocessor computed architecture evaluation for structural computations is the focus of the research effort described. Results obtained are expected to lead to more efficient use of existing architectures and to suggest designs for new, application specific, architectures. The brief descriptions given outline a number of related efforts directed toward this purpose. The difficulty is analyzing an existing architecture or in designing a new computer architecture lies in the fact that the performance of a particular architecture, within the context of a given application, is determined by a number of factors. These include, but are not limited to, the efficiency of the computation algorithm, the programming language and support environment, the quality of the program written in the programming language, the multiplicity of the processing elements, the characteristics of the individual processing elements, the interconnection network connecting processors and non-local memories, and the shared memory organization covering the spectrum from no shared memory (all local memory) to one global access memory. These performance determiners may be loosely classified as being software or hardware related. This distinction is not clear or even appropriate in many cases. The effect of the choice of algorithm is ignored by assuming that the algorithm is specified as given. Effort directed toward the removal of the effect of the programming language and program resulted in the design of a high-level parallel programming language. Two characteristics of the fundamental structure of the architecture (memory organization and interconnection network) are examined.

Standley, Hilda M.↗

Certifying Domain-Specific Policies

Proof-checking code for compliance to safety policies potentially enables a product-oriented approach to certain aspects of software certification. To date, previous research has focused on generic, low-level programming-language properties such as memory type safety. In this paper we consider proof-checking higher-level domain -specific properties for compliance to safety policies. The paper first describes a framework related to abstract interpretation in which compliance to a class of certification policies can be efficiently calculated Membership equational logic is shown to provide a rich logic for carrying out such calculations, including partiality, for certification. The architecture for a domain-specific certifier is described, followed by an implemented case study. The case study considers consistency of abstract variable attributes in code that performs geometric calculations in Aerospace systems.

Lowry, Michael↗

Implementing Concurrent Non-Event Transitionsin CMS

Available on CMS information serverCMS CR -2018/277The Compact Muon Solenoid ExperimentMailing address: CMS CERN, CH-1211 GENEVA 23, SwitzerlandConference Report15 October 2018 (v2, 21 November 2018)Implementing Concurrent Non-Event Transitionsin CMSChristopher Jones for the CMS CollaborationAbstractSince the beginning of the LHC Run 2 in 2016 the CMS data processing framework, CMSSW, hasbeen running with multiple threads during production of data and simulation via the use of IntelsThread Building Blocks (TBB) library. The TBB library utilizes tasks as concurrent units of work.CMS used these tasks to allow both concurrent processing of events as well as concurrent running ofmodules processing the same event. This design has served CMS well and has allowed jobs to utilizeless memory per core as well as reduce the number of jobs that must be tracked by CMSs worflowmanagement system. As CMS has begun to utilize greater number of threads in a job, the effect ofserialization points in the framework has decreased jobs CPU efficiency. One major serialization pointoccurs when the framework processes a non-Event transition. These transitions occur when a new Runor LuminosityBlock is to be processed. In this talk we will discuss how the different transitions definethe processing model for CMSSW and how we were able to successfully allow concurrent process-ing of those transitions using TBB via task queues. We will also show CPU efficiency comparisonsbetween the same work being done with and without the additional concurrency.

Jones, Christopher↗

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗

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.↗

Design and Implementation of a High-Performance CCA Event Service

Event services based on publish-subscribe architectures are well established components of distributed computing applications. Recently, an event service has been proposed as part of the Common Component Architecture (CCA) for high-performance computing applications. In this paper we describe our implementation, experimental evaluation, and initial experience with a high performance CCA event service that exploits efficient communications mechanisms commonly used on high-performance computing (HPC) platforms. We describe the CCA event service model, and discuss briefly the possible implementation strategies of that model. We then present the design and implementation of the event service using the Aggregate Remote Memory Copy Interface (ARMCI) as an underlying communication layer for this mechanism. Two alternative implementations are presented and evaluated on a Cray XD-1 platform. The performance results demonstrate that event delivery latencies are low and that the event service is able to achieve high throughput levels. Finally, we describe the use of the event service in an application for high-speed processing of data from a mass spectrometer, and conclude by discussing some possible extensions to the event service for other HPC applications.

97 MATHEMATICS AND COMPUTING↗

Implementation of Triply Periodic Minimal Surfaces (TPMS) as surface objects in OpenMC

Triply Periodic Minimal Surfaces (TPMS) represent a promising geometry for future fuel designs due to their significant surface-to-volume ratio, which facilitates efficient cooling of nuclear fuel, a crucial factor for safety and efficiency. Demonstrating the remarkable capabilities of TPMS fuel requires initial modeling and simulation. This paper presents an implementation of TPMS in the Monte Carlo code OpenMC, enabling reactor physics modeling of TPMS. Here, the primary advantages over traditional methods using CAD files include reduced memory requirements for computations and high-fidelity implementation. This implementation has been tested against CAD files loaded in Serpent2, yielding promising results with low biases in the $k_{\textrm{eff}}$, comparable to biases in the material balance sheet. The implementation presented in this work will be used in future reactor physics computations related to new reactor designs involving TPMS-based fuels.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗