Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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 1,747 records · Page 97

TRUST Contact Thermal Conductance (TRUST-CTC) Report: FY23

The objective of the Delivery Environments (DE) Testbeds to Reduce Uncertainties in Simulations and Tests (TRUST) work package is to quantify and help increase confidence in specific areas of computational and experimental capabilities that are applicable to current and future delivery environments. More complete quantification of confidence in experimental and computational capabilities and the sufficient increase of confidence in those capabilities is critical to improving weapons engineering design, qualification, and assessment efforts that are critical to the current and future stockpile. Staff development will include cross-discipline training to provide engineers with experience in both numerical simulations and experimental methods. This work will use and provide feedback on analysis tools and experimental results databases for efficient and responsive engineering which are currently under development: engineering common model framework (ECMF), engineering quantification of margins and uncertainties (EQMU), test information management system (TIMS), and [WAVES] Analysis for Verified Engineering Simulation (WAVES).

42 ENGINEERING↗

TRUST Contact Thermal Conductance (TRUST-CTC) Report: FY24

The objective of the Delivery Environments (DE) Testbeds to Reduce Uncertainties in Simulations and Tests (TRUST) project is to quantify and help increase confidence in specific areas of computational and experimental capabilities that are applicable to current and future delivery environments. More complete quantification of confidence in experimental and computational capabilities and the sufficient increase of confidence in those capabilities is critical to improving weapons engineering design, qualification, and assessment efforts that are critical to the current and future stockpile. Staff development will include cross-discipline collaboration to provide engineers with experience in both numerical simulations and experimental methods. This work uses and provides feedback on analysis tools and experimental results databases for efficient and responsive engineering which are currently under development. TRUST currently includes five testbeds and their associated engineering analysis baseline models (EABMs): 1. contact thermal conductivity, (CTC) 2. nonlinear dynamics, (ND) 3. sensors in environments for accelerometers, (SEA) 4. sensors in environments for fiber optic displacement gages, and (SEFOD) 5. sensors in environments for thermocouples (SETC). The TRUST project uses single-feature testbeds to quantify uncertainties in specific models and experiments and to identify capability development needs that can help to reduce these uncertainties. Each testbed is designed, configured, and tested in collaboration with groups with design and experimental capability: E-14 and MPA-CINT. The complementary simulations are conducted using W-13 analysis tools and stored in model repositories with plans for incremental progress toward EABM requirements. W-13 extends and exercises the testbed simulations in collaboration with experimentalists for uncertainty quantification of current and future materials, geometries, and environments. Additionally, TRUST is intended to provide engineers in W-13 and E-14 with experience in both numerical simulations and experimental methods through cross-discipline collaborations. Following the introduction to the TRUST project, the remainder of this report focuses on experimental and analytical efforts conducted in Fiscal Year (FY) 2024 relevant to the TRUST Contact Thermal Conductance (CTC) testbed.

42 ENGINEERING↗

An Integrated Framework for Memory-Centric Analysis: From Trace Collection to Co-Design

The memory wall phenomenon—where advances in processor performance significantly outpace those in memory subsystems—poses a fundamental challenge for contemporary computing systems. In memory-bound applications, memory subsystem behavior dominates performance, yet existing analysis approaches present significant limitations: detailed microarchitectural simulators require days to weeks to simulate modest workloads; hardware performance counters provide only aggregate statistics that obscure temporal and spatial access patterns; and scaled simulation approaches face challenges in capturing certain behaviors that emerge at larger scales. These limitations reflect a processor-centric design philosophy increasingly misaligned with memory-bound workloads where detailed understanding of memory access patterns, cache hierarchy interactions, and contention is critical for effective optimization. This paper presents an integrated framework for memory-centric analysis that enables effective hardware-software co-design. We describe practical trace collection techniques, including hardware-assisted processor tracing with minimal overhead and portable software-based instrumentation with statistical sampling. We present multi-perspective analysis methods that examine memory behavior from temporal, sequential, spatial, and relational viewpoints, revealing distinct optimization opportunities invisible in aggregate metrics. We detail an architectural modeling framework that uses sampled traces with temporal interpolation and confidence-based filtering to evaluate cache and memory configurations. Evaluation on representative benchmarks demonstrates that this framework achieves practical accuracy (L2 cache errors of 2.64\%, confidence-filtered L3 errors of 9.92\%, bandwidth errors of 7.33\%) while providing substantial speedup (26.8×) over cycle-accurate simulation, enabling rapid design space exploration. We demonstrate how this integrated framework enables systematic identification of both hardware optimizations (memory controller tuning, bank partitioning, NUMA configuration) and software optimizations (data layout restructuring, prefetching strategies, memory-aware scheduling). Through this comprehensive treatment of the memory-centric analysis pipeline—from trace collection through architectural modeling to co-design application—we provide researchers and practitioners with practical techniques for addressing memory bottlenecks in contemporary computing systems.

