Search NASA⌕ Search

SEARCH · Search NASA

Results for “computing applications”

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 541 records · Page 30

Quantum computing for fusion energy science applications

This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum computation, and quantum algorithms. Then, we explore the topic of using quantum computers to simulate both linear and nonlinear dynamics in greater detail. Because quantum computers can only efficiently perform linear operations on the quantum state, it is challenging to perform nonlinear operations that are generically required to describe the nonlinear differential equations of interest. In this work, we extend previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator, the Perron–Frobenius evolution operator, and the Koopman–von Neumann evolution (KvN) operator. We also explicitly derive the connection between the Koopman and Carleman approaches to embedding. Extension of the KvN framework to the complex-analytic setting relevant to Carleman embedding, and the proof that different choices of complex analytic reproducing kernel Hilbert spaces depend on the choice of Hilbert space metric are covered in the appendixes. Finally, we conclude with a review of recent quantum hardware implementations of algorithms on present-day quantum hardware platforms that may one day be accelerated through Hamiltonian simulation. We discuss the simulation of toy models of wave–particle interactions through the simulation of quantum maps and of wave–wave interactions important in nonlinear plasma dynamics.

Joseph, I. (ORCID:0000000255400840)↗

SharP Data Constructs: Data Constructs to Enable Data-Centric Computing

Extreme-scale applications (i.e., Big-Compute) are becoming increasingly data-intensive, i.e., producing and consuming increasingly large amounts of data. The HPC systems traditionally used for these applications are now used for Big-Data applications such as data analytics, social network analysis, machine learning, and genomics. As a consequence of these trends, the system architecture should be flexible and data-centric. This can already be witnessed in the pre-exascale systems with TBs of on-node hierarchical and heterogeneous memories, PBs of system memory, low-latency, high-throughput networks, and many threaded cores. As such, the pre-exascale systems suit the needs of both Big-Compute and Big-Data applications. Though the system architecture is flexible enough to support both Big-Compute and Big-Data, we argue there is a software gap. Particularly, we need data-centric abstractions to leverage the full potential of the system, i.e., there is a need for native support for data resilience, the ability to express data locality and affinity, mechanisms to reduce data movement, the ability to share data, and abstractions to express User's data usage and data access patterns. In this paper, we (i) show the need for taking a holistic approach towards data-centric abstractions, (ii) show how these approaches were realized in the SHARed data-structure centric Programming abstraction (SharP) library, a data-structure centric programming abstraction, and (iii) apply these approaches to a variety of applications that demonstrate its usefulness. Particularly, we apply these approaches to QMCPack and the Graph500 benchmark and demonstrate the advantages of this approach on extreme-scale systems.

Aderholdt, William Ferrol↗

Celeritas: Accelerating Geant4 with GPUs

Celeritas [1] is a new Monte Carlo (MC) detector simulation code designed for computationally intensive applications (specifically, High Lumi- nosity Large Hadron Collider (HL-LHC) simulation) on high-performance heterogeneous architectures. In the past two years Celeritas has advanced from prototyping a GPU-based single physics model in infinite medium to implementing a full set of electromagnetic (EM) physics processes in complex geometries. The current release of Celeritas, version 0.3, has incorporated full device-based navigation, an event loop in the presence of magnetic fields, and detector hit scoring. New functionality incorporates a scheduler to offload electromagnetic physics to the GPU within a Geant4-driven simulation, enabling integration of Celeritas into high energy physics (HEP) experimental frameworks such as CMSSW. On the Summit supercomputer, Celeritas performs EM physics between 6 and 32 faster using the machine’s Nvidia GPUs compared to using only CPUs. When running a multithreaded Geant4 ATLAS test beam application with full hadronic physics, using Celeritas to accelerate the EM physics results in an overall simulation speedup of 1.8–2.3× on GPU and 1.2× on CPU.

Johnson, Seth R.↗

Final Report An in situ, streaming, data- and compute-intensive platform for experimental data

Data-intensive and compute-intensive applications are the two essential methods supporting the scientific discovery process. Until recently, the development of technologies supporting the corresponding schemes evolved along two independent paths. Born and matured before the Big Data era, high-performance computing (HPC) scientific-oriented applications were not designed for Big Data streaming frameworks. But an efficient processing framework offered by the Spark computational platform has resolved many of the barriers to enable compute-intensive applications from within a data-intensive environment. Our Phase I project extended Spark with pipelines that utilize HPC applications. As a result, the project immediately addressed emerging high-throughput experiments driven by a new generation of X-ray instruments. After successful completion of Phase I, we are in a strong position for proposing a successful Phase II project.

