Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scientific Computing.”

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 811 records · Page 45

Electronic structure simulations in the cloud computing environment

The transformative impact of modern computational paradigms and technologies, such as high-performance computing, quantum computing, and cloud computing, has opened up profound new opportunities for scientific simulations. Scalable computational chemistry is one beneficiary of this technological progress. The main focus of this paper is on the performance of various quantum chemical formulations, ranging from low-order methods to high-accuracy approaches, implemented in different computational chemistry packages, such as NWChem, NWChemEx, SPEC, ExaChem, and FLOSIC codes on the Azure Quantum Element (AQE) Microsoft cloud services. We pay particular attention to the intricate workflows for performing composite chemistry simulations, associated data curation, and mechanisms for accuracy assessment, as defined by the enabling cloud Computational Chemistry as a Service (CCaaS). Our focus also extends to Arrows' automated workflow for high throughput simulations. Finally, we provide a perspective on the role of cloud computing in supporting the mission of leadership computational facilities (LCFs).

computational chemistry, electronic structure, Clo↗

Representation of Serendipitous Scientific Data

A computer program defines and implements an innovative kind of data structure than can be used for representing information derived from serendipitous discoveries made via collection of scientific data on long exploratory spacecraft missions. Data structures capable of collecting any kind of data can easily be implemented in advance, but the task of designing a fixed and efficient data structure suitable for processing raw data into useful information and taking advantage of serendipitous scientific discovery is becoming increasingly difficult as missions go deeper into space. The present software eases the task by enabling definition of arbitrarily complex data structures that can adapt at run time as raw data are transformed into other types of information. This software runs on a variety of computers, and can be distributed in either source code or binary code form. It must be run in conjunction with any one of a number of Lisp compilers that are available commercially or as shareware. It has no specific memory requirements and depends upon the other software with which it is used. This program is implemented as a library that is called by, and becomes folded into, the other software with which it is used.

James, Mark↗

The NASA Carbon Monitoring System Phase 2 synthesis: scope, findings, gaps and recommended next steps

Abstract Underlying policy efforts to address global climate change is the scientific need to develop the methods to accurately measure and model carbon stocks and fluxes across the wide range of spatial and temporal scales in the Earth system. Initiated in 2010, the NASA Carbon Monitoring System is one of the most ambitious relevant science initiatives to date, exploiting the satellite remote sensing resources, computational capabilities, scientific knowledge, airborne science capabilities, and end-to-end system expertise that are major strengths of the NASA Earth Science program. Here we provide a synthesis of ‘Phase 2’ activities (2011–2019), encompassing 79 projects, 482 publications, and 136 data products. Our synthesis addresses four key questions: What has been attempted? What major results have been obtained? What major gaps and uncertainties remain? and What are the recommended next steps? Through this review, we take stock of what has been accomplished and identify future priorities toward meeting the nation’s needs for carbon monitoring reporting and verification.

54 ENVIRONMENTAL SCIENCES↗

First-passage time statistics on surfaces of general shape: Surface PDE solvers using Generalized Moving Least Squares (GMLS)

Here, we develop numerical methods for computing statistics of stochastic processes on surfaces of general shape with drift-diffusion dynamics d X t = a (X t ) dt + b(X t ) d W t . We formulate descriptions of Brownian motion and general drift-diffusion processes on surfaces. We consider statistics of the form u (x) = E x [$∫^{τ}_{0}$ g (X t ) dt ] + E x [ f (X τ )] for a domain Ω and the exit stopping time τ = inf t { t >0 | X i Ω}, where f , g are general smooth functions. For computing these statistics, we develop high-order Generalized Moving Least Squares (GMLS) solvers for associated surface PDE boundary-value problems based on Backward- Kolmogorov equations. We focus particularly on the mean First Passage Times (FPTs) given by the case f = 0, g = 1 where u (x) = E x [τ]. We perform studies for a variety of shapes showing our methods converge with high-order accuracy both in capturing the geometry and the surface PDE solutions. We then perform studies showing how statistics are influenced by the surface geometry, drift dynamics, and spatially dependent diffusivities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Data Management, Analysis, and Visualization (SDAV) Institute

Analytics-driven data layout optimizations and compression (NCSU): We have developed solutions that address challenges related to scientific data indexing, compression, and storage layout problems. Moreover, in addition to focusing on mainstream uniform mesh data, we have also addressed Adaptive Mesh Refinement (AMR) data.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Studying CPU and memory utilization of applications on Fujitsu A64FX and Nvidia Grace Superchip

