Search NASA⌕ Search

SEARCH · Search NASA

Results for “performance benchmarking”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

HipBone: A performance-portable graphics processing unit-accelerated C++ version of the NekBone benchmark

We present hipBone, an open-source performance-portable proxy application for the Nek5000 (and NekRS) computational fluid dynamics applications. HipBone is a fully GPU-accelerated C++ implementation of the original NekBone CPU proxy application with several novel algorithmic and implementation improvements which optimize its performance on modern fine-grain parallel GPU accelerators. Our optimizations include a conversion to store the degrees of freedom of the problem in assembled form in order to reduce the amount of data moved during the main iteration and a portable implementation of the main Poisson operator kernel. We demonstrate near-roofline performance of the operator kernel on three different modern GPU accelerators from two different vendors. We present a novel algorithm for splitting the application of the Poisson operator on GPUs which aggressively hides MPI communication required for both halo exchange and assembly. Our implementation of nearest-neighbor MPI communication then leverages several different routing algorithms and GPU-Direct RDMA capabilities, when available, which improves scalability of the benchmark. We demonstrate the performance of hipBone on three different clusters housed at Oak Ridge National Laboratory, namely, the Summit supercomputer and the Frontier early-access clusters, Spock and Crusher. Our tests demonstrate both portability across different clusters and very good scaling efficiency, especially on large problems.

Computer Science↗
DOE OSTI2021

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Leveraging observed soil heterotrophic respiration fluxes as a novel constraint on global-scale models

Microbially-explicit models may improve understanding and projections of carbon dynamics in response to future climate change, but their fidelity in simulating global-scale soil heterotrophic respiration (RH), a stringent test for soil biogeochemical models, has never been evaluated. We used statistical global RH products, as well as 7,821 daily site-scale RH measurements, to evaluate the spatio-temporal performance of one first-order decay model (CASA-CNP) and two microbially-explicit biogeochemical models (CORPSE and MIMICS) that were forced by two different climate datasets. CORPSE and MIMICS did not provide any measurable performance improvement; instead, the models were highly sensitive to the meteorological input data used to drive them. Spatial RH variability was generally well simulated except in the northern middle latitudes (~50°N) and arid regions; models captured the seasonal variability of RH well, but showed more divergence in tropic and arctic regions. Our results demonstrate that the next generation of biogeochemical models shows promise, but also needs to be improved for realistic spatio-temporal variability of RH. Finally, we emphasize the importance of net primary production, soil moisture, and soil temperature inputs, and that jointly evaluating soil models for their spatial (global scale) and temporal (site scale) performance provides crucial benchmarks for improving biogeochemical models.

Jian, Jinshi↗
DOE OSTI2021

Deep-Learning-Derived Evaluation Metrics Enable Effective Benchmarking of Computational Tools for Phosphopeptide Identification

Tandem mass spectrometry (MS/MS)-based phosphoproteomics is a powerful technology for global phosphorylation analysis. However, applying four computational pipelines to a typical mass spectrometry (MS)-based phosphoproteomic dataset from a human cancer study, we observed a large discrepancy among the reported phosphopeptide identification and phosphosite localization results, underscoring a critical need for benchmarking. While efforts have been made to compare performance of computational pipelines using data from synthetic phosphopeptides, evaluations involving real application data have been largely limited to comparing the numbers of phosphopeptide identifications due to the lack of appropriate evaluation metrics. We investigated three deep learning-derived features as potential evaluation metrics: phosphosite probability, Delta RT and spectral similarity. Predicted phosphosite probability is computed by MusiteDeep, which provides high accuracy as previously reported; Delta RT is defined as the absolute retention time (RT) difference between RTs observed and predicted by AutoRT; and spectral similarity is defined as the Pearson’s correlation coefficient between spectra observed and predicted by pDeep2. Using a synthetic peptide dataset, we found that both Delta RT and spectral similarity provided excellent discrimination between correct and incorrect peptide-spectrum matches (PSMs) both when incorrect PSMs involved wrong peptide sequences and even when incorrect PSMs were caused by only incorrect phosphosite localization. Based on these results, we used all the three deep learning-derived features as evaluation metrics to compare different computational pipelines on diverse set of phosphoproteomic datasets and showed their utility in benchmarking performance of the pipelines. The benchmark metrics demonstrated in this study will enable users to select computational pipelines and parameters for routine analysis of phosphoproteomics data and will offer guidance for developers to improve computational methods.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Expanding Benchmarks for Nuclear Data Validation [Slides]

