Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer system 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 1,009 records · Page 56

Mass transport analysis for tritium removal in FHRs

Tritium control and mitigation is one of the most significant issues in Fluoride Salt-cooled Hightemperature Reactors (FHRs). To address this issue, a cross-flow tritium removal facility has been proposed to remove molecular tritium, T 2 , from the primary coolant. To model the performance of the design, a method is developed based on the logarithmic mean difference of the square root of the tritium partial pressures on the upstream side and the purging gas side. A computer code has been developed based on this global analysis method to study the effectiveness of tritium removal in such a cross-flow tritium removal facility. The code is benchmarked against experimental data from a hydrogen separation experiment in the literature and compared with the results from a code based on traditional finite volume method. Evaluation of the cross-flow tritium removal facility designed for FHR systems has also been performed. The results show how the key factors, i.e., the fluid flow rates and tritium inlet concentration affect the performance of the facility.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

On the role of Battery Energy Storage Systems in the day-ahead Contingency-Constrained Unit Commitment problem under renewable penetration

The integration of variable Renewable Energy Sources (vRES) to alleviate greenhouse gas emissions has introduced significant challenges for power systems operations. These challenges include high levels of uncertainty due to the intermittence associated with vRES and therefore impose the need to devise a reliable and cost-effective day-ahead unit commitment and power and reserves scheduling for real-time operations. Also, this increasing penetration of vRES requires higher ramping capabilities from units originally designed for other purposes (e.g., base-load generation), which might be exacerbated during contingency states. Hence, in this work, we propose a methodology to address the day-ahead Contingency-Constrained Unit Commitment (CCUC) problem that leverages the participation of Battery Energy Storage Systems (BESSs) to address load-following and post-contingency management, therefore alleviating the ramping burden on conventional thermal generators. To do so, we formulate a three-level optimization problem that represents the decision-making process of obtaining the least-cost commitment, generation and reserves scheduling, while restricting the Conditional Value-at-Risk (CVaR) of the system imbalance at real-time operations to user-defined tolerance levels. In addition, we devise a computationally efficient solution approach for the proposed problem based on the Column-and Constraint Generation (CCG) algorithmic framework. Two numerical experiments are conducted to empirically illustrate the benefits of the proposed methodology. Key results indicate a reduction in real-time ramping needs and a better usage of the system resources, with a reduction in the overall system commitment levels and reserve scheduling costs when compared to a benchmark case in which storage is not available.

Moreira, Alexandre↗

Towards a self-driving trigger at the LHC: adaptive response in real time

Real-time data filtering and selection—or trigger—systems at high-throughput scientific facilities such as the experiments at the Large Hadron Collider must process extremely high-rate data streams under stringent bandwidth, latency, and storage constraints. Yet these systems are typically designed as static, hand-tuned menus of selection criteria grounded in prior knowledge and simulation. In this work, we further explore the concept of a self-driving trigger, an autonomous data-filtering framework that reallocates resources and adjusts thresholds dynamically in real-time to optimize signal efficiency, rate stability, and computational cost as instrumentation and environmental conditions evolve. We introduce a benchmark ecosystem to emulate realistic collider scenarios and demonstrate real-time optimization of a menu including canonical energy sum triggers as well as modern anomaly-detection algorithms that target non-standard event topologies using machine learning. Using simulated data streams and publicly available collision data from the Compact Muon Solenoid experiment, we demonstrate the capability to dynamically and automatically optimize trigger performance under specific cost objectives without manual retuning. Our adaptive strategy shifts trigger design from static menus with heuristic tuning to intelligent, automated, data-driven control, unlocking greater flexibility and discovery potential in future high-energy physics analyses.