ARM-based manycore CPU architectures are well-positioned to provide the rising memory throughput requirements of modern data intensive scientific applications in High Performance Computing (HPC). The Fujitsu A64FX CPU platform is based on the ARM v8.2A architecture, and is the processor of the flagship Japanese supercomputer - "Fugaku", which was previously ranked as the #1 supercomputer in the world according to the Top500 list. The Nvidia Grace superchip features 144 Neoverse V2 cores based on the ARMv9 architecture with 4x128b SVE2, providing exceptional computational power. The chip supports up to 480GB of memory, making it ideal for AI, machine learning, and scientific computing workloads. In this paper, we conduct a thorough performance exploration of a variety of parallel bandwidth-sensitive benchmarks and applications compiled with the native Fujitsu compiler on a Fugaku A64FX compute node and ARM (LLVM) Compiler on an NVIDIA Grace superchip compute node, engaging all the computational cores per cluster using OpenMP multithreading (assuming the cores can drive the available bandwidth). Our ultimate goals are to study the resource utilization of scientific applications and benchmarks on A64FX and Grace superchip, considering graph application scenarios ( GAP Benchmark suite) and eleven appli- cation proxies from the Rodinia heterogeneous benchmark suite (considering domains such as Data Mining, Bioinformatics, Fluid Dynamics, Pattern Recognition, etc.). Through exhaustive performance monitoring, we quantify the resource utilization of diverse OpenMP-based HPC applications on both the Fujitsu A64FX and the Nvidia Grace Superchip platforms.

benchmarking, Performance Analysis, High performan↗

A Theoretical Study on Reaction Mechanisms and Kinetics of Thiophene Hydrodesulfurization over MoS 2 Catalysts

In the present work, thiophene hydrodesulphurization (HDS) over the Mo-edge, the S-edge, and the Mo-S connection edge of MoS 2 catalyst with 50% sulfur coverage was studied using first-principles based microkinetic modeling. Two parallel HDS routes, i.e., direct desulfurization (DDS) and hydrogenation (HYD) were taken into account. It has been found that the major reaction route of thiophene HDS on the Mo- and the Mo-S edges is temperature dependent. In the low temperature range of 500~600 K, the HYD route is dominant, leading to the C 4 H 8 formation. As the temperature increases, the DDS route becomes competitive with the HYD route. At the temperature above 650 K, the DDS route will be the dominant HDS reaction route on the Mo- and the Mo-S edges. While the DDS route that leads to the formation of C4H6 is the major thiophene HDS reaction route on the S-edge in the entire temperature range of 500~750 K. The microkinetic modeling results show the overall HDS activity on the S-edge is lower than it on the Mo- and the Mo-S edges. The Mo-S edge also provides a preferential reaction pathway, which facilitates 2-hydrothiophene migration from the Mo-edge to the S-edge, followed by remaining elementary steps with lower activation barriers in the DDS route. The work was financially supported by the National Natural Science Foundation of China (No. 21476012, 21571012, 21407007 and 91534201). The computing time was granted by a scientific theme user proposal in the William R. Wiley Environmental Molecular Sciences Laboratory (EMSL), which is a U.S. Department of Energy national scientific user facility located at Pacific Northwest National Laboratory (PNNL) in Richland, Washington. Part of computing time was provided the National Energy Research Scientific Computing Center (NERSC). D. Mei is supported by the US Department of Energy, Office of Sciences, Office of Basic Energy Sciences, Division of Chemical Sciences, Geosciences & Biosciences.

Thiophene, hydrodesulphurization, MoS2, DFT, micro↗

Undergraduate Women in STEM Internship Program

In collaboration with the Universities Research Association, Inc. (URA), establishment of the Undergraduate Women in STEM Internship pilot program assists Fermi Research Alliance, LLC (FRA) with honoring its commitment to increasing gender, racial and ethnic workforce diversity. This focused initiative is intended to invite, support and yield a qualified pipeline of alumnae underrepresented in FRA’s science and technology management and technical staff positions. Interns in this program spend 10-12 weeks at Fermilab working under the direct leadership, guidance and supervision of scientists, engineers, computing professionals, technicians and staff across all directorates performing hands-on research. In addition, the intern cohort meets with mentors and advisors to grow their professional networks, to take part in engaging and inclusive intellectual discussions, to directly benefit from workplace resources, and to participate in professional development and social engagement opportunities. The design of each research project and the supervision, mentorship and evaluation is conducted by a scientific, engineering, computing professional at Fermilab.