97 MATHEMATICS AND COMPUTING↗

Computational thermodynamics and its applications

Thermodynamics is a science concerning the state of a system, whether it is stable, metastable or un- stable, when interacting with the surroundings. In this overview, fundamentals of thermodynamics are briefly reviewed through the combination of first and second laws of thermodynamics for open and nonequilibrium systems to demonstrate that the reversible equilibrium and irreversible nonequilibrium thermodynamics can be integrated to enhance the power and utilities of thermodynamics. The recent progresses in computational thermodynamics, the remaining challenges, and potential impacts in broad scientific fields are discussed here. It is shown that computational thermodynamics enables the modeling of thermodynamics of a state as a function of both external and internal variables and quantitative calculations of a broad range of properties of a multicomponent system in terms of first and second derivatives of energy, including not only equilibrium states when there are no driving forces for any internal processes and but also non-equilibrium states with driving forces for internal processes. Consequently, external constraints such as fixed strain and internal degree of freedoms such as ordering and defects can be described in a coherent framework and applied to materials design. Furthermore, two important but largely overlooked aspects in thermodynamics will be discussed, i.e. the rigorous application of statistical thermodynamics with the probability of configurations and their contributions to system properties, and the applications of second derivatives of energy with respect to either two extensive variables or two potentials or a mixture of them in terms of understanding and predicting emergent behaviors, critical phenomena, kinetic coefficients, and mechanical properties.

36 MATERIALS SCIENCE↗

Budget-based power consumption for application execution on a plurality of compute nodes

Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

97 MATHEMATICS AND COMPUTING↗

Application of High Performance Computing for Simulating Cycle-to-Cycle Variation in Dual-Fuel Combustion Engines

Interest in operational cost reduction is driving engine manufacturers to consider lower-cost fuel substitution in heavy-duty diesel engines. These dual-fuel (DF) engines could be operated either in diesel-only mode or operated with premixed natural gas (NG) ignited by a pilot flame of compression-ignited direct-injected diesel fuel. One promising application is that of large-bore, medium-speed engines such as those used in locomotives. With realistic natural gas substitution levels in the fleet of locomotives currently in service, such fuel substitution could result in billions of dollars of savings annually in the US alone. However, under certain conditions, dual-fuel operation can result in increased cycle-to-cycle variability (CCV) during combustion, resulting in variations in cylinder pressure and work extraction. In certain situations, the CCV of dual-fuel operation can be notably higher than that of diesel-only combustion under similar operating conditions. Excessive CCV can limit the NG substitution rate and operating range of a dual-fuel engine by increasing emissions and reducing engine stability, reliability and fuel efficiency via incomplete natural-gas combustion. Running multiple engine cycles in series to simulate CCV can be quite time consuming. Hence innovative modelling techniques and large computing resources are needed to investigate the factors affecting CCV in dual-fuel engines. This paper discusses the use of the High Performance Computing resource Titan, at the Oak Ridge Leadership Computing Facility at Oak Ridge National Laboratory, to investigate cycle-to-cycle combustion variability of a dual-fuel engine. The CONVERGE CFD software was used to simulate multiple, parallel single cycles of dual-fuel combustion with perturbed operating parameters and boundary conditions. These perturbations are imposed according to a sparse grids sampling of the parameter space. The sampling scheme chosen is similar to a design of experiments method but uses functions designed to minimize the number of samples required to achieve a desired degree of accuracy. The perturbed input parameters were connected to engine performance output over a large parameter space. Additionally, the same methodology was used to perform a set of diesel-only simulations at similar operating conditions to assess the numerical capability of capturing relatively low combustion variation. Lastly, this technique is expected to be useful to understand and predict combustion stability limits (knock and misfire) which are important for designing dual-fuel engines with improved operability and reliability.

33 ADVANCED PROPULSION SYSTEMS↗

Budget-based power consumption for application execution on a plurality of compute nodes

Methods, apparatus, and products are disclosed for budget-based power consumption for application execution on a plurality of compute nodes that include: assigning an execution priority to each of one or more applications; executing, on the plurality of compute nodes, the applications according to the execution priorities assigned to the applications at an initial power level provided to the compute nodes until a predetermined power consumption threshold is reached; and applying, upon reaching the predetermined power consumption threshold, one or more power conservation actions to reduce power consumption of the plurality of compute nodes during execution of the applications.

97 MATHEMATICS AND COMPUTING↗