The presentation discusses benchmarking in comparison to experimental truth, the integral experiments that were performed, and that benchmarks are evaluated experiments. It also discusses validation testing, and that the ultimate goal of the validation end product is to improve evaluated nuclear data for applications It does state that validation highlights errors in the Nuclear Data Pipeline that affect applications, for example: Missing Cd Capture Gammas in ENDF/B-VII.1. It acknowledges that additional types of experiments are needed to test data used in applications, and that validation experiments do not have to be complicated and expensive. The presentation also discusses different types of measurements including activation foil and fission chamber measurements, reactor kinetics measurements, and subcritical measurements. The presentation concludes with an experiment summary and states that all applications need validation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Quantum simulations of excited states with active-space downfolded Hamiltonians

Many-body techniques based on the double unitary coupled cluster ansatz (DUCC) can be used to downfold electronic Hamiltonians into low-dimensional active spaces. It can be shown that the resulting dimensionality reduced Hamiltonians are amenable for quantum computing. Recent studies performed for several benchmark systems using quantum phase estimation (QPE) algorithms demonstrated that these formulations can recover a significant portion of ground-state dynamical correlation effects that stem from the electron excitations outside of the active space. These results have also been confirmed in studies of ground-state potential energy surfaces using quantum simulators. In this letter, we study the effectiveness of the DUCC formalism in describing excited states. We also emphasize the role of the QPE formalism and its stochastic nature in discovering/identifying excited states or excited-state processes in situations when the knowledge about the true configurational structure of a sought after excited state is limited or postulated (due to the specific physics driving excited-state processes of interest). In this context, we can view the QPE algorithm as an engine for verifying various hypotheses for excited-state processes and providing statistically meaningful results that correspond to the electronic state(s) with the largest overlap with a postulated configurational structure. We illustrate these ideas on examples of strongly cor- related molecular systems, characterized by small energy gaps and high density of quasi-degenerate states around the Fermi level.

quantum chemistry, quantum computing, computationa↗
DOE OSTI2022

Benchmarking a Proof-of-Concept Performance Portable SYCL-based Fast Fourier Transformation Library

ABSTRACT In this paper, we present an early version of a SYCL-based FFT library, capable of running on all major vendor hardware, including CPUs and GPUs from AMD, ARM, Intel and NVIDIA. The current limitations of our library is it supports single-dimension FFTs up to 211 in length and base-2 input sequences. Although preliminary, the aim of this work is to seed further developments for a rich set of features for calculating FFTs. The library has the advantage over existing portable FFT libraries in that it is single-source, and there- fore removes the complexities that arise due to abundant use of pre-processor macros and auto-generated kernels to target different architectures. We exercise two SYCL-enabled compilers, Codeplay ComputeCpp and Intel's open-source LLVM project, to evaluate performance portability of our SYCL-based FFT on various hetero- geneous architectures.We provide studies comparing our portable library with highly optimized vendor-specific FFT libraries, and discuss potential sources hindering performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

LLM Benchmarking with LLaMA2: Evaluating Code Development Performance Across Multiple Programming Languages

The rapid evolution of large language models (LLMs) has opened new possibilities for automating various tasks in software development. This paper evaluates the capabilities of the LLaMA 2-70B model in automating these tasks for scientific applications written in commonly used programming languages. Using representative test problems, we assess the model's capacity to generate code, documentation, and unit tests, as well as its ability to translate existing code between commonly used programming languages. Our comprehensive analysis evaluates the compilation, runtime behavior, and correctness of the generated and translated code. Additionally, we assess the quality of automatically generated code, documentation, and unit tests. Here, our results indicate that while LLaMA 2-70B frequently generates syntactically correct and functional code for simpler numerical tasks, it encounters substantial difficulties with more complex, parallelized, or distributed computations, requiring considerable manual corrections. We identify key limitations and suggest areas for future improvements to better leverage AI-driven automation in scientific computing workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The ENDF/B Nuclear Data Library and Its Impact on Reactor Simulations