99 GENERAL AND MISCELLANEOUS↗

Solving key challenges in collider physics with foundation models

Foundation models are neural networks that are capable of simultaneously solving many problems. Large language foundation models like ChatGPT have revolutionized many aspects of daily life, but their impact for science is not yet clear. In this paper, we use a new foundation model for hadronic jets to solve three key challenges in collider physics. In particular, we show how experiments can (1) save significant computing power when developing reconstruction algorithms, (2) perform a complete uncertainty quantification for high-dimensional measurements, and (3) search for new physics with model agnostic methods using low-level inputs. In each case, there are significant computational or methodological challenges with current methods that limit the science potential of deep learning algorithms. By solving each problem, we take jet foundation models beyond proof-of-principle studies and into the toolkit of practitioners.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data

Since today’s scientific applications are producing vast amounts of data, compressing them before storage/transmission is critical. Results of existing compressors show two types of HPC data sets: highly compressible and hard to compress. In this work, we carefully design and optimize the error-bounded lossy compression for hard-tocompress scientific data. We propose an optimized algorithm that can adaptively partition the HPC data into best-fit consecutive segments each having mutually close data values, such that the compression condition can be optimized. Another significant contribution is the optimization of shifting offset such that the XOR-leading-zero length between two consecutive unpredictable data points can be maximized. We finally devise an adaptive method to select the best-fit compressor at runtime for maximizing the compression factor. We evaluate our solution using 13 benchmarks based on real-world scientific problems, and we compare it with 9 other state-of-the-art compressors. Experiments show that our compressor can always guarantee the compression errors within the user-specified error bounds. Most importantly, our optimization can improve the compression factor effectively, by up to 49% for hard-tocompress data sets with similar compression/decompression time cost.

97 MATHEMATICS AND COMPUTING↗

Experimental and modeling study of the autoignition behavior of a standard oxygenated gasoline fuel

Gasoline surrogate models can be conveniently used to simulate the combustion behavior of fuels in internal combustion engines. Because of limitations in the number of robust models available and the high computational cost of running them, simple surrogates with only 2 or 3 components (namely n-heptane, iso-octane and toluene) have been long preferred to simulate the ignition behavior of gasoline in engine calculations. More recently, thanks to the development of new, well-validated kinetic models and the access to cheap high-performance computing, the scientific and engineering community is utilizing the higher fidelity provided by more complex mixture models. The added detail in composition can in fact better reproduce variation in the fuel reactivity with pressure (an important feature for downsized, boosted conditions) and blending behavior of real fuels. In this study, the ignition behavior of a research grade full blend oxygenated fuel matching the typical specification of US standard grade gasoline has been investigated by means of rapid compression experiments and detailed kinetic calculations. A multicomponent fuel surrogate model has been developed using compositional information and a surrogate optimization tool. Based on the experimental and computational results presented in this study, general considerations about guidelines in the formulation of gasoline fuel surrogates are provided.

autoignition↗

ML–Enabled FPGA Framework for Fast Quantum State Discrimination in Mid-Circuit Measurement Regimes

Accurate and low-latency quantum state discrimination is essential for protocols involving mid-circuit measurement (MCM) and conditional feed-forward. In superconducting quantum systems, conventional readout pipelines transfer measurement data to host processors for post-processing, introducing millisecond-scale delays that far exceed qubit coherence times. To overcome this bottleneck, we present an in-situ machine learning (ML) inference engine implemented on an FPGA for real-time quantum state discrimination. Our design performs inference directly on digitized readout signals with 40 ns latency, supports both qubit and qutrit readout, and enables conditional operations without host-side intervention. This capability is critical for MCM and for feedback-driven protocols such as quantum error correction. We validate the system on superconducting transmon hardware, demonstrating robust discrimination fidelity across multiple qubit and qutrit channels. We further demonstrate conditional qutrit logic driven by FPGA-resident classification, highlighting the potential of low-latency ML-on-FPGA control for NISQ applications and scalable fault-tolerant quantum computing.