Fractional Josephson current through a Luttinger liquid with topological excitations

Recently, the Majorana fermion has received great attentions due to its promising application in the fault-tolerant quantum computation. This application requires more accessible methods to detect the motion and braiding of the Majorana fermions. We use a Luttinger liquid ring to achieve this goal, where the ring geometry is nontrivial in the sense that it leads to fermion-parity-dependent topological excitations. First, we briefly review the essential physics of the Luttinger liquid and the Majorana fermion, in order to give an introduction of the general framework used in the following main work. Then, we theoretically investigated the DC Josephson effect between two topological superconductors via a Luttinger liquid ring. A low-energy effective Hamiltonian is derived to show the existence of the fractional Josephson current. Also, we find that the amplitude of the Josephson current, which is determined by the correlation function of Luttinger liquid, exhibits different behaviors in terms of the parity of Luttinger liquid due to the topological excitations. Our results suggest a possible method to detect the Majorana fermions and their tunneling process.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Regularized Finite Element Formulations for Shear Band Instabilities in Metals

In my research I have addressed several fundamental issues of dynamic fracture: 1. established the role of heat conduction as a natural regularizing mechanism in shearband problems (i.e. using the correct physics for this problem), 2. developed a unified model to incorporate fracture through a modified phase field formulation, 3. developed stability analysis tools to determine the onset of localization, 4. developed discretization methods and solvers to solve this problem (on parallel computers) that lead to mesh insensitive results and fast convergence. For such difficult problems, the physics and numerics are strongly coupled. To accurately model the physics, one must develop reliable numerics but reliable numerics depends on correct description of the physics. To this end, we have already made significant progress in the field showing that a fully-coupled implicit solution with heat conduction is the key to obtain reliable results for shear bands (see the next sections for more details). This research fits well within the mission of DOE ASCR program on all aspects: from governing equations to discretization to solvers to parallel computers to applications problems. It also relies on the computational tools developed through the SciDAC institutes FASTMath and SDAV, such as PETSc (and SLEPc), ParaView, Trilinos and Masquite.

97 MATHEMATICS AND COMPUTING↗

An efficient algorithm for simulating ensembles of parameterized flow problems

Abstract Many applications of computational fluid dynamics require multiple simulations of a flow under different input conditions. In this paper, a numerical algorithm is developed to efficiently determine a set of such simulations in which the individually independent members of the set are subject to different viscosity coefficients, initial conditions and/or body forces. The proposed scheme, when applied to the flow ensemble, needs to solve a single linear system with multiple right-hand sides, and thus is computationally more efficient than solving for all the simulations separately. We show that the scheme is nonlinearly and long-term stable under certain conditions on the time-step size and a parameter deviation ratio. A rigorous numerical error estimate shows the scheme is of first-order accuracy in time and optimally accurate in space. Several numerical experiments are presented to illustrate the theoretical results.

Mathematics↗

FLIT: A Generic Fortran Library based on Interfaces and Templates

This Fortran code consists of multiple modules with a focus on simplifying array operations, image processing, and numerical computation especially for computational geophysics applications. We intend to use this code to demonstrate the application and usefulness of Fortran interface and templates for generic programming, especially for computational geophysics and seismology applications. The code has several notable features. Firstly, it is based on a modularized structure, where each module contains multiple functions but with a focus of functionality. Secondly, it heavily uses interfaces and templates for improving the genericness and convenience of the resulting code, where a same function interface can enclose a group of functions that perform the same functionality but with inputs/output variables of different data types. Thirdly, it includes a variety of generic functions with an emphasis on array operations, such as rotation, flipping, cropping, padding, fast Fourier transform, Gaussian blurring, interpolation, and so on. We name this package FLIP – a generic Fortran Library based on Interfaces and Templates.

Gao, Kai↗

Power API Prototype

The software serves two purposes. The first purpose of the software is to prototype the Sandia High Performance Computing Power Application Programming Interface Specification effort. The specification can be found at http://powerapi.sandia.gov . Prototypes of the specification were developed in parallel with the development of the specification. Release of the prototype will be instructive to anyone who intends to implement the specification. More specifically, our vendor collaborators will benefit from the availability of the prototype. The second is in direct support of the PowerInsight power measurement device, which was co-developed with Penguin Computing. The software provides a cluster wide measurement capability enabled by the PowerInsight device. The software can be used by anyone who purchases a PowerInsight device. The software will allow the user to easily collect power and energy information of a node that is instrumented with PowerInsight. The software can also be used as an example prototype implementation of the High Performance Computing Power Application Programming Interface Specification.