The ENDF/B library, which is developed, maintained, and distributed by the Cross Section Evaluation Working Group, is the main source of nuclear data for analyses and computational simulations in nuclear applications, like different nuclear reactors concepts, radiation shielding, medical applications, astrophysics, etc. The library is constantly being improved and updated, with each release bringing an optimal representation of nuclear interactions as they are understood in their time. The most recent release, ENDF/B-VIII.1, represents a significant improvement in terms of the performance and consistency of the measured differential data relative to previous versions, as it combines the most recent experimental differential data and advanced theoretical nuclear models. As one of the many highlights, ENDF/B-VIII.1 restores a high-burnup depletion performance, comparable to ENDF/B-VII.1, that had been degraded in ENDF/B-VIII.0, while further improving the performance in criticality benchmarks, such as those in the Mosteller’s suite. Additionally noteworthy is the improved performance of ENDF/B-VIII.1 in radiation shielding and thick-target leakage spectrum integral experiments, which are also important for fusion and reactor applications. In this work we present in a very summarized way the main updates implemented in the ENDF/B-VIII.1 release and its main impacts, and also begin to delineate the path forward as to what to expect in the future for the next ENDF/B release, which, based on the timeline of the past few releases, is estimated to happen around 5 years from now. We emphasize that the ENDF/B-VIII.1 release was the product of an enormous collaborative effort among many authors and that for a complete detailed picture, the reader is strongly encouraged to refer to the article accompanying the release, which is currently in the publication process, but available as preprint [G. P. A. Nobre et al. arXiv Preprint arXiv: 2511.03564 (2025)].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Benchmark Calculation for the Hatch Unit 1 Cycles 1-3 Using the SCALE 6.3/Polaris–PARCS v3.4.2 Code Package

This study was the performance of the benchmark calculation for the Hatch Unit 1 cycles 1–3, to validate the SCALE 6.3/Polaris–PARCS v3.4.2 with the ENDF/B-VII.1 AMPX 56-group library by comparing the simulated results with the measured data. The benchmark results will be used in evaluating uncertainties of the SCALE/Polaris–PARCS code package for boiling water reactor (BWR) physics analysis for key nuclear parameters such as reactivity and assembly power peaking factors. This report details plant and fuel design specifications and input data for SCALE/Polaris, GenPMAXS and PARCS, and additionally, detailed information is provided for all the input and output files produced for the benchmark calculations. The benchmark results were summarized such that they can be used in evaluating uncertainties for key nuclear parameters with other BWR benchmark results.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2023

Benchmark of Neutron Thermalization in Graphite Using a Pulsed Slowing-Down-Time Experiment

A benchmark has been developed using a pulsed slowing-down-time experiment to isolate the thermalization process in graphite. The experiment was conducted at the Oak Ridge Electron Linear Accelerator facility at Oak Ridge National Laboratory, and it measured the time spectrum of neutrons leaking from a graphite pile during slowing down and thermalization within graphite. Simulations of the benchmark experiment were performed using the MCNP6.1 Monte Carlo code and the ENDF/B-VII.1 and ENDF/B-VIII.0 cross-section databases. The benchmark provides a time spectrum (i.e., time-dependent counts in a detector) that allows for validation of the graphite thermal scattering libraries (TSLs). The impact on the simulations using a suite of graphite TSLs was compared with the experimental results. Given the density of nuclear graphite, the TSL corresponding to graphite with 30% porosity, as implemented in ENDF/B-VIII.0, was found to most accurately represent the measured time spectrum corresponding to the thermal energy range with an average deviation of ±1.7%.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Carbon Emissions in a Typical New Production Home: A Case Study

This report is intended to serve as a foundational document for residential construction executives and leadership teams to understand how a typical home currently performs relative to building decarbonization goals set for 2030 and 2050. The intent is to help homebuilders benchmark their current performance and better understand the largest sources of carbon emissions in their homes. There is a need to understand and assess current performance against net zero carbon goals to define achievable paths forward. This case study highlights opportunities for innovation and carbon reduction through advanced technologies and material choices.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Carbon Emissions in a Typical New Production Home: A Case Study

This report, prepared by IBACOS, is intended to serve as a foundational document for the residential construction industry to understand how a typical home currently performs relative to building decarbonization goals set for 2030 and 2050. The intent is to help homebuilders benchmark their current performance and better understand the largest sources of carbon emissions in their homes.

Carbon Emissions↗
DOE OSTI2023

Bramblett and Czirr Self-Shielded Fission Rates for 235 U Physical and Analytic Benchmark