Gajaria, Dhruv Mayur↗

High-throughput calculations of charged point defect properties with semi-local density functional theory—performance benchmarks for materials screening applications

Abstract Calculations of point defect energetics with Density Functional Theory (DFT) can provide valuable insight into several optoelectronic, thermodynamic, and kinetic properties. These calculations commonly use methods ranging from semi-local functionals with a-posteriori corrections to more computationally intensive hybrid functional approaches. For applications of DFT-based high-throughput computation for data-driven materials discovery, point defect properties are of interest, yet are currently excluded from available materials databases. This work presents a benchmark analysis of automated, semi-local point defect calculations with a-posteriori corrections, compared to 245 “gold standard” hybrid calculations previously published. We consider three different a-posteriori correction sets implemented in an automated workflow, and evaluate the qualitative and quantitative differences among four different categories of defect information: thermodynamic transition levels, formation energies, Fermi levels, and dopability limits. We highlight qualitative information that can be extracted from high-throughput calculations based on semi-local DFT methods, while also demonstrating the limits of quantitative accuracy.

36 MATERIALS SCIENCE↗

Anomaly Detection in Moving-Camera Video Sequences Using Principal Subspace Analysis

This study presents a family of algorithms based on sparse decompositions that detect anomalies in video sequences obtained from slow moving cameras. These algorithms start by computing the union of subspaces that best represents all the frames from a reference (anomaly free) video as a low-rank projection plus a sparse residue. Then, they perform a low-rank representation of a target (possibly anomalous) video by taking advantage of both the union of subspaces and the sparse residue computed from the reference video. Such algorithms provide good detection results while at the same time obviating the need for previous video synchronization. However, this is obtained at the cost of a large computational complexity, which hinders their applicability. Another contribution of this paper approaches this problem by using intrinsic properties of the obtained data representation in order to restrict the search space to the most relevant subspaces, providing computational complexity gains of up to two orders of magnitude. The developed algorithms are shown to cope well with videos acquired in challenging scenarios, as verified by the analysis of 59 videos from the VDAO database that comprises videos with abandoned objects in a cluttered industrial scenario.

47 OTHER INSTRUMENTATION↗

Optimizing Communication in 2D Grid-Based MPI Applications at Exascale

The new reality of exascale computing faces many challenges in achieving optimal performance on large numbers of nodes. A key challenge is the efficient utilization of the message-passing interface (MPI), a critical component for process communication. This paper explores communication optimization strategies to harness the GPU-accelerated architectures of these supercomputers. We focus on MPI applications where processors form a two-dimensional process grid, a common arrangement in applications involving dense matrix operations. This configuration offers a unique opportunity to implement innovative strategies to improve performance and maintain effective load distribution. We study two applications— Dist-FW (Apsp:all-pair-shortest-path) and HPL-MxP (LU factorization with Mixed precision)—on two accelerated systems: Summit (IBM Power and NVIDIA V100) and Frontier (AMD EPYC and MI250X). These supercomputers are operated by the Oak Ridge Leadership Computing Facility (OLCF) and are currently ranked #1 and #5 on the Top500 list. We show how to scale up both applications to exascale levels and tackle the MPI challenges related to implementation, synchronization, and performance. We also compare the performance of several communication strategies at an unprecedented scale. Accurately predicting application performance becomes crucial for cost reduction as the computational scale grows. To address this, we suggest a hyperbolic model as a better alternative to the traditional one-sided asymptotic model for predicting future application performance at such large scales.