Laros III, James↗

Power API Prototype

The software serves two purposes. The first purpose of the software is to prototype the Sandia High Performance Computing Power Application Programming Interface Specification effort. The specification can be found at http://powerapi.sandia.gov . Prototypes of the specification were developed in parallel with the development of the specification. Release of the prototype will be instructive to anyone who intends to implement the specification. More specifically, our vendor collaborators will benefit from the availability of the prototype. The second is in direct support of the PowerInsight power measurement device, which was co-developed with Penguin Computing. The software provides a cluster wide measurement capability enabled by the PowerInsight device. The software can be used by anyone who purchases a PowerInsight device. The software will allow the user to easily collect power and energy information of a node that is instrumented with PowerInsight. The software can also be used as an example prototype implementation of the High Performance Computing Power Application Programming Interface Specification.

Source record↗

Demonstrating the viability of Lagrangian in situ reduction on supercomputers

Performing exploratory analysis and visualization of large-scale time-varying computational science applications is challenging due to inaccuracies that arise from under-resolved data. In recent years, Lagrangian representations of the vector field computed using in situ processing are being increasingly researched and have emerged as a potential solution to enable exploration. However, prior works have offered limited estimates of the encumbrance on the simulation code as they consider “theoretical” in situ environments. Further, the effectiveness of this approach varies based on the nature of the vector field, benefitting from an in-depth investigation for each application area. With this study, an extended version of Sane et al. (2021), we contribute an evaluation of Lagrangian analysis viability and efficacy for simulation codes executing at scale on a supercomputer. We investigated previously unexplored cosmology and seismology applications as well as conducted a performance benchmarking study by using a hydrodynamics mini-application targeting exascale computing. Here, to inform encumbrance, we integrated in situ infrastructure with simulation codes, and evaluated Lagrangian in situ reduction in representative homogeneous and heterogeneous HPC environments. To inform post hoc accuracy, we conducted a statistical analysis across a range of spatiotemporal configurations as well as a qualitative evaluation. Additionally, our study contributes cost estimates for distributed-memory post hoc reconstruction. In all, we demonstrate viability for each application — data reduction to less than 1% of the total data via Lagrangian representations, while maintaining accurate reconstruction and requiring under 10% of total execution time in over 90% of our experiments.

97 MATHEMATICS AND COMPUTING↗

Storing files in a parallel computing system based on user or application specification

Techniques are provided for storing files in a parallel computing system based on a user-specification. A plurality of files generated by a distributed application in a parallel computing system are stored by obtaining a specification from the distributed application indicating how the plurality of files should be stored; and storing one or more of the plurality of files in one or more storage nodes of a multi-tier storage system based on the specification. The plurality of files comprise a plurality of complete files and/or a plurality of sub-files. The specification can optionally be processed by a daemon executing on one or more nodes in a multi-tier storage system. The specification indicates how the plurality of files should be stored, for example, identifying one or more storage nodes where the plurality of files should be stored.

97 MATHEMATICS AND COMPUTING↗

A three-phase workflow for general and expressive representations of nondeterminism in HPC applications

Nondeterminism is an increasingly entrenched property of high-performance computing (HPC) applications and has recently been shown to seriously hamper debugging and reproducibility efforts. Additionally, tools for addressing the nondeterministic debugging problem have emerged, but they do not provide methods for systematically cataloging the nondeterminism in a given application. We propose a three-phase workflow for representing executions of nondeterministic message passing interface programs as event graphs, quantifying their structural similarity with graph kernels, and applying machine learning techniques to investigate shared properties across applications. We present an empirical study comparing two graph kernels’ suitability for this task and propose future uses of the methodology.

97 MATHEMATICS AND COMPUTING↗

RedThreads: An Interface for Application-Level Fault Detection/Correction Through Adaptive Redundant Multithreading

In the presence of accelerated fault rates, which are projected to be the norm on future exascale systems, it will become increasingly difficult for high-performance computing (HPC) applications to accomplish useful computation. Due to the fault-oblivious nature of current HPC programming paradigms and execution environments, HPC applications are insufficiently equipped to deal with errors. We believe that HPC applications should be enabled with capabilities to actively search for and correct errors in their computations. The redundant multithreading (RMT) approach offers lightweight replicated execution streams of program instructions within the context of a single application process. Furthermore, the use of complete redundancy incurs significant overhead to the application performance.

97 MATHEMATICS AND COMPUTING↗