Vora, Neel [Lawrence Berkeley National Laboratory ↗

Thermal Neutron Scattering Evaluation Methods Development at ORNL [Slides]

The goal of the project was to develop a procedure to generate covariance matrix for S( α,β ) data that incorporated both computational simulations and experimental data. Experimental data and computer simulation fit is achieved using the Unified Monte Carlo (UMC) method. The framework is material & simulation method independent, and this is demonstrated using light water. A methodology was developed for generalized generation of covariances for thermal scattering files. The framework was subsequently tested on light water by generating covariance of pDOS with encouraging results. Preliminary results suggest temperature effects of polyethylene may warrant further investigation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ExaWind: Predictive Wind Energy Simulations

This presentation describes the ExaWind project and the team's progress in creating a suite of performance-portable codes designed for predictive simulations of wind farms on next-generation exascale-class supercomputers. Such simulations will require the resolution of scales spanning many orders of magnitude, from blade boundary layers to wind farm flow structures. In the U.S., the first exascale systems will be GPU accelerated, and different GPU manufacturers have been chosen for the different systems. At the heart of the ExaWind software is a hybrid-solver approach based on the codes Nalu-Wind and AMR-Wind, which are computational fluid dynamics solvers for the incompressible Navier-Stokes equations. Nalu-Wind is an unstructured-grid code used to resolve wind turbine geometry and blade boundary layers, whereas AMR-Wind is a structured-grid background solver for atmospheric turbulent flow and turbine wake propagation. The models are coupled with overset meshes and global linear systems are approximated through a loose-coupling algorithm. Results will include validation-quality high-fidelity simulations and strong/weak scaling results from the Summit supercomputer.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

High-Performance Key-Value Store on OpenSHMEM

Recently, there has been a growing interest in enabling fast data analytics by leveraging system capabilities from large-scale high-performance computing (HPC) systems. OpenSHMEM is a popular run-time system on HPC systems that has been used for large-scale compute-intensive scientific applications. In this paper, we propose to leverage OpenSHMEM to design a distributed in-memory key-value store for fast data analytics. Accordingly, we have developed SHMEMCache on top of OpenSHMEM to leverage its symmetric global memory, efficient one-sided communication operations and general portability. We have also evaluated SHMEMCache through extensive experimental studies. Our results show that SHMEMCache has accomplished significant performance improvements over hte original Memcached in terms of latency and throughput. Our evaluation on the Titan supercomputer has also demonstrated that SHMEMCache can scale to 1024 nodes.

97 MATHEMATICS AND COMPUTING↗

Unsupervised discovery of extreme weather events using universal representations of emergent organization

Spontaneous self-organization is ubiquitous in systems far from thermodynamic equilibrium. While organized structures that emerge dominate transport properties, universal representations that identify and describe these key objects remain elusive. Here, we introduce a theoretically grounded framework for describing emergent organization that, via data-driven algorithms, is constructive in practice. Its building blocks are spacetime lightcones that embody how information propagates across a system through local interactions. We show that predictive equivalence classes of lightcones—local causal states—capture organized behaviors in complex spatiotemporal systems. Employing an unsupervised physics-informed machine learning algorithm and a high-performance computing implementation, we demonstrate automatically discovering organized structures in two real-world domain science problems. We show that local causal states identify vortices and track their power-law decay behavior in two-dimensional fluid turbulence. We then show how to detect and track familiar extreme weather events—hurricanes and atmospheric rivers—and discover other novel structures associated with precipitation extremes in high-resolution climate data at the grid-cell level.

Rupe, Adam [Pacific Northwest National Laboratory ↗

Fundamental limit of jet tagging

Identifying the origin of high-energy hadronic jets (jet tagging) has been a critical benchmark problem for machine learning in particle physics. Jets are ubiquitous at colliders and are complex objects that serve as prototypical examples of collections of particles to be categorized. Over the last decade, machine learning-based classifiers have replaced classical observables as the state of the art in jet tagging. Increasingly complex machine learning models are leading to increasingly more effective tagger performance. Our goal is to address the question of convergence—are we getting close to the fundamental limit on jet tagging or is there still potential for computational, statistical, and physical insights for further improvements? We address this question using state-of-the-art generative models to create a realistic, synthetic dataset with a known jet tagging optimum. Various state-of-the-art taggers are deployed on this dataset, showing that there is a significant gap between their performance and the optimum. Our dataset and software are made public to provide a benchmark task for future developments in jet tagging and other areas of particle physics.

Artificial intelligence↗