Search NASA⌕ Search

SEARCH · Search NASA

Results for “IBM”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Implementation and analysis of quantum computing application to Higgs boson reconstruction at the large Hadron Collider

With the advent of the High-Luminosity Large Hadron Collider (HL-LHC) era, high energy physics (HEP) event selection will require new approaches to rapidly and accurately analyze vast databases. The current study addresses the enormity of HEP databases in an unprecedented manner—a quantum search using Grover’s Algorithm (GA) on an unsorted database, ATLAS Open Data, from the ATLAS detector. A novel method to identify rare events at 13 TeV in CERN’s LHC using quantum computing (QC) is presented. As indicated by the Higgs boson decay channel H→ZZ*→4l , the detection of four leptons in one event may be used to reconstruct the Higgs boson and, more importantly, evince Higgs boson decay to some new phenomena, such as H→ZZ d →4l . Searching the dataset for collisions resulting in detection of four leptons using a Jupyter Notebook, a classical simulation of GA, and several quantum computers with multiple qubits, the current application was found to make the proper selection in the unsorted dataset. Quantum search efficacy was analyzed for the incoming HL-LHC by implementing the QC method on multiple classical simulators and IBM’s quantum computers with the IBM Qiskit Open Source Software. The current QC application provides a novel, high-efficiency alternative to classical database searches, demonstrating its potential utility as a rapid and increasingly accurate search method in HEP.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

The role of breakup and coalescence in fine-scale bubble-induced turbulence. II. Kinematics

This second part of our research explores the kinematic aspect of fine-scale bubble-induced turbulence (BIT) to (i) present the effect of bubble breakup and coalescence and (ii) compare it against the universal kinematic fine-scale turbulence characteristics reported in the literature. To this end, we simulate a dilute bubbly system of 0.5% void fraction using two distinct numerical simulations. In the volume-of-fluid (VoF) simulation, bubbles undergo breakup and coalescence. In the immersed boundary method (IBM) simulation, however, they act as rigid spheres. We also perform a simulation of classical homogeneous isotropic turbulence (HIT). The first important outcome of this study is that BIT is radically different from HIT in terms of its kinematic fine-scale characteristics. In the vorticity-dominating regions, BIT exhibits a weak vortex stretching. This weak vortex stretching is due to (a) the intermediate strain-rate eigenvalues skewed weakly to positive and (b) the extensive strain-rate eigenvector aligning perpendicular to the vorticity vector. The BIT has, on average, not only a weak enstrophy production but also a weak strain production in strain-dominating regions. The weak strain production is due to (a) the presence of vortex stretching in highly strained fluid elements and (b) the absolute magnitude of compressive strain-rate eigenvalue being as close to the extensive strain-rate eigenvalue. Thus, none of the kinematic fine-scale HIT characteristics is noted for BIT. The second important conclusion is that bubble breakup and coalescence play little to no influence on the kinematics of fine-scale BIT as VoF and IBM simulations produce similar results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Quantum dynamics simulation of the advection-diffusion equation

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 −5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