Emami, Shaghayegh [Michigan U.] (ORCID:00090007589↗

Efficient grid-based method in nonequilibrium Green's function calculations: Application to model atoms and molecules

The finite-element discrete variable representation is proposed to express the nonequilibrium Green's function for strongly inhomogeneous quantum systems. This method is highly favorable against a general basis approach with regard to numerical complexity, memory resources, and computation time. Its flexibility also allows for an accurate representation of spatially extended Hamiltonians and thus opens the way toward a direct solution of the two-time Schwinger-Keldysh-Kadanoff-Baym equations on spatial grids, including, for example, the description of highly excited states in atoms. As benchmarks, we compute and characterize, in Hartree-Fock and second Born approximations, the ground states of the He atom, the H{sub 2} molecule, and the LiH molecule in one spatial dimension. Thereby, the ground-state and binding energies, densities, and bond lengths are compared with the direct solution of the time-dependent Schroedinger equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Designing a graphics processing unit accelerated petaflop capable lattice Boltzmann solver: Read aligned data layouts and asynchronous communication

The lattice Boltzmann method is a well-established numerical approach for complex fluid flow simulations. Recently, general-purpose graphics processing units (GPUs) have become available as high-performance computing resources at large scale. We report on designing and implementing a lattice Boltzmann solver for multi-GPU systems that achieves 1.79 PFLOPS performance on 16,384 GPUs. To achieve this performance, we introduce a GPU compatible version of the so-called bundle data layout and eliminate the halo sites in order to improve data access alignment. Furthermore, we make use of the possibility to overlap data transfer between the host central processing unit and the device GPU with computing on the GPU. As a benchmark case, we simulate flow in porous media and measure both strong and weak scaling performance with the emphasis being on large-scale simulations using realistic input data.

Computer Science↗

Flow Redirection and Induction in Steady State (FLORIS) Wind Plant Power Production Data Sets

This dataset contains turbine- and plant-level power outputs for 252,500 cases of diverse wind plant layouts operating under a wide range of yawing and atmospheric conditions. The power outputs were computed using the Gaussian wake model in NREL's FLOw Redirection and Induction in Steady State (FLORIS) model, version 2.3.0. The 252,500 cases include 500 unique wind plants generated randomly by a specialized Plant Layout Generator (PLayGen) that samples randomized realizations of wind plant layouts from one of four canonical configurations: (i) cluster, (ii) single string, (iii) multiple string, (iv) parallel string. Other wind plant layout parameters were also randomly sampled, including the number of turbines (25-200) and the mean turbine spacing (3D-10D, where D denotes the turbine rotor diameter). For each layout, 500 different sets of atmospheric conditions were randomly sampled. These include wind speed in 0-25 m/s, wind direction in 0 deg.-360 deg., and turbulence intensity chosen from low (6%), medium (8%), and high (10%). For each atmospheric inflow scenario, the individual turbine yaw angles were randomly sampled from a one-sided truncated Gaussian on the interval 0 deg.-30 deg. oriented relative to wind inflow direction. This random data is supplemented with a collection of yaw-optimized samples where FLORIS was used to determine turbine yaw angles that maximize power production for the entire plant. To generate this data, a subset of cases were selected (50 atmospheric conditions from 50 layouts each for a total of additional 2,500 cases) for which FLORIS was re-run with wake steering control optimization. The IEA onshore reference turbine, which has a 130 m rotor diameter, a 110 m hub height, and a rated power capacity of 3.4 MW was used as the turbine for all simulations. The simulations were performed using NREL's Eagle high performance computing system in February 2021 as part of the Spatial Analysis for Wind Technology Development project funded by the U.S. Department of Energy Wind Energy Technologies Office. The data was collected, reformatted, and preprocessed for this OEDI submission in May 2023 under the Foundational AI for Wind Energy project funded by the U.S. Department of Energy Wind Energy Technologies Office. This dataset is intended to serve as a benchmark against which new artificial intelligence (AI) or machine learning (ML) tools may be tested. Baseline AI/ML methods for analyzing this dataset have been implemented, and a link to their repository containing those models has been provided. The .h5 data file structure can be found in the GitHub repository under explore_wind_plant_data_h5.ipynb.

AI↗

Accelerating Scientific Workflows on HPC Platforms with In Situ Processing

Scientific workflows drive most modern large-scale science breakthroughs by allowing scientists to define their computations as a set of jobs executed in a given order based on their data dependencies. Workflow management systems (WMSs) have become key to automating scientific workflows-executing computational jobs and orchestrating data transfers between those jobs running on complex high-performance computing (HPC) platforms. Traditionally, WMSs use files to communicate between jobs: a job writes out files that are read by other jobs. However, HPC machines face a growing gap between their storage and compute capabilities. To address that concern, the scientific community has adopted a new approach called in situ, which bypasses costly parallel filesystem I/O operations with faster in-memory or in-network communications. When using in situ approaches, communication and computations can be interleaved. In this work, we leverage the Decaf in situ dataflow framework to accelerate task-based scientific workflows managed by the Pegasus WMS, by replacing file communications with faster MPI messaging. We propose a new execution engine that uses Decaf to manage communications within a sub-workflow (i.e., set of jobs) to optimize inter-job communications. We consider two workflows in this study: (i) a synthetic workflow that benchmarks and compares file- and MPI-based communication; and (ii) a realistic bioinformatics workflow that computes mu-tational overlaps in the human genome. Experiments show that in situ communication can improve the bioinformatics workflow execution time by 22% to 30% compared with file communication. Our results motivate further opportunities and challenges for bridging traditional WMSs with in situ frameworks.

Decaf↗

An HPC-Based Hydrothermal Finite Element Simulator for Modeling Underground Response to Community-Scale Geothermal Energy Production

Geothermal heat, as renewable energy, shows great advantage with respect to its environmental impact due to its significantly lower CO2 emissions than conventional fossil fuel. Open and closed-loop geothermal heat pumps, which utilize shallow geothermal systems, are an efficient technology for cooling and heating buildings, especially in urban areas. Integrated use of geothermal energy technologies for district heating, cooling, and thermal energy storage can be applied to optimize the subsurface for communities to provide them with multiple sustainable energy and community resilience benefits. The utilization of the subsurface resources may lead to a variation in the underground environment, which might further impact local environmental conditions. However, very few simulators can handle such a highly complex set of coupled computations on a regional or city scale. We have developed high-performance computing (HPC) based hydrothermal finite element (FE) simulator that can simulate the subsurface and its hydrothermal conditions at a scale of tens of km. The HPC simulator enables us to investigate the subsurface thermal and hydrologic response to the built underground environment (such as basements and subways) at the community scale. In this study, a coupled hydrothermal simulator is developed based on the open-source finite element library deal.II. The HPC simulator was validated by comparing the results of a benchmark case study against COMSOL Multiphysics, in which Aquifer Thermal Energy Storage (ATES) is modeled and a process of heat injection into ATES is simulated. The use of an energy pile system at the Treasure Island redevelopment site (San Francisco, CA, USA) was selected as a case study to demonstrate the HPC capability of the developed simulator. The simulator is capable of modeling multiple city-scale geothermal scenarios in a reasonable amount of time.

Sun, Xiang↗

Oak Ridge OpenSHMEM Benchmark Suite

The assessment of application performance is a fundamental task in high-performance computing (HPC). The OpenSHMEM Benchmark (OSB) suite is a collection of micro-benchmarks and mini-applications/compute kernels that have been ported to use OpenSHMEM. Some, like the NPB OpenSHMEM benchmarks, have been published before while most others have been used for evaluations but never formally introduced or discussed. This suite puts them together and is useful for assessing the performance of different use cases of OpenSHMEM. This offers system implementers a useful means of measuring performance and assessing the effects of new features as well as implementation strategies. The suite is also useful for application developers to assess the performance of the growing number of OpenSHMEM implementations that are emerging. In this paper, we describe the current set of codes available within the OSB suite, how they are intended to be used, and, where possible, a snapshot of their behavior on one of the OpenSHMEM implementations available to us. We also include detailed descriptions of every benchmark and kernel, focusing on how OpenSHMEM was used. This includes details on the enhancements we made to the benchmarks to support multithreaded variants. We encourage the OpenSHMEM community to use, review, and provide feedback on the benchmarks.

Naughton III, Thomas↗

Learning viscoelasticity models from indirect data using deep neural networks

In this study, we propose a novel approach to model viscoelasticity materials, where rate-dependent and non-linear constitutive relationships are approximated with deep neural networks. We assume that inputs and outputs of the neural networks are not directly observable, and therefore common training techniques with input–output pairs for the neural networks are inapplicable. To that end, we develop a novel computational approach to both calibrate parametric and learn neural-network-based constitutive relations of viscoelasticity materials from indirect displacement data in the context of multiple-physics systems. We show that limited displacement data holds sufficient information to quantify the viscoelasticity behavior. We formulate the inverse computation – modeling viscoelasticity properties from observed displacement data – as a PDE-constrained optimization problem and minimize the error functional using a gradient-based optimization method. The gradients are computed by a combination of automatic differentiation and implicit function differentiation rules. The effectiveness of our method is demonstrated through numerous benchmark problems in geomechanics and porous media transport.

97 MATHEMATICS AND COMPUTING↗

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Applications to Materials for Catalysis and Electrochemistry

Modeling complex materials using high-fidelity, ab initio methods at low cost is a fundamental goal for quantum chemical software packages. The GW approximation and random phase approximation (RPA) provide a unified description of both electronic structure and total energies using the same physics in a many-body perturbative approach that can be more accurate than generalized-gradient density functional theory (DFT) methods. However, GW/RPA implementations have historically been limited to either specific materials classes or application toward small chemical systems. Here, the static subspace approximation allows for reduced cost full-frequency GW/RPA calculations and has previously been benchmarked thoroughly for GW calculations. Here, we describe our approach to including partial occupations of electronic orbitals in full-frequency GW and RPA calculations for the study of electrocatalysts. We benchmarked RPA total energy calculations using the subspace approximation across a diverse test suite of materials for a variety of computational parameters. The benchmarking quantifies the impact of different extrapolation procedures for representing the static polarizability at infinite screened cutoff, and shows that using screened cutoffs above 20-25 Ryd result in diminishing accuracy returns for predicting RPA total energies. Additionally, for moderately sized electrocatalytic models, 2-3 times fewer computational resources are used to compute RPA total energies by representing the static polarizability with 20-30% of the static subspace basis, with an error of approximately 0.01 eV or better in RPA adsorption energy calculations. Finally, we show that for these electrochemical models RPA can shift DFT adsorption energy shifts by up to 0.5 eV and that GW can frequently shift DFT eigenvalues of surface and adsorbate states by approximately 0.5-1 eV.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling Cardiac Electrophysiology at the Organ Level in the Peta FLOPS Computing Age

Despite a steep increase in available compute power, in-silico experimentation with highly detailed models of the heart remains to be challenging due to the high computational cost involved. It is hoped that next generation high performance computing (HPC) resources lead to significant reductions in execution times to leverage a new class of in-silico applications. However, performance gains with these new platforms can only be achieved by engaging a much larger number of compute cores, necessitating strongly scalable numerical techniques. So far strong scalability has been demonstrated only for a moderate number of cores, orders of magnitude below the range required to achieve the desired performance boost.In this study, strong scalability of currently used techniques to solve the bidomain equations is investigated. Benchmark results suggest that scalability is limited to 512-4096 cores within the range of relevant problem sizes even when systems are carefully load-balanced and advanced IO strategies are employed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A comparison between the one- and two-step spin-orbit coupling approaches based on the ab initio Density Matrix Renormalization Group

The efficient and reliable treatment of both spin-orbit coupling (SOC) and electron correlation is essential for understanding f-element chemistry. Here, we analyze two approaches to the problem, the one-step approach where both effects are treated simultaneously, and the two-step state interaction approach. We report an implementation of the ab initio density matrix renormalization group(DMRG) with a one-step treatment of the SOC effect which can be compared to prior two-step treatments on an equal footing. Using a dysprosium octahedral complex and bridged dimer as benchmark systems, we identify characteristics of problems where the one-step approach is beneficial for obtaining the low-energy spectrum.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spectral Galerkin solver for intense beam Vlasov equilibria in nonlinear constant focusing channels

Here a numerical method is described for producing stationary solutions of the Vlasov-Poisson system describing a relativistic charged-particle beam in a constant focusing accelerator channel, confined transversely by a general (linear or nonlinear) focusing potential. The method utilizes a variant of the spectral Galerkin algorithm to solve a nonlinear partial differential equation (PDE) in two degrees of freedom for the beam space charge potential in equilibrium. Numerical convergence with an increasing number of computed spectral modes is investigated for several benchmark problems. Preservation of the stationary phase space density is verified using a strongly nonlinear focusing channel based on the Integrable Optics Test Accelerator at Fermi National Accelerator Laboratory.

43 PARTICLE ACCELERATORS↗

Enhancing the Performance of Assisted Execution Runtime Systems through Hardware/Software Techniques

To meet the expected performance, future exascale systems will require programmers to increase the level of parallelism of their applications. Novel programming models simplify parallel programming at the cost of increasing runtime overheard. Assisted execution models have the potential of reducing this overhead but they generally also reduce processor utilization. We propose an integrated hardware/software solution that automatically partition hardware resources between application and auxiliary threads. Each system level performs well-defined tasks efficiently: 1) the runtime system is enriched with a mechanism that automatically detects computing power requirements of running threads and drives the hardware actuators; 2) the hardware enforces dynamic resource partitioning; 3) the operating system provides an efficient interface between the runtime system and the hardware resource allocation mechanism. As a test case, we apply this adaptive approach to STM2, an software transactional memory system that implements the assisted execution model. We evaluate the proposed adaptive solution on an IBMPOWER7 system using Eigenbench and STAMP benchmark suite. Results show that our approach performs equal or better than the original STM2 and achieves up to 65% and 86% performance improvement for Eigenbench and STAMP applications, respectively.

