Development and validation of a high-resolution regional wave hindcast model for U.S. West Coast wave resource characterization
Not Available
Wu, Wei-Cheng (ORCID:0000000222156351)↗
SEARCH · Engineering Papers
Results for “High performance 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.
The confluence of machine learning and multiscale simulations
Multiscale modeling has a long history of use in structural biology, as computational biologists strive to overcome the time- and length-scale limits of atomistic molecular dynamics. Contemporary machine learning techniques, such as deep learning, have promoted advances in virtually every field of science and engineering and are revitalizing the traditional notions of multiscale modeling. Deep learning has found success in various approaches for distilling information from fine-scale models, such as building surrogate models and guiding the development of coarse-grained potentials. However, perhaps its most powerful use in multiscale modeling is in defining latent spaces that enable efficient exploration of conformational space. In conclusion, this confluence of machine learning and multiscale simulation with modern high-performance computing promises a new era of discovery and innovation in structural biology.
59 BASIC BIOLOGICAL SCIENCES↗
Quench process modeling & simulation in the heat-treatment of critical aerospace components
To manufacture light-weight, advanced metal alloy components for gas turbine engines, quench heat-treatment processes are typically used. By quenching the component from elevated tempera-tures, the alloy sometimes undergoes a solid-state phase transformation which produces special microstructures with the required, enhanced mechanical properties. However, the quenching can also lead to cracks forming in the component. Addressing the quench cracking problems adds a significant burden to the cost, schedule, and energy demand of manufacture. Currently, optimizing the quench process to mitigate or avoid the cracking is performed largely by trial-and-error, relying heavily on costly experimental (thermocouple) trials to understand the local thermal gradients which cause the cracks to form. In this first part (Phase 1) of the work, high-performance computing is employed to establish the ability of modern CFD (computational fluid dynamics) to alleviate or wholly replace the experimental quenching trials by virtual testing. A baseline CFD model is defined and its accuracy established to be comparable to (and which usually exceeds) the accuracy of existing HTC (heat-transfer correlation) based simulation methods of quenching. As a first-principles based approach, “calibration” of the Baseline CFD model is independent of the quench process itself, but instead relies on the accuracy of the underlying (modeled), generic two-phase fluid processes which cannot be currently resolved by CFD for large, industrial-scale cases. A novel, high-fidelity DNS capability has been developed and verified to examine and further improve upon the mean-field closure submodels on which the Baseline CFD approach is based.
36 MATERIALS SCIENCE↗
Compactly‐Supported Nonstationary Kernels for Computing Exact Gaussian Processes on Big Data
The Gaussian process (GP) is a widely used method for analyzing large-scale data sets, including spatio-temporal measurements of nonlinear processes that are now commonplace in the environmental sciences. Traditional implementations of GPs involve stationary kernels (also termed covariance functions) that limit their flexibility, and exact methods for inference that prevent application to data sets with more than about 10,000 points. Modern approaches to address stationarity assumptions generally fail to accommodate large data sets, while all attempts to address scalability focus on approximating the Gaussian likelihood, which can involve subjectivity and lead to inaccuracies. In this work, we explicitly derive an alternative kernel that can discover and encode both sparsity and nonstationarity. We embed the kernel within a fully Bayesian GP model and leverage high-performance computing resources to enable the analysis of massive data sets. We demonstrate the favorable performance of our novel kernel relative to existing exact and approximate GP methods across a variety of synthetic data examples. Furthermore, we conduct space–time prediction based on more than 1 million measurements of daily maximum temperature and verify that our results outperform state-of-the-art methods in the Earth sciences. More broadly, having access to exact GPs that use ultra-scalable, sparsity-discovering, nonstationary kernels allows GP methods to truly compete with a wide variety of machine learning methods.
Gaussian processes↗
Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins
Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.
Li, Chengxuan↗
Assessing VQLS for Fluid Dynamics on a Hybrid Quantum-HPC Stack
Recent advances in quantum linear solvers offer a promising direction for accelerating extreme scientific computations such as fluid dynamics. However, the deep and complex circuits required by many quantum algorithms limit their practical use on current quantum hardware. The Variational Quantum Linear Solver (VQLS) presents a viable alternative for near-term quantum devices (NISQ), and initial efforts have explored its application to select fluid dynamics problems. In this work, we evaluate the use of VQLS for canonical fluid dynamics problems, aiming to identify pathways for generalizing its implementation across a broader class of systems. We analyze the impact of various circuit ansatz and classical optimizers on solution quality and convergence behavior. Furthermore, we assess the algorithm's feasibility within a hybrid quantum–high-performance computing (HPC) framework by porting it to QFw, a state-of-the-art quantum-HPC software stack. 11This manuscript has been authored by UT-Battelle, LLC, under contract DE-AC05-00OR22725 with the US Department of Energy (DOE). The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for US government purposes. DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan. This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the US DOE under Contract No. DE-AC05-00OR22725.
Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
Energy dataset of Frontier supercomputer for waste heat recovery
The Hewlett Packard Enterprise–Cray EX Frontier is the world’s first and fastest exascale supercomputer, hosted at the Oak Ridge Leadership Computing Facility in Tennessee, United States. Frontier is a significant electricity consumer, drawing 8–30 MW; this massive energy demand produces significant waste heat, requiring extensive cooling measures. Although harnessing this waste heat for campus heating is a sustainability goal at Oak Ridge National Laboratory (ORNL), the 30 °C–38 °C waste heat temperature poses compatibility issues with standard HVAC systems. Heat pump systems, prevalent in residential settings and some industries, can efficiently upgrade low-quality heat to usable energy for buildings. Thus, heat pump technology powered by renewable electricity offers an efficient, cost-effective solution for substantial waste heat recovery. However, a major challenge is the absence of benchmark data on high-performance computing (HPC) heat generation and waste heat profiles. This paper reports power demand and waste heat measurements from an ORNL HPC data centre, aiming to guide future research on optimizing waste heat recovery in large-scale data centres, especially those of HPC calibre.
97 MATHEMATICS AND COMPUTING↗
HPC4Mfg with Sepion
We employed ab-initio simulations and quantum chemical calculations to develop a computational framework for simulating the microscopic structure and mechanical properties of novel polymer membranes used in lithium sulfur batteries. To meet industry targets, next generation batteries with high specific energy (Wh/kg) are essential. Efforts to commercialize light-weight, energy-dense lithium-sulfur secondary batteries (2510 Wh/kg) have been stalled by ongoing problems with the battery’s separator membrane, which should prevent cross-over of active material from cathode to anode that, if unchecked, limits cycle-life. However, Sepion Technologies’ polymer membranes yield long-lasting lithium-sulfur cells. Advancing to 10 Ah battery prototypes, Sepion faces challenges in membrane manufacturing related to polymer processing and the molecular basis for membrane performance and durability. High performance computing offers critical new insight into these phenomena, which in turn will accelerate product entry into the market.
25 ENERGY STORAGE↗
Application of Machine Learning Techniques to an Agent-Based Model of Pantoea
Agent-based modeling (ABM) is a powerful simulation technique which describes a complex dynamic system based on its interacting constituent entities. While the flexibility of ABM enables broad application, the complexity of real-world models demands intensive computing resources and computational time; however, a metamodel may be constructed to gain insight at less computational expense. Here, we developed a model in NetLogo to describe the growth of a microbial population consisting of Pantoea . We applied 13 parameters that defined the model and actively changed seven of the parameters to modulate the evolution of the population curve in response to these changes. We efficiently performed more than 3,000 simulations using a Python wrapper, NL4Py . Upon evaluation of the correlation between the active parameters and outputs by random forest regression, we found that the parameters which define the depth of medium and glucose concentration affect the population curves significantly. Subsequently, we constructed a metamodel, a dense neural network, to predict the simulation outputs from the active parameters and found that it achieves high prediction accuracy, reaching an R 2 coefficient of determination value up to 0.92. Our approach of using a combination of ABM with random forest regression and neural network reduces the number of required ABM simulations. The simplified and refined metamodels may provide insights into the complex dynamic system before their transition to more sophisticated models that run on high-performance computing systems. The ultimate goal is to build a bridge between simulation and experiment, allowing model validation by comparing the simulated data to experimental data in microbiology.
59 BASIC BIOLOGICAL SCIENCES↗
Weighted relaxation for multigrid reduction in time
Current trends in computer architectures now mean that faster computation speed must come primarily from increased concurrency, not faster clock speeds, which are stagnating. Thus, this situation creates bottlenecks for serial algorithms, including the well-known bottleneck for sequential time-integration, where each individual time-value (i.e., time-step) is computed sequentially. One approach to alleviate this and achieve parallelism in time is with multigrid. Here, in this work, we consider multigrid-reduction-in-time (MGRIT), a multilevel method applied to the time dimension that computes multiple time-steps in parallel. Like all multigrid methods, MGRIT relies on the complementary relationship between relaxation on a fine-grid and a correction from the coarse grid to solve the problem. All current MGRIT implementations are based on unweighted-Jacobi relaxation; here we introduce the concept of weighted relaxation to MGRIT. We derive new convergence bounds for weighted relaxation, and use this analysis to guide the selection of relaxation weights. Numerical results then demonstrate that by choosing appropriate non-unitary relaxation weights, one can achieve faster convergence rates and lower iteration counts for MGRIT when compared with unweighted relaxation. In most cases, weighted relaxation yields a 10%–20% saving in iterations, which is significant when using large high-performance computers. For A-stable integration schemes, results also illustrate that under-relaxation can restore convergence in some cases where unweighted relaxation is not convergent.
97 MATHEMATICS AND COMPUTING↗
Distributed-Memory Sparse Deep Neural Network Inference Using Global Arrays
Partitioned Global Address Space (PGAS) models exhibit tremendous promise in developing efficient and productive distributed-memory parallel applications. They have been used extensively in scientific computations due to conveniently offering a ``shared-memory''-like model and convenient interfaces that separate communication with synchronization. Traditionally, PGAS communication models have been applied to dense/contiguously distributed data, but most modern applications depict varied levels of sparsity. Existing PGAS models require certain adaptations to support distributed sparse computations, since associated computations often require matrix arithmetic, in addition to data movement. The Global Arrays toolkit from Pacific Northwest National Laboratory (PNNL) is one of the earliest PGAS models to combine one-sided data communication and distributed matrix operations and is still used in the popular NWChem quantum chemistry suite. Recently, we have expanded the Global Arrays toolkit to support common sparse operations, like sparse matrix-dense matrix multiplies (SpMM), sparse matrix-sparse matrix multiplication (SpGEMM) and Sampled Dense-Dense Matrix Multiplication (SDDMM). As it turns out, these operations are the bedrock of sparse Deep Learning (DL); sparse deep neural networks and Graph Neural Networks (GNNs) have gained increasing attention recently in achieving speedups on training and inference with reduced memory footprints. Unlike scientific applications in High Performance Computing (HPC), modern (distributed-memory capable) DL toolkits often rely on non-standardized and closed-source vendor software optimizations, creating challenges in software-hardware co-design at scale. Our goal is to support a variety of distributed-memory sparse matrix operations and helper functions in the newly created Sparse Global Arrays (SGA), such that it is possible to build portable and productive Machine Learning scenarios for algorithm/software and hardware codesign purposes. Contemporary data-parallel schemes for training/inference are undergoing a major overhaul since model replication limits scalability and causes resource inefficiencies. As such, we have adopted tensor parallelism in decomposing the model and inputs, to mitigate memory issues. Current implementation is built on top of MPI and uses CPUs to maximize the portability across the platforms.
Distributed computing, machine learning↗
Evaluating performance and portability of high-level programming models: Julia, Python/Numba, and Kokkos on exascale nodes
We explore the performance and portability of the high-level programming models: the LLVM-based Julia and Python/Numba, and Kokkos on high-performance computing (HPC) nodes: AMD Epyc CPUs and MI250X graphical processing units (GPUs) on Frontier’s test bed Crusher system and Ampere’s Arm-based CPUs and NVIDIA’s A100 GPUs on the Wombat system at the Oak Ridge Leadership Computing Facilities. We compare the default performance of a hand-rolled dense matrix multiplication algorithm on CPUs against vendor-compiled C/OpenMP implementations, and on each GPU against CUDA and HIP. Rather than focusing on the kernel optimization per-se, we select this naive approach to resemble exploratory work in science and as a lower-bound for performance to isolate the effect of each programming model. Julia and Kokkos perform comparably with C/OpenMP on CPUs, while Julia implementations are competitive with CUDA and HIP on GPUs. Performance gaps are identified on NVIDIA A100 GPUs for Julia’s single precision and Kokkos, and for Python/Numba in all scenarios. We also comment on half-precision support, productivity, performance portability metrics, and platform readiness. We expect to contribute to the understanding and direction for high-level, high-productivity languages in HPC as the first-generation exascale systems are deployed.
Godoy, William↗
A multi-dimensional parametric study of variability in multi-phase flow dynamics during geologic CO 2 sequestration accelerated with machine learning
Successful geologic CO 2 storage projects depend on numerical simulations to predict reservoir performance during site selection, injection verification, and post-injection monitoring phases of the project. These numerical simulations solve non-linear sets of coupled partial differential equations, while accounting for multi-phase fluid dynamics on the basis of constitutive equations that are embedded into the solution scheme. As a consequence, individual simulations often require tens to hundreds of hours to complete on high-performance computing clusters. Moreover, laboratory experiments reveal that parametric functions for capillary pressure and relative permeability exhibit substantial variability, even within the same rock type. This combination of computational expense and wide-ranging parametric variability means that there remains substantial uncertainty in the behavior of multi-phase CO 2 -water systems, particularly in the context of feedbacks between relative permeability and capillary pressure. To bridge this knowledge gap, here we develop a novel workflow that utilizes physics-based numerical simulation to train an artificial neural network (ANN) emulator for interrogating the multivariate parameter space that governs both capillary pressure and relative permeability. With this approach, the ANN is trained to emulate both fluid pressure distribution and CO 2 saturation, which are then interrogated quantitatively to generate parametric response surface mappings with high-fidelity resolution. Results from this study initially show that capillary entry pressure is the dominant control on both CO 2 plume geometry and fluid pressure propagation when considering the combined effects of capillary pressure and relative permeability, particularly when phase interference is low and residual CO 2 saturation is high. Moreover, the ANN emulator provides tremendous computational speed-up by computing 2691 individual simulations in several minutes; whereas, the same simulation ensemble would have required ~3 years of simulation time using only physics-based simulation methods (25,000 times speed up).
58 GEOSCIENCES↗
High Flux Isotope Reactor Low Enriched Uranium U-10Mo Fuel Design Parameters
Activities to convert the HFIR from HEU to LEU are ongoing as part of the US Department of Energy (DOE) National Nuclear Security Administration (NNSA) nuclear nonproliferation mission. Design activities to study the conversion of HFIR from HEU to LEU fuel explored different fuel design features and shapes with a uranium-molybdenum (U-10Mo) monolithic alloy fuel. This high-density alloy contains 90 wt % uranium and 10 wt % molybdenum and has a uranium density of 15.318gU/cm 3 . The goal of these studies is to generate several candidate HFIR LEU fuel designs of varying fuel fabrication complexity that meet the current HEU performance metrics and safety requirements. Recent advancements in modeling and simulation tools and design methods enabled a thorough analysis of the available design space with U-10Mo fuel. A surrogate model used this analysis as training data to quickly determine the performance of a design given specific design parameters. An optimization module used this surrogate model to quickly search this multidimensional search space given specific desired performance characteristics. This approach was made possible by the large available design space with U-10Mo fuel. Shift, a Monte Carlo tool optimized for high-performance computing (HPC) architectures, was used for faster calculation and better data management for reactor physics simulations. Once most of these design studies were complete, a new suite called the Python HFIR Analysis and Measurement Engine (PHAME) was developed to connect all fuel design analysis steps, making design studies more efficient and reproducible. The post-processing capabilities of these new tools are leveraged for the information provided herein. Leveraging these tools, several candidate fuel designs were selected with varying levels of feature complexity and reactor performance. This report provides design feature details for four selected HFIR LEU U-10Mo fuel designs and their corresponding performance and safety metrics. Nominal best-estimate design parameters and irradiation conditions, including fission rate densities, power densities, heat fluxes, and cumulative fission densities, are provided. Simulations show that the high uranium density of U-10Mo fuel provides a large potential design space that enables various LEU designs to meet HEU core performance metrics and safety requirements with a power increase from 85 MW (HEU) to 95 MW or 100 MW (LEU).
11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
Planck intermediate results
We present the NPIPE processing pipeline, which produces calibrated frequency maps in temperature and polarization from data from the Planck Low Frequency Instrument (LFI) and High Frequency Instrument (HFI) using high-performance computers. NPIPE represents a natural evolution of previous Planck analysis efforts, and combines some of the most powerful features of the separate LFI and HFI analysis pipelines. For example, following the LFI 2018 processing procedure, NPIPE uses foreground polarization priors during the calibration stage in order to break scanning-induced degeneracies. Similarly, NPIPE employs the HFI 2018 time-domain processing methodology to correct for bandpass mismatch at all frequencies. In addition, NPIPE introduces several improvements, including, but not limited to: inclusion of the 8% of data collected during repointing manoeuvres; smoothing of the LFI reference load data streams; in-flight estimation of detector polarization parameters; and construction of maximally independent detector-set split maps. For component-separation purposes, important improvements include: maps that retain the CMB Solar dipole, allowing for high-precision relative calibration in higher-level analyses; well-defined single-detector maps, allowing for robust CO extraction; and HFI temperature maps between 217 and 857 GHz that are binned into 0'.9 pixels (Nside = 4096), ensuring that the full angular information in the data is represented in the maps even at the highest Planck resolutions. The net effect of these improvements is lower levels of noise and systematics in both frequency and component maps at essentially all angular scales, as well as notably improved internal consistency between the various frequency channels. Based on the NPIPE maps, we present the first estimate of the Solar dipole determined through component separation across all nine Planck frequencies. The amplitude is (3366.6 ± 2.7) μK, consistent with, albeit slightly higher than, earlier estimates. From the large-scale polarization data, we derive an updated estimate of the optical depth of reionization of τ = 0.051 ± 0.006, which appears robust with respect to data and sky cuts. There are 600 complete signal, noise and systematics simulations of the full-frequency and detector-set maps. As a Planck first, these simulations include full time-domain processing of the beam-convolved CMB anisotropies. The release of NPIPE maps and simulations is accompanied with a complete suite of raw and processed time-ordered data and the software, scripts, auxiliary data, and parameter files needed to improve further on the analysis and to run matching simulations.
79 ASTRONOMY AND ASTROPHYSICS↗
Development and Experimental Optimization of High-Temperature Modeling Tools and Methods for Concentrated Solar Power Particle - Systems
A novel, open-source radiative modeling toolset was developed to extend the functionality of particle-based modeling software (e.g. discrete element method (DEM)) to environmental conditions relevant to concentrated solar power applications. This toolset was optimized for deployment on desktop workstations instead of high-performance computing systems, to render such tools more accessible to the research community. Both particle-based modeling and radiative exchange modeling are computationally expensive and often require specialized programming expertise, making these methods cumbersome to use. Recent developments in DEM software by DCS Computing have greatly reduced these challenges, providing a graphical-user-interface based platform and modeling optimization for desktop workstations, HPCs, and cloud computing. The University of Dayton leveraged the experience of DCS Computing in developing a user-friendly, open-source radiative heat transfer expansion for DEM modeling. The University of Dayton DEM+ radiative modeling toolset was developed using a combination of fundamental experimental measurements, modeling, and simplified flow experiments over a range of temperatures and flow conditions. The toolset provides researchers with access to multiple radiative models including an accelerated Monte-Carlo Ray Tracing (application agnostic, highly computationally expensive), an expanded database of distance-based approximations (application limited, computationally light), and a weighted blending of the two methods capable of achieving over 90% reduction in computation time with equivalent accuracy compared to Monte-Carlo Ray Tracing. Through a graphical user interface, users can customize the radiative models to match their desired accuracy and available computational resources, improving access to particle based modeling for the research community. Ceramic sintered bauxite proppants were used in modeling and experimentally as a baseline. Both the radiative heat transfer and flow properties for particulate systems were investigated at elevated temperatures up to 800 °C. The major accomplishments for this work include a verified, open-source radiative modeling toolset to be distributed amongst the research community and the fabrication of three small-scale test facilities to investigate particle behavior and tune DEM flow properties for operation up to 800 °C. The findings have been shared with the research community via conference modeling workshops, deployment of the tools in DCS Computing Aspherix®, and open-source access to the developed radiative modeling tool. The development of next-generation CSP facilities and thermal energy storage systems based on ceramic particles requires providing access to computationally efficient and accurate modeling tools. Particles will experience a wide range of environments (20-800 °C) and handling conditions (dilute curtains or dense packing), requiring specially designed and optimized equipment. Optimizing solid particle physics models and establishing best-practices for particle modeling in CSP environments will assist researchers with designing optimized equipment, accelerating the deployment of more economically-competitive CSP facilities.
14 SOLAR ENERGY↗
CAHS: Context-Aware Homology Search
Protein homology search is foundational to bioinformatics: it supports annotation transfer, structure/function inference, and evolutionary analysis over rapidly expanding sequence repositories (e.g., UniProtKB). Profile hidden Markov models (pHMMs), as implemented in HMMER, remain the most widely trusted approach because they provide statistically calibrated E-values; however, their gap behavior is fixed once a profile is trained, despite biological evidence that insertion/deletion tolerance varies across flexible loops and intrinsically disordered regions. We present CAHS (Context-Aware Homology Search), a lightweight query-time adapter for pHMM search that incorporates learned and biologically motivated signals without changing HMMER's downstream search pipeline or its calibrated E-value reporting. Given a query sequence, CAHS computes per-residue representations from a protein language model and a disorder predictor, maps these to profile coordinates, and modulates only match-state transition rows (gap-open and gap-extension probabilities) while preserving Plan7 constraints. We comprehensively evaluate CAHS across six structurally diverse protein families and multi-domain architectures against a 570k-sequence target corpus. CAHS expands detection capability, retrieving thousands of additional remote homologs at relaxed thresholds by maintaining alignment quality through flexible regions. For multi-domain proteins, context-aware modulation resolves 94% of fragmented alignments. Crucially, CAHS preserves hit-set invariance at stringent operating points (E<10-10), demonstrating increased statistical confidence without inflating false positives. Furthermore, sharper statistical distinction between homologs and background noise during early filter stages yields up to a 3.87× acceleration in end-to-end wall-clock time on high-performance computing clusters. Overall, CAHS illustrates a practical AI-for-science design pattern: augmenting a trusted probabilistic model with query-specific learned signals to improve interpretable, reproducible inference in data-rich biology.
Bhattaram, Swethasree [Georgia Institute of Techno↗
Map Applications to Target Exascale Architecture with Machine-Specific Performance Analysis, Including Challenges and Projections
This Exascale Computing Project (ECP) milestone report summarizes the status of all 30 ECP Applications Development (AD) subprojects at the end of FY20. In October and November of 2020, a comprehensive assessment of AD projects was conducted by the ECP leadership. Reviews occurred virtually between October 27, 2020 and November 12, 2020. The review committee—consisting of the AD lead, deputy, and L3—was tasked with evaluating each subproject’s progress in porting their codes to early exascale architectures considered precursors to the planned exascale machines. This includes characterizing which modules have been ported to multi-accelerator nodes, initial performance analyses, the status of software integration, and a current vision of successes, obstacles, and next steps. As such, this report contains not only an accurate snapshot of each subproject’s current status but also represents an unprecedentedly broad account of experiences in porting large scientific applications to next-generation high-performance computing architectures.
97 MATHEMATICS AND COMPUTING↗