Alipanah, Hirad [Univ. of Pittsburgh, PA (United S↗
DOE OSTI2023

Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model

Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge

Here, tools necessary for quantum simulations of 1+1 dimensional quantum chromodynamics are developed. When formulated in axial gauge and with two flavors of quarks, this system requires 12 qubits per spatial site with the gauge fields included via nonlocal interactions. Classical computations and D-wave’s quantum annealer advantage are used to determine the hadronic spectrum, enabling a decomposition of the masses and a study of quark entanglement. Color “edge” states confined within a screening length of the end of the lattice are found. IBM’s seven-qubit quantum computers, ibmq_jakarta and ibm_perth, are used to compute dynamics from the trivial vacuum in one-flavor QCD with one spatial site. More generally, the Hamiltonian and quantum circuits for time evolution of 1+1 dimensional SU(N c ) gauge theory with Nf flavors of quarks are developed, and the resource requirements for large-scale quantum simulations are estimated.

1+1 dimensions↗
DOE OSTI2024

Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits

Hadron wave packets are prepared and time evolved in the Schwinger model using 112 qubits of IBM’s 133-qubit Heron quantum computer ibm_torino. The initialization of the hadron wave packet is performed in two steps. First, the vacuum is prepared across the whole lattice using the recently developed SC-ADAPT-VQE algorithm and workflow. SC-ADAPT-VQE is then extended to the preparation of localized states, and used to establish a hadron wave packet on top of the vacuum. This is done by adaptively constructing low-depth circuits that maximize the overlap with an adiabatically prepared hadron wave packet. Due to the localized nature of the wavepacket, these circuits can be determined on a sequence of small lattices using classical computers, and then robustly scaled to prepare wave packets on large lattices for simulations using quantum computers. Time evolution is implemented with a second-order Trotterization. To reduce both the required qubit connectivity and circuit depth, an approximate quasilocal interaction is introduced. This approximation is made possible by the emergence of confinement at long distances, and converges exponentially with increasing distance of the interactions. Using multiple error-mitigation strategies, up to 14 Trotter steps of time evolution are performed, employing 13,858 two-qubit gates (with a CNOT depth of 370). The propagation of hadrons is clearly identified, with results that compare favorably with Matrix Product State simulations. Finally, prospects for a near-term quantum advantage in simulations of hadron scattering are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

String breaking in the heavy quark limit with scalable circuits

Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with matter in the heavy quark limit is developed. This truncation is applied to SU(2) lattice gauge theory in 1+1D to map the theory efficiently onto a quantum computer. Scalable variational circuits are found to prepare the vacuum and single meson states. It is also shown how these state preparation circuits can be used to perform measurements of the number of mesons produced during the system’s time evolution. A state with a single qq¯ pair is prepared on quantum hardware and the inelastic production of qq¯ pairs is observed using 104 qubits on IBM’s Heron quantum computer ibm_torino.

Ciavarella, Anthony N↗
DOE OSTI2025

Scalable quantum simulations of scattering in scalar field theory on 120 qubits

Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be bounded-error quantum polynomial time (BQP) complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wave packets in one-dimensional scalar field theory is simulated using 120 qubits of IBM’s Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wave packet initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical matrix product state simulations. Finally, the developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.

quantum circuits↗
DOE OSTI2021

Composable Programming of Hybrid Workflows for Quantum Simulation

We present a composable design scheme for the development of hybrid quantum/classical algorithms and workflows for applications of quantum simulation. Our object-oriented approach is based on constructing an expressive set of common data structures and methods that enable programming of a broad variety of complex hybrid quantum simulation applications. The abstract core of our scheme is distilled from the analysis of the current quantum simulation algorithms. Subsequently, it allows a synthesis of new hybrid algorithms and workflows via the extension, specialization, and dynamic customization of the abstract core classes defined by our design. We implement our design scheme using the hardware-agnostic programming language QCOR into the QuaSiMo library. To validate our implementation, we test and show its utility on commercial quantum processors from IBM, running some prototypical quantum simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Hybrid Quantum-Classical Neural Networks

Deep learning is one of the most successful and far-reaching strategies used in machine learning today. However, the scale and utility of neural networks is still greatly limited by the current hardware used to train them. These concerns have become increasingly pressing as conventional computers are soon expected to approach the physical limitations that will slow their performance improvements in the near future. For these reasons, scientists have begun to explore alternative computing platforms, like quantum computers, for training neural networks. In recent years, variational quantum circuits have emerged as one of the most successful approaches to quantum deep learning on noisy intermediate scale quantum devices. We propose a hybrid quantum-classical neural network architecture where each neuron is a variational quantum circuit. We empirically analyze the performance of this hybrid neural network on a series of binary classification data sets using a simulated IBM universal quantum computer and a state-of-the-art IBM universal quantum computer. On the simulated hardware, we observe that the hybrid neural network achieves around 10% higher classification accuracy and 20% better minimization of the cost function than an individual variational quantum circuit. On the quantum hardware, we observe that each model only performs well when the qubit and gate count is sufficiently small.

Arthur, Davis↗
DOE OSTI2024

Probing Quantum Telecloning on Superconducting Quantum Processors

Quantum information cannot be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred to as quantum cloning, and quantum teleportation. Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties, using the classical results of a Bell measurement made on a prepared quantum telecloning state. Quantum telecloning can be implemented as a circuit on quantum computers using a classical coprocessor to compute classical feedforward instructions using if statements based on the results of a midcircuit Bell measurement in real time. We present universal symmetric optimal 1 → M telecloning circuits and experimentally demonstrate these quantum telecloning circuits for M = 2 up to M = 10, natively executed with real-time classical control systems on IBM Quantum superconducting processors, known as dynamic circuits. We perform the cloning procedure on many different message states across the Bloch sphere, on seven IBM Quantum processors, optionally using the error suppression technique X–X sequence digital dynamical decoupling. Two circuit optimizations are utilized: one that removes ancilla qubits for M = 2,3 , and one that reduces the total number of gates in the circuit but still uses ancilla qubits. Parallel single-qubit tomography with maximum likelihood estimation density matrix reconstruction is used in order to compute the mixed-state density matrices of the clone qubits, and clone quality is measured using quantum fidelity. These results present one of the largest and most comprehensive noisy intermediate-scale quantum computer experimental analyses on (single qubit) quantum telecloning to date. The clone fidelity sharply decreases to 0.5 for M > 5 , but for M = 2 , we are able to achieve a mean clone fidelity of up to 0.79 using dynamical decoupling.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Test Points for Online Monitoring of Quantum Circuits

Noisy Intermediate-Scale Quantum (NISQ) computers consisting of tens of inherently noisy quantum bits (qubits) suffer from reliability problems. Qubits and their gates are susceptible to various types of errors. Due to limited numbers of qubits and high error rates, quantum error correction cannot be applied. Physical constraints of quantum hardware including the error rates are used to guide the design and the layout of quantum circuits. The error rates determine the selection of qubits and their operations. The resulting circuit is executed on the quantum computer. This study explores the risk of unexpected changes in the error rates of NISQ computers post-calibration. We show that unexpected changes in error rates can alter the output state of a quantum circuit. To detect these changes, we propose the insertion of test points into the quantum circuit to enable online monitoring of the physical qubit behavior. We utilize classical, superposition, and uncompute test points. Furthermore, we use a gate error coverage metric to assess the quality of the tests. We verify the effectiveness of the proposed scheme on different IBM quantum computers (IBM Q), in addition to a noisy simulation that shows the scalability of the proposed approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Python Robust Phase Estimation (PyRPE)

Robust Phase Estimation (RPE) is a quantum algorithm to determine the relative phases of eigenstates of a unitary operator. This code implements the classical portion of the RPE algorithm, useful both in simulation (e.g., Sandia's pyGSTi or IBM's Qiskit simulators) and on actual quantum hardware (e.g., IBM's Qiskit Quantum Experience). It additionally implements improvements in these dependent software packages, for both required core function of the RPE and improved usability. SAND2020-12547 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Russo, Antonio↗
DOE OSTI2020

Mesoscale to Microscale Simulations over Complex Terrain with the Immersed Boundary Method in the Weather Research and Forecasting Model

Improvements to the Weather Research and Forecasting (WRF) Model are made to enable multiscale simulations over highly complex terrain with dynamically downscaled boundary conditions from the mesoscale to the microscale. Over steep terrain, the WRF Model develops numerical errors that are due to grid deformation of the terrain-following coordinates. An alternative coordinate system, the immersed boundary method (IBM), has been implemented into WRF, allowing for simulations over highly complex terrain; however, the new coordinate system precluded nesting within mesoscale simulations using WRF’s native terrain-following coordinates. Here, the immersed boundary method and WRF’s grid-nesting framework are modified to seamlessly work together. This improved framework for the first time allows for large-eddy simulation over complex (urban) terrain with IBM to be nested within a typical mesoscale WRF simulation. Simulations of the Joint Urban 2003 field campaign in Oklahoma City, Oklahoma, are performed using a multiscale five-domain nested configuration, spanning horizontal grid resolutions from 6 km to 2 m. These are compared with microscale-only simulations with idealized lateral boundary conditions and with observations of wind speed/direction and SF 6 concentrations from a controlled release from intensive observation period 3. The multiscale simulation, which is configured independent of local observations, shows similar model skill predicting wind speed/direction and improved skill predicting SF 6 concentrations when compared with the idealized simulations, which require use of observations to set mean flow conditions. Use of this improved multiscale framework shows promise for enabling large-eddy simulation over highly complex terrain with dynamically downscaled boundary conditions from mesoscale models.

42 ENGINEERING↗
DOE OSTI2020

The Heavy Rainfall Mechanism Revealed by a Terrain-Resolving 4DVar Data Assimilation System—A Case Study

In this study, a newly developed terrain-resolving four-dimensional variational (4DVar)-based data assimilation system, Immersed Boundary Method_Variational Doppler Radar Analysis System (IBM_VDRAS), is applied to investigate the mechanisms leading to a heavy precipitation event that occurred in Taiwan during the Southwesterly Monsoon Experiment (SoWMEX) conducted in 2008. The multivariate analyses using IBM_VDRAS and surface observations reveal that the warm and moist southwesterly flow from the ocean decelerates after making landfall, forming a surface convergence zone along the coast, which is further strengthened during the passage of a prefrontal rainband. The flow ascends as it advances inland until reaching the mountains, producing persistent precipitation and the enhancement of evaporative cooling as well as a widespread high pressure zone. A very shallow (<0.4 km) layer of offshore flow can be identified over the southwestern plain, which helps to generate a quasi-stationary convergence zone near the coast. Furthermore, sensitivity studies are carried out to quantify the relative importance of the contributions made by topographic blockage, evaporative cooling, and their nonlinear interaction, to the evolution of this type of convective system. The influence of the topography is identified as the dominant factor in modulating the flow structure of the rainfall system. However, it is the nonlinear interaction between terrain and evaporation that determines the distribution of the temperature and pressure fields.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Long Term Per-Component Power and Thermal Measurements of the OLCF Summit System

As we move into the exascale era, the power and energy footprints of high-performance computing (HPC) systems have grown significantly larger. Due to the harsh power and thermal conditions the system, components are exposed to extreme operating conditions. Operation of such modern HPC systems requires deep insights into long term system behavior to maintain its efficiency as well as its longevity. To help the HPC community to gain such insights, we provide a dataset that records the long-term power and thermal behavior of the 200PF pre-exascale supercomputer at the Oak Ridge Leadership Computing Facility (OLCF), Summit. This system is an IBM AC922 based system that has 9,252 IBM Power9 CPUs and 27,756 Nvidia V100 GPUs and can consume up to 13MW power at peak. Heat removal is performed using medium temperature direct liquid cooling and rear-door heat exchanger based secondary cooling loop. Originally extracted from a high-resolution (1Hz) per-component (GPUs, CPUs) measurements from the system, we primarily provide a dataset that has 10-second and 1-minute mean power and thermal measurements selected from five month-long segments over the course of 2020 (January and August), 2021 (February and August), and 2022 (January). For convenience, we also provide various sub datasets randomly sampled from the time and space (hosts) of the cluster. Further details and example code for analysis can be found in the following GitHub repository: https://github.com/at-aaims/summit_power_and_thermal_data

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Spatially Explicit Individual-Based Modeling Approach to Evaluate the Cumulative Effects of Wind Energy Development on the Greater Sage-Grouse: Sensitivity Analysis and Validation of Key Parameters

To address the need for an approach to evaluate cumulative ecological impacts of wind energy development, particularly those on critical wildlife habitats and species, the authors developed a proof-of-concept, landscape-based, spatially explicit individual-based modeling (IBM) framework for populations of the greater sage-grouse (Centrocercus urophasianus) in Albany County, Wyoming, based on published and other available information on the life history of the species. This sage-grouse IBM estimates the spatial and temporal movements of sage-grouse based on modeled effects of habitat characteristics and developments on sage-grouse condition, survivorship, and reproduction. After completing the initial version of the model, we conducted a series of sensitivity analyses of key model parameters and validation of lek occurrences and spatial distributions to better understand performance of the model relative to observed values of important life history characteristics. The parameter sensitivity analysis was conducted as a series of one-factor-at-a-time tests in which the values of selected parameters were individually varied to evaluate the corresponding effects on model output. We examined the model’s response to changes in parameter values to gain insight into the overall robustness of the model, identify key driver parameters, and initiate qualitative validation. Five functions selected for sensitivity analyses were (1) the rate of change in body condition in relationship to habitat suitability index (HSI) of occupied habitat (condition change rate), (2) the effect of competition between individuals with overlapping home ranges expressed as a percentage reduction in HSI (competition factor), (3) value of condition at which survivorship probability is equal to zero (zero survivorship condition), (4) the relationship between female body condition and clutch size, and (5) the relationship between female body condition and nest success. We varied the parameter values to be tested for the sensitivity analysis around the original value used in the model (i.e., tested values were higher and lower than the model’s original value) to examine the effect of this variation on the predicted output of the model. Model outputs evaluated in the sensitivity analysis included (1) predicted age-class distribution (as measured by the percentage of immature individuals within the population); (2) predicted sex ratio; (3) predicted age-sex class distribution (percent of population in each of six age-sex classes, i.e., male and female juveniles, yearlings, and adults); (4) lifespan; (5) population size; and (6) spatial distribution. Of the five parameters analyzed, condition change rate, survivorship, clutch size, and nest success did not substantially affect any of the evaluated model outputs. For the predicted age-class distribution, the percentage of immature individuals predicted by the model for these four parameters ranged from 61.9% to 65.0%, which was reasonable with respect to the reference values of 51.4 to 57.8% in published studies. The ratio of females to males ranged from 1.09 to 1.14, which was comparable to the reference values of 1.2 to 3.0 presented in an existing study. The predicted mean lifespan ranged from 1.62 to 1.74 years, which appears to be reasonable with respect to the reference values of 0.9 to 1.1 years for sharp-tail grouse and greater prairie chickens presented by published studies. The predicted population size ranged from 1,877 to 3,140. This prediction would be reasonable with respect to our estimate of 5,000 yearlings and adults, which was based on the USFWS estimate for the state of Wyoming scaled to the number of leks in the county. The predicted spatial distribution was not substantially affected by the parameter values examined. In our sensitivity analyses, the only tested parameter that had a noticeable effect on model output was competition factor. Over the range of values tested for this parameter, predicted population size exhibited the largest range (from 1,833 to 4,737) of all parameters tested. As the competition factor increased, the predicted population size decreased. This reflects the effect competition had on the number of individuals that could co occur in high-quality habitat patches. Despite this apparently significant effect, the range of values appears to be reasonable with respect to our estimate of 5,000 yearlings and adults, which was based on the USFWS estimate for the state of Wyoming scaled to the number of leks in the county.

17 WIND ENERGY↗
DOE OSTI2022

Quantitative Performance Assessment of Proxy Apps and Parents (Report for ECP Proxy App Project Milestone ADCD-504-28)

The ECP Proxy Application Project has an annual milestone to assess the state of ECP proxy applications and their role in the overall ECP ecosystem. Our FY22 March/April milestone (ADCD- 504-28) proposed to: Assess the fidelity of proxy applications compared to their respective parents in terms of kernel and I/O behavior, and predictability. Similarity techniques will be applied for quantitative comparison of proxy/parent kernel behavior. MACSio evaluation will continue and support for OpenPMD backends will be explored. The execution time predictability of proxy apps with respect to their parents will be explored through a carefully designed scaling study and code comparisons. Note that in this FY, we also have quantitative assessment milestones that are due in September and are, therefore, not included in the description above or in this report. Another report on these deliverables will be generated and submitted upon completion of these milestones. To satisfy this milestone, the following specific tasks were completed: Study the ability of MACSio to represent I/O workloads of adaptive mesh codes. Re-define the performance counter groups for contemporary Intel and IBM platforms to better match specific hardware components and to better align across platforms (make cross-platform comparison more accurate). Perform cosine similarity study based on the new performance counter groups on the Intel and IBM P9 platforms. Perform detailed analysis of performance counter data to accurately average and align the data to maintain phases across all executions and develop methods to reduce the set of collected performance counters used in cosine similarity analysis. Apply a quantitative similarity comparison between proxy and parent CPU kernels. Perform scaling studies to understand the accuracy of predictability of the parent performance using its respective proxy application. This report presents highlights of these efforts.

97 MATHEMATICS AND COMPUTING↗