These experiments were performed by Bramblett and Czirr at UCRL (i.e., LLNL) in the late 1960s through the 1970s and evaluated by Mark Lee (LFO, retired) for the ICSBEP Handbook. Dimensions, geometry, and benchmark RSFR values are taken from the Handbook. All sample calculational results used COG 11.3 with ENDF/B-VIII.0 cross-sections. A sample input listing is provided in Appendix A.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Uniformly Ordered Binary Decision Algorithm for Benchmark Experiment Correlations in Whisper Validation

When performing a validation exercise for determining the upper subcritical limit of a nuclear criticality safety application, an analyst should select and perform a statistical analysis on a population of benchmark experiments that are neutronically similar to the application. The size of this population should be sufficiently large such that the statistical analysis has a high degree of confidence that the bias plus bias uncertainty (calculational margin) has been accurately quantified. A complication arises because many benchmark experiments share common components, leading to correlations in their measured effective multiplication factors. Correlations between benchmark experiments within the population reduces its predictive power. This motivates the need for methods that consider benchmark experiment correlations and ensure adequate statistical significance of results. The Whisper code is a statistical analysis pack- age that incorporates nuclear data sensitivity coefficients from MCNP to assess benchmark experiment similarity and then performs an extreme-value analysis to estimate the bias plus bias uncertainty. The original methodology in Whisper does not consider the effect of benchmark experiment correlations when making this estimation, and this summary proposes the uniformly ordered binary decision algorithm to address this shortcoming. The original methodology in Whisper computes similarity coefficients ck for an application compared to all benchmark experiments in its library and develops weighting factors for a selected population proportional to the ck values. The methodology can be interpreted as statistically emulating a validation exercise for a particular application where the weighting factors may be viewed as the likelihood that an analyst would include a particular benchmark experiment within the population. The effective sample size of the population is the expected or mean number of benchmark experiments in the population. The uniformly ordered binary decision algorithm identifies clusters of correlated benchmark experiments within the population and then computes adjusted weighting factors based on the magnitude of the correlation coefficients within the cluster to compute a reduced effective sample size accounting for the lower information content because of correlations. Benchmark experiments within the cluster are ordered randomly with equal probability and probabilistic decisions are made as to whether a benchmark. experiment within the cluster should treated as redundant with a previous one; if two redundant benchmark experiments are included, then the conservative worst case bias plus bias uncertainty is used and the pair is counted as a single benchmark experiment in the population. Results are provided for HEU solutions in a research version of the Whisper software using benchmark experiment correlations provided by DICE, the Database for the International Criticality Safety Benchmark Evaluation Project (ICSBEP). These show that there can be a significant increase in the bias plus bias uncertainty because the effective sample size is reduced, and therefore the algorithm, needing to meet sample size requirements, expands the benchmark experiment population by accepting less similar benchmark experiments that would have otherwise not been included.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A volumetric framework for quantum computer benchmarks

We propose a very large family of benchmarks for probing the performance of quantum computers. We call them volumetric benchmarks (VBs) because they generalize IBM's benchmark for measuring quantum volume \cite{Cross18}. The quantum volume benchmark defines a family of square circuits whose depth d and width w are the same. A volumetric benchmark defines a family of rectangular quantum circuits, for which d and w are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes — ( w , d ) pairs — to test suites C ( w , d ) . A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a single circuit C , a specific list of circuits { C 1 … C N } that must all be run, or a large set of possible circuits equipped with a distribution P r ( C ) . The circuits in a given VB share a structure, which is limited only by designers' creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have ``passed'' a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the d vs w trade-off for the processor being benchmarked.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

ChemGraph as an agentic framework for computational chemistry workflows

Atomistic simulations are essential in chemistry and materials science but remain challenging to run due to the expert knowledge required for the setup, execution, and validation stages of these calculations. We present ChemGraph, an agentic framework powered by artificial intelligence and state-of-the-art simulation tools to streamline and automate computational chemistry and materials science workflows. ChemGraph leverages graph neural network-based foundation models for accurate yet computationally efficient calculations and large language models (LLMs) for natural language understanding, task planning, and scientific reasoning to provide an intuitive and interactive interface. We evaluate ChemGraph across 13 benchmark tasks and demonstrate that smaller LLMs (GPT-4o-mini, Claude-3.5-haiku, Qwen-2.5-14B) perform well on simple workflows, while more complex tasks benefit from using larger models. Importantly, we show that decomposing complex tasks into smaller subtasks through a multi-agent framework enables GPT-4o to reach perfect accuracy and smaller LLMs to match or exceed single-agent GPT-4o's performance in these benchmarks.

Computational chemistry↗