Lu, Hao↗

Elastic Resource Management for Deep Learning Applications in a Container Cluster

The increasing demand for learning from massive datasets is restructuring our economy. Effective learning, however, involves nontrivial computing resources. Most businesses utilize commercial infrastructure providers (e.g., AWS) to host their computing clusters in the cloud, where various jobs compete for available resources. While cloud resource management is a fruitful research field that has made many advances in production, such as Kubernetes and YARN, few efforts have been invested to further optimize the system performance, especially for deep learning (DL) training jobs in a container cluster. This work introduces FlowCon, a system that is able to monitor the individual evaluation functions of DL jobs at runtime, and thus to make placement decisions on resource allocations elastically. Here, we present a detailed design and implementation of FlowCon and conduct intensive experiments over various DL models. The results demonstrate that FlowCon significantly improves DL job completion time and resource utilization efficiency, compared to default systems. According to the results, FlowCon is able to improve the completion time by up to 68.8% and meanwhile, reduce the makespan by 18.0%, in the presence of various DL job workloads.

97 MATHEMATICS AND COMPUTING↗

Opal: A Centralized Memory Manager for Investigating Disaggregated Memory Systems

Many modern applications have memory footprints that are increasingly large, driving system memory capacities higher and higher. Moreover, these systems are often organized where the bulk of the memory is collocated with the compute capability, which necessitates the need for message passing APIs to facilitate information sharing between compute nodes. Due to the diversity of applications that must run on High-Performance Computing (HPC) systems, the memory utilization can fluctuate wildly from one application to another. And, because memory is located in the node, maintenance can become problematic because each node must be taken offline and upgraded individually. To address these issues, vendors are exploring disaggregated, memory-centric, systems. In this type of organization, there are discrete nodes, reserved solely for memory, which are shared across many compute nodes. Due to their capacity, low-power, and non-volatility, Non-Volatile Memories (NVMs) are ideal candidates for these memory nodes. This report discusses a new component for the Structural Simulation Toolkit (SST), Opal, that can be used to study the impact of using NVMs in a disaggregated system in terms of performance, security, and memory management. This page intentionally left blank.

97 MATHEMATICS AND COMPUTING↗

Multi-level Monte Carlo methods in chemical applications with Lennard-Jones potentials and other landscapes with isolated singularities

We describe and compare outcomes of various Multi-Level Monte Carlo (MLMC) method variants, motivated by the potential of improved computational efficiency over rejection based Monte Carlo, which scales poorly with problem dimension. With an eye toward its application to computational chemical physics, we test MLMC's ability to sample trajectories on two problems — a familiar double-well potential, with known stationary distributions, and a Lennard-Jones solid potential (a Galton Board). By sampling Brownian motion trajectories, we are able to compute expectations of observable averages. These multi-basin potential energy problems capture the essence of the challenges with using MLMC, namely, maintaining correspondence of sample paths as time-resolution is varied. Addressing this challenge properly can lead to MLMC significantly outperforming standard Monte Carlo path sampling. We describe the essence of this problem and suggest strategies that circumvent diverging multilevel sample paths for an important class of problems. In the tests we also compare the computational cost of several, “adaptive,” variants of MLMC. Our results demonstrate that MLMC overcomes the collision, time scale limitation of the more familiar Brownian path MC samplers, and our implementation provides tunable error thresholds, making MLMC a promising candidate for application to larger and more complex molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Practical Considerations for Continuum Models Applied to Surface Electrochemistry