Kestor, Gokcen↗

LU Factorization with Partial Pivoting for a Multi-CPU, Multi-GPU Shared Memory System

LU factorization with partial pivoting is a canonical numerical procedure and the main component of the High Performance LINPACK benchmark. This article presents an implementation of the algorithm for a hybrid, shared memory, system with standard CPU cores and GPU accelerators. Performance in excess of one TeraFLOPS is achieved using four AMD Magny Cours CPUs and four NVIDIA Fermi GPUs.

97 MATHEMATICS AND COMPUTING↗

HPC Analytics Support. Requirements for Uncertainty Quantification Benchmarks

This report outlines techniques for extending benchmark generation products so they support uncertainty quantification by benchmarked systems. We describe how uncertainty quantification requirements can be presented to candidate analytical tools supporting SPARQL. We describe benchmark data sets for evaluating uncertainty quantification, as well as an approach for using our benchmark generator to produce data sets for generating benchmark data sets.

benchmark↗

Amino Acid Encoding for Deep Learning Applications

Background: The number of applications of deep learning algorithms in bioinformatics is increasing as they usually achieve superior performance over classical approaches, especially, when bigger training datasets are available. In deep learning applications, discrete data, e.g. words or n-grams in language, or amino acids or nucleotides in bioinformatics, are generally represented as a continuous vector through an embedding matrix. Recently, learning this embedding matrix directly from the data as part of the continuous iteration of the model to optimize the target prediction – a process called ‘end-to-end learning’ – has led to state-of-the-art results in many fields. Although usage of embeddings is well described in the bioinformatics literature, the potential of end-to-end learning for single amino acids, as compared to more classical manually-curated encoding strategies, has not been systematically addressed. To this end, we compared classical encoding matrices, namely one-hot, VHSE8 and BLOSUM62, to end-to-end learning of amino acid embeddings for two different prediction tasks using three widely used architectures, namely recurrent neural networks (RNN), convolutional neural networks (CNN), and the hybrid CNN-RNN. Results: By using different deep learning architectures, we show that end-to-end learning is on par with classical encodings for embeddings of the same dimension even when limited training data is available, and might allow for a reduction in the embedding dimension without performance loss, which is critical when deploying the models to devices with limited computational capacities. We found that the embedding dimension is a major factor in controlling the model performance. Surprisingly, we observed that deep learning models are capable of learning from random vectors of appropriate dimension. Conclusion: Our study shows that end-to-end learning is a flexible and powerful method for amino acid encoding. Further, due to the flexibility of deep learning systems, amino acid encoding schemes should be benchmarked against random vectors of the same dimension to disentangle the information content provided by the encoding scheme from the distinguishability effect provided by the scheme.

Deep-learning↗