We report that modelling the electrolyte at the electrochemical interface remains a major challenge in ab initio simulations of charge transfer processes at surfaces. Recently, the development of hybrid polarizable continuum models/ab initio models have allowed for the treatment of solvation and electrolyte charge in a computationally efficient way. However, challenges remain in its application. Recent literature has reported that large cell heights are required to reach convergence, which presents a serious computational cost. Furthermore, calculations of reaction energetics require costly iterations to tune the surface charge to the desired potential. In this work, we present a simple capacitor model of the interface that illuminates how to circumvent both of these challenges. We derive a correction to the energy for finite cell heights to obtain the large cell energies at no additional computational expense. We furthermore demonstrate that the reaction energetics determined at constant charge are easily mapped to those at constant potential, which eliminates the need to apply iterative schemes to tune the system to a constant potential. Lastly, these developments together represent more than an order of magnitude reduction of the computational overhead required for the application of polarizable continuum models to surface electrochemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Novel In Situ Flamelet Tabulation Methodology for the Representative Interactive Flamelet Model

A priori flamelet tabulation methods have been used extensively to model premixed and non-premixed combustion in Reynolds Averaged Navier-Stokes (RANS) and Large Eddy Simulations (LES). Pre-tabulation of flamelet libraries have led to significant cost reduction of CFD simulations. However, these tabulation methods rely on certain simplifying assumptions. The dimensionality of the flamelet manifolds and size of flamelet libraries are also constrained due to memory and computational limitations. This limits the applicability and predictive capability of flamelet models. The traditional representative interactive flamelet (RIF) approach with multiple flamelets on the other hand involves online solution of flamelet equations and presumed PDF integration at each computational cell making it attractive but computationally expensive and not suitable for LES with large cell counts. The current work discusses the development of a novel methodology that combines the advantages of an online flamelet solver along with the computational efficacy of tabulated models. The novel in situ tabulation approach consists of creating a flamelet table at each computational time step using the unsteady flamelet equations. The flamelets are then integrated in real time based on their respective scalar dissipation rate histories. This approach is capable of including history effects and unsteady chemical kinetic effects as it involves the online solution of unsteady flamelets. Implementation and comprehensive validation of the new framework is carried out against gas jet flames as well as spray flames at high pressures. The approach is first validated for a partially premixed methane gas-jet flame in a RANS framework. The temperature and species mass fractions are compared against experimental results at different locations of a lifted flame. The approach is able to capture the transient flame characteristics. The model is then validated against an n -dodecane spray flame at high pressures in a LES framework with a 103 species n -dodecane chemistry mechanism. The model is able to capture ignition delays and flame liftoff of the n -dodecane spray over varying ambient temperature conditions. Due to the offsetting of presumed PDF integration cost, the proposed framework is shown to be faster than the traditional RIF approach and the speedup over RIF increases with an increase in the cell count. Furthermore, this framework enables use of the RIF model for large cell count LES simulations.

42 ENGINEERING↗

Cosmological angular trispectra and non-Gaussian covariance

Angular cosmological correlators are infamously difficult to compute due to the highly oscillatory nature of the projection integrals. Motivated by recent development on analytic approaches to cosmological perturbation theory, in this paper we present an efficient method for computing cosmological four-point correlations in angular space, generalizing previous works on lower-point functions. This builds on the FFTLog algorithm that approximates the matter power spectrum as a sum over power-law functions, which makes certain momentum integrals analytically solvable. The computational complexity is drastically reduced for correlators in a "separable" form—we define a suitable notion of separability for cosmological trispectra, and derive formulas for angular correlators of different separability classes. As an application of our formalism, we compute the angular galaxy trispectrum at tree level, with and without primordial non-Gaussianity. This includes effects of redshift space distortion and bias parameters up to cubic order. We also compute the non-Gaussian covariance of the angular matter power spectrum due to the connected four-point function, beyond the Limber approximation. Finally, we demonstrate that, in contrast to the standard lore, the Limber approximation can fail for the non-Gaussian covariance computation even for large multipoles.

79 ASTRONOMY AND ASTROPHYSICS↗

SU-D-206-01: Employing a Novel Consensus Optimization Strategy to Achieve Iterative Cone Beam CT Reconstruction On a Multi-GPU Platform

Purpose: While compressed sensing-based cone-beam CT (CBCT) iterative reconstruction techniques have demonstrated tremendous capability of reconstructing high-quality images from undersampled noisy data, its long computation time still hinders wide application in routine clinic. The purpose of this study is to develop a reconstruction framework that employs modern consensus optimization techniques to achieve CBCT reconstruction on a multi-GPU platform for improved computational efficiency. Methods: Total projection data were evenly distributed to multiple GPUs. Each GPU performed reconstruction using its own projection data with a conventional total variation regularization approach to ensure image quality. In addition, the solutions from GPUs were subject to a consistency constraint that they should be identical. We solved the optimization problem with all the constraints considered rigorously using an alternating direction method of multipliers (ADMM) algorithm. The reconstruction framework was implemented using OpenCL on a platform with two Nvidia GTX590 GPU cards, each with two GPUs. We studied the performance of our method and demonstrated its advantages through a simulation case with a NCAT phantom and an experimental case with a Catphan phantom. Result: Compared with the CBCT images reconstructed using conventional FDK method with full projection datasets, our proposed method achieved comparable image quality with about one third projection numbers. The computation time on the multi-GPU platform was ∼55 s and ∼ 35 s in the two cases respectively, achieving a speedup factor of ∼ 3.0 compared with single GPU reconstruction. Conclusion: We have developed a consensus ADMM-based CBCT reconstruction method which enabled performing reconstruction on a multi-GPU platform. The achieved efficiency made this method clinically attractive.

60 APPLIED LIFE SCIENCES↗

InteGO2: A web tool for measuring and visualizing gene semantic similarities using Gene Ontology

Here, the Gene Ontology (GO) has been used in high-throughput omics research as a major bioinformatics resource. The hierarchical structure of GO provides users a convenient platform for biological information abstraction and hypothesis testing. Computational methods have been developed to identify functionally similar genes. However, none of the existing measurements take into account all the rich information in GO. Similarly, using these existing methods, web-based applications have been constructed to compute gene functional similarities, and to provide pure text-based outputs. Without a graphical visualization interface, it is difficult for result interpretation. As a result, we present InteGO2 , a web tool that allows researchers to calculate the GO-based gene semantic similarities using seven widely used GO-based similarity measurements. Also, we provide an integrative measurement that synergistically integrates all the individual measurements to improve the overall performance. Using HTML5 and cytoscape.js, we provide a graphical interface in InteGO2 to visualize the resulting gene functional association networks. In conclusion, InteGO2 is an easy-to-use HTML5 based web tool. With it, researchers can measure gene or gene product functional similarity conveniently, and visualize the network of functional interactions in a graphical interface.

59 BASIC BIOLOGICAL SCIENCES↗

GeoT User’s Guide, A Computer Program for Multicomponent Geothermometry and Geochemical Speciation, Version 2.1

GeoT implements the multicomponent geothermometry method developed by Reed and Spycher (1984, Geochim. Cosmichim. Acta 46 513–528) into a stand-alone computer program, to ease the application of this method and to improve the prediction of geothermal reservoir temperatures using full and integrated chemical analyses of geothermal fluids. Reservoir temperatures are estimated from statistical analyses of mineral saturation indices computed as a function of temperature. The reconstruction of the deep geothermal fluid compositions, and geothermometry computations, are all implemented into the same computer program, allowing unknown or poorly constrained input parameters to be estimated by numerical optimization using existing parameter estimation software, such as iTOUGH2, PEST, or UCODE. This integrated geothermometry approach presents advantages over classical geothermometers for fluids that have not fully equilibrated with reservoir minerals and/or that have been subject to processes such as dilution and gas loss.

58 GEOSCIENCES↗

iGeoT v1.0: Automatic Parameter Estimation for Multicomponent Geothermometry, User's Guide

GeoT implements the multicomponent geothermometry method developed by Reed and Spycher [1984] into a stand-alone computer program to ease the application of this method and to improve the prediction of geothermal reservoir temperatures using full and integrated chemical analyses of geothermal fluids. Reservoir temperatures are estimated from statistical analyses of mineral saturation indices computed as a function of temperature. The reconstruction of the deep geothermal fluid compositions, and geothermometry computations, are all implemented into the same computer program, allowing unknown or poorly constrained input parameters to be estimated by numerical optimization. This integrated geothermometry approach presents advantages over classical geothermometers for fluids that have not fully equilibrated with reservoir minerals and/or that have been subject to processes such as dilution and gas loss. This manual contains installation instructions for iGeoT, and briefly describes the input formats needed to run iGeoT in Automatic or Expert Mode. An example is also provided to demonstrate the use of iGeoT.

58 GEOSCIENCES↗

Proceedings of the 1998 International Computational Accelerator Physics Conference

The 1998 International Computational Accelerator Physics Conference, ICAP’98, was held September 14-18, 1998, at the Monterey Convention Center in Monterey, California. The meeting continued the tradition of four earlier Computational Accelerator Physics conferences, held in La Jolla, California (1988), Los Alamos, New Mexico (1990), Pleasanton, California (1993), and Williamsburg, Virginia (1996). ICAP’98 was organized by the Stanford Linear Accelerator Center (SLAC), Los Alamos National Laboratory (LANL), and the National Energy Research Scientific Computing Center (NERSC), and received support from the U.S. Department of Energy. The aim of this conference series is to discuss recent advances in Computational Accelerator Physics and their applications to solving important problems related to present and future accelerators. The ICAP’98 program included plenary sessions on modeling challenges in next-generation accelerators, state-of-the art methods in computational accelerator physics, and a view of what high-end computing would be like in the 21st century. There were also focused sessions on accelerator design and control, modeling high intensity beam phenomena, electromagnetic modeling, advanced algorithms, software environments and libraries, visualization and graphic interfaces, modeling advanced accelerator concepts, modeling the beam-beam interaction, computing wakefields, and combined particle/field simulations. In addition to these oral sessions there was a poster session and a vendor display. Prior to the start of the technical program, a half-day tutorial on High Performance Computing was hosted by NERSC. The ICAP series recognizes that computing and, in particular, advanced computing, is playing an increasingly important role in the successful design and development of major accelerator facilities, and in research and development leading to advances in accelerator technology. We expect that this new emphasis on high-end computing will continue in future ICAP conferences.

Ko, Kwok↗

Hardware Evaluation: Abstract Machine Models and Proxy Architectures for Exascale Computing

The strategic and economic impacts of high performance computing (HPC) systems, over the last several decades, have enabled dramatic improvements in manufacturing, design, development, and research, across almost every sector of the U.S. economy, including genetic analysis for agriculture and medicine, oil exploration, electronics, aircraft, and automotive design, and of course national defense technologies. HPC has repeatedly compounded reductions in time-to-solution and time-to-market in each of these areas. In recognition of these strategic and economic impacts, the Department of Energy (DOE) created the Exascale Computing Project (ECP) as a broad-based technology project focusing on simultaneously co-evolving high-performance computing architecture, system software, and application software. While many details of the exascale architectures are undefined, communicating the form and direction of this co-evolution of advances, in each of these three components, across the project, presents a need for a common language through which these advances can be shared. In this document we present a series of abstract representations designed to allow application developers to focus on the aspects of the machine that are important or relevant to performance and code structure. These abstract machine models (AMMs) describe the proposed architectures at the component and system level and are intended as communication aids between application developers and hardware architects during the co-design process. In addition to providing a common language for communication, the constraints of protecting the intellectual property of ECP’s vendor partners requires that the architectural advances be presented in an abstract sense, rather than exposing the specifics of an individual vendor’s designs, while still providing enough detail such that application developers will be able to reason about the performance trade-offs in the design space of their applications.

97 MATHEMATICS AND COMPUTING↗