Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “application benchmarks”

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 505 records · Page 28

Benchmarking the extraction of statistical neutron capture cross sections on short-lived nuclei for applications using the β -Oslo method

Numerous scientific fields including astrophysics, nuclear power, and nuclear forensics require a knowledge of basic nuclear properties for large numbers of short-lived, radioactive isotopes far removed from stable nuclei. Neutron-capture cross sections are one such piece of nuclear data where direct measurements are not possible and theoretical predictions can vary by orders of magnitude. A recently developed indirect technique for inferring neutron capture rates, the β-Oslo method, has been introduced but not compared against a known, directly measured neutron capture cross section. To provide this benchmark, two indirect methods based on β decay and charged-particle reactions were used to extract the nuclear level density and γ-ray strength function of 51 Ti. The nuclear level density and γ-ray strength function from the two data sets were found to be equivalent and were used to extract the neutron capture cross section of 50 Ti which agrees with previous direct measurements at high neutron energies. Here, the results demonstrate the validity of the β-Oslo method for extracting neutron capture cross sections of short-lived nuclei and provide a sufficiently small uncertainty to be used in various applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

HTGR Simulation Methods & International Collaborations

ART-GCR “Methods” activity is split between Experimental Validation data from the ANL NSTF and OSU HTTF (next three presentations). HTGR core simulation (this presentation). International collaboration within OECD Generation-IV (Gen-IV) and USA/Japan bi-lateral agreements (this presentation) HTGR Simulation Methods No new NE-52 funding for HTGR Methods support in FY20; ~$200K FY19 carry-over funds only. Consists of international code-to-code benchmarks (IAEA CRP on HTGR UAM and OECD/NEA MHTGR-350) and refinement of a few-group Pebble Bed Reactor (PBR) cross section (XS) generation methodology. Funding will be requested in FY21 to produce the final reports for the two benchmarks and continue the development of the PBR XS generation methodology. Additional (non-ART) HTGR-related support work at INL NEAMS: HTR-Application work package at INL Create a benchmark for the pebble shuffling and depletion algorithms being developed for NEAMS Griffin code. iFOA award with X-Energy: Develop independent Monte Carlo model of Xe-100 design. Independent design confirmatory analysis of Xe-100 design using NEAMS tools Griffin and Pronghorn. Support X-Energy design team to use their own legacy design tools (VSOP99 and MGT). Support NEAMS Griffin and Pronghorn development team for the iFOA needs (received $50K additional funding for required development).

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

miniVite: A Graph Analytics Benchmarking Tool for Massively Parallel Systems

Benchmarking of high performance computing sys-tems can help provide critical insights for ef?cient design of computing systems and software applications. Although a large number of tools for benchmarking exist, there is a lack of rep-resentative benchmarks for the class of irregular computations as exempli?ed by graph analytics. In this paper, we propose miniVite as a representative graph analytics benchmark tool to test a variety of distributed-memory systems. Graph clustering, popularly known as community detection, is a prototypical graph operation used in numerous scienti?c computing and analytics applications. The goal of clustering is to partition a graph into clusters (or communities) such that each cluster consists of vertices that are densely connected within the cluster and sparsely connected to the rest of the graph. Modu-larity optimization is a popular technique for identifying clusters in a graph. Ef?cient parallelization of modularity optimization-based algorithms is challenging. One successful approach was conceived in Vite, a distributed-memory implementation of the Louvain algorithm that incorporates several heuristics. We introduce miniVite as a representative but simpli?ed variant of Vite, to serve as a prototypical graph analytics benchmarking tool. Unlike other graph-based methods such as breadth-?rst search and betweenness centrality, miniVite represents highly complex computational patterns stressing a variety of system features, which can provide crucial insight for co-design of future computing systems.

community detection, parallel, MPI↗

CALiPER Application Summary Report 22: LED MR16 Lamps

An initial sample of 27 LED MR16 lamps and 8 halogen benchmarks underwent photometric testing according to IES LM-79-08. CALiPER Application Summary Report 22 focuses on the initial performance based on light output, efficacy, distribution, color quality, electrical characteristics, and form factor, with comparisons to the benchmarks and ENERGY STAR qualification thresholds.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A High-Fidelity Model of the Peach Bottom 2 Turbine-Trip Benchmark Using VERA

This work presents a high-fidelity simulation of the Peach Bottom turbine trip (PBTT) benchmark using the Virtual Environment for Reactor Applications (VERA), a multiphysics reactor modeling tool developed by the U.S. Department of Energy’s Consortium for Advanced Simulation of Light Water Reactors energy innovation hub. The PBTT benchmark, based on a 1977 transient event at the end of cycle 2 in a General Electric Type-4 boiling water reactor (BWR), is a critical test case for validating core physics models with thermal feedback during rapid reactivity events. VERA was employed to perform end-to-end, pin-resolved simulations from conditions at the beginning of cycle 1 through the turbine-trip transient, incorporating detailed neutron transport, fuel depletion, and subchannel thermal hydraulics. The simulation reproduced key benchmark observables with high accuracy: the peak power excursion occurred at 0.75 s, matching the scram time and closely aligning with the benchmark average of 0.742 s; the simulated maximum power spike was approximately 7600 MW, which is within 3% of the benchmark average of 7400 MW; and void-collapse dynamics were consistent with benchmark expectations. Reactivity predictions during cycles 1 and 2 remained within 1500 pcm and 400 pcm of criticality, respectively. These results confirm VERA’s ability to model complex coupled neutronic and thermal hydraulic behavior in a BWR turbine-trip transient, which will support its use in future studies of modeling dryout, fuel performance, and uncertainty quantification for transients of this type.

BWR↗

Translating an AI application from Lisp to Ada: A case study

A set of benchmarks was developed to test the performance of a newly designed computer executing both Lisp and Ada. Among these was AutoClassII -- a large Artificial Intelligence (AI) application written in Common Lisp. The extraction of a representative subset of this complex application was aided by a Lisp Code Analyzer (LCA). The LCA enabled rapid analysis of the code, putting it in a concise and functionally readable form. An equivalent benchmark was created in Ada through manual translation of the Lisp version. A comparison of the execution results of both programs across a variety of compiler-machine combinations indicate that line-by-line translation coupled with analysis of the initial code can produce relatively efficient and reusable target code.

Davis, Gloria J.↗

Benchmarking impact hydrocodes in the strength regime: Implications for modeling deflection by a kinetic impactor

The Double Asteroid Redirection Test (DART) is a NASA-sponsored mission that will be the first direct test of the kinetic impactor technique for planetary defense. Here, the DART spacecraft will impact into Didymos-B, the moon of the binary system 65803 Didymos and the resulting period change will be measured from Earth. Impact simulations will be used to predict the crater size and momentum enhancement expected from the DART impact. Because the specific material properties (strength, porosity, internal structure) of the Didymos-B target are unknown, a wide variety of numerical simulations must be performed to better understand possible impact outcomes. This simulation campaign will involve a large parameter space being simulated using multiple different shock physics hydrocodes. In order to understand better the behaviors and properties of numerical simulation codes applicable to the DART impact, a benchmarking and validation program using different numerical codes to solve a set of standard problems was designed and implemented.

79 ASTRONOMY AND ASTROPHYSICS↗

Implementation and Optimization of miniGMG - a Compact Geometric Multigrid Benchmark

Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems used in a number of different application areas. In this report, we describe miniGMG, our compact geometric multigrid benchmark designed to proxy the multigrid solves found in AMR applications. We explore optimization techniques for geometric multigrid on existing and emerging multicore systems including the Opteron-based Cray XE6, Intel Sandy Bridge and Nehalem-based Infiniband clusters, as well as manycore-based architectures including NVIDIA's Fermi and Kepler GPUs and Intel's Knights Corner (KNC) co-processor. This report examines a variety of novel techniques including communication-aggregation, threaded wavefront-based DRAM communication-avoiding, dynamic threading decisions, SIMDization, and fusion of operators. We quantify performance through each phase of the V-cycle for both single-node and distributed-memory experiments and provide detailed analysis for each class of optimization. Results show our optimizations yield significant speedups across a variety of subdomain sizes while simultaneously demonstrating the potential of multi- and manycore processors to dramatically accelerate single-node performance. However, our analysis also indicates that improvements in networks and communication will be essential to reap the potential of manycore processors in large-scale multigrid calculations.

97 MATHEMATICS AND COMPUTING↗

GlideinBenchmark: collecting resource information to optimize provisioning

Choosing the right resource can speedup jobs completion, better utilize the available hardware and visibly reduce costs, especially when renting computers on the cloud. This was demonstrated in earlier studies on HEPCloud. But the benchmarking of the resources proved to be a laborious and time-consuming process. This paper presents GlideinBenchmark, a new Web application leveraging the pilot infrastructure of GlideinWMS to benchmark resources, and shows how to use the data collected and published by GlideinBenchmark to automate the optimal selection of resources. An experiment can select the benchmark or the set of benchmarks that most closely evaluate the performance of its workflows. With GlideinBenchmark and the help of the GldieinWMS Factory it controls the benchmark execution. Finally, a scheduler like HEPCloud’s Decision Engine can use the results to optimize resource provisioning.

Mambelli, Marco↗

GlideinBenchmark: collecting resource information to optimize provisioning

Choosing the right resource can speed up job completion, better utilize the available hardware, and visibly reduce costs, especially when renting computers in the cloud. This was demonstrated in earlier studies on HEPCloud. However, the benchmarking of the resources proved to be a laborious and time-consuming process. This paper presents GlideinBenchmark, a new Web application leveraging the pilot infrastructure of GlideinWMS to benchmark resources, and it shows how to use the data collected and published by GlideinBenchmark to automate the optimal selection of resources. An experiment can select the benchmark or the set of benchmarks that most closely evaluate the performance of its workflows. GlideinBenchmark, with the help of the GlideinWMS Factory, controls the benchmark execution. Finally, a scheduler like HEPCloud's Decision Engine can use the results to optimize resource provisioning.

Mambelli, Marco [Fermilab] (ORCID:0000000294892681↗

Fast multipurpose Monte Carlo simulation for proton therapy using multi- and many-core CPU architectures

Purpose: Accuracy in proton therapy treatment planning can be improved using Monte Carlo (MC) simulations. However the long computation time of such methods hinders their use in clinical routine. This work aims to develop a fast multipurpose Monte Carlo simulation tool for proton therapy using massively parallel central processing unit (CPU) architectures. Methods: A new Monte Carlo, called MCsquare (many-core Monte Carlo), has been designed and optimized for the last generation of Intel Xeon processors and Intel Xeon Phi coprocessors. These massively parallel architectures offer the flexibility and the computational power suitable to MC methods. The class-II condensed history algorithm of MCsquare provides a fast and yet accurate method of simulating heavy charged particles such as protons, deuterons, and alphas inside voxelized geometries. Hard ionizations, with energy losses above a user-specified threshold, are simulated individually while soft events are regrouped in a multiple scattering theory. Elastic and inelastic nuclear interactions are sampled from ICRU 63 differential cross sections, thereby allowing for the computation of prompt gamma emission profiles. MCsquare has been benchmarked with the GATE/GEANT4 Monte Carlo application for homogeneous and heterogeneous geometries. Results: Comparisons with GATE/GEANT4 for various geometries show deviations within 2%–1 mm. In spite of the limited memory bandwidth of the coprocessor simulation time is below 25 s for 10{sup 7} primary 200 MeV protons in average soft tissues using all Xeon Phi and CPU resources embedded in a single desktop unit. Conclusions: MCsquare exploits the flexibility of CPU architectures to provide a multipurpose MC simulation tool. Optimized code enables the use of accurate MC calculation within a reasonable computation time, adequate for clinical practice. MCsquare also simulates prompt gamma emission and can thus be used also for in vivo range verification.

60 APPLIED LIFE SCIENCES↗

Fast reactor 3D core and burnup analysis using VESTA

Burnup analyses using the VESTA code have been performed on a MOX-fuelled fast reactor model as specified by an IAEA computational benchmark. VESTA is a relatively new code that has been used for burnup credit calculations and thermal reactor models, but not typically for fast reactor applications. The detailed input and results of the IAEA benchmark provides an opportunity to gauge the use of VESTA in a fast reactor application. VESTA employs an ultra-fine multi-group binning approach that accelerates Monte Carlo burnup calculations. Using VESTA to compute the end of cycle (EOC) power fractions by enrichment zone showed agreement with the published values within 5%. When comparing the ultra-fine multi-group binning approach to the tally-based approach, EOC isotopic masses also agree within 5%. Using the ultra-fine multi-group binning approach, we obtain a wall-time speedup factor of 35 when compared to the tally-based approach for computing a k{sub eff} eigenvalue with burnup problem. The authors conclude the use of VESTA's ultra-fine multi-group binning approach with Monte Carlo transport performs accurate depletion calculations for this fast reactor benchmark. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Benchmark Suite for Evaluating Scientific AI Workloads on GPUs

AI applications have been steadily increasing in the allocation portfolio among leadership computing facilities. These applications depend on deep learning frameworks with hardware acceleration and underlying software systems. With the rapid development of applications, software stacks, and hardware devices, it is essential to evaluate the performance of core operations in AI workloads for direction of optimizations and procurement of next-generation high-performance computing (HPC) infrastructures. Currently, most benchmarks lack scientific AI workloads. So, we present DeepKernelBench and the experimental results of evaluating the benchmark suite for early observations and performance comparisons on datacenter GPUs using representative workloads for scientific AI, including Attentions, General matrix multiplications, Geometrics and Fourier neural operations.

Jin, Zheming [Advanced Micro Devices (AMD)]↗

Tensor-decomposition techniques for ab initio nuclear structure calculations: From chiral nuclear potentials to ground-state energies

The computational resources needed to generate the ab initio solution of the nuclear many-body problem for increasing mass number and/or accuracy necessitates innovative developments to improve upon (i) the storage of many-body operators and (ii) the scaling of many-body methods used to evaluate nuclear observables. The storing and efficient handling of many-body operators with high particle ranks is currently one of the major bottlenecks limiting the applicability range of ab initio studies with respect to mass number and accuracy. Recently, the application of tensor decomposition techniques to many-body tensors has proven highly beneficial to reduce the computational cost of ab initio calculations in quantum chemistry and solid-state physics. The impact of applying state-of-the-art tensor factorization techniques to modern nuclear Hamiltonians derived from chiral effective field theory is investigated. Subsequently, the error induced by the tensor decomposition of the input Hamiltonian on ground-state energies of closed-shell nuclei calculated via second-order many-body perturbation theory is benchmarked. The first proof-of-principles application of tensor-decomposition techniques to the nuclear Hamiltonian is performed. Two different tensor formats are investigated by systematically benchmarking the approximation error on matrix elements stored in various bases of interest. The analysis is achieved while including normal-ordered three-nucleon interactions that are nowadays used as input to the most advanced ab initio calculations in medium-mass nuclei. With the aid of the factorized Hamiltonian, the second-order perturbative correction to ground-state energies is decomposed and the scaling properties of the underlying tensor network are discussed. The employed tensor formats are found to lead to an efficient data compression of two-body matrix elements of the nuclear Hamiltonian. In particular, the sophisticated tensor hypercontraction scheme yields low tensor ranks with respect to both harmonic-oscillator and Hartree-Fock single-particle bases. It is found that the tensor rank depends on the two-body total angular momentum J for which one performs the decomposition, which is itself directly related to the sparsity of the corresponding tensor. Furthermore, including normal-ordered two-body contributions originating from three-body interactions does not compromise the efficient data compression. Ultimately, the use of factorized matrix elements authorizes controlled approximations of the exact second-order ground-state energy corrections. In particular, a small enough error is obtained from low-rank factorizations in He4,O16, and Ca40. It is presently demonstrated that tensor-decomposition techniques can be efficiently applied to systematically approximate the nuclear many-body Hamiltonian in terms of lower-rank tensors. Beyond the input Hamiltonian, tensor-decomposition techniques can be envisioned to scale down the cost of state-of-the-art nonperturbative many-body methods in order to extend ab initio studies to (i) higher precisions, (ii) larger masses, and (iii) nuclei of doubly open-shell character.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Defect Engineering of Chalcogen-Tailored Oxygen Electrocatalysts for Rechargeable Quasi-Solid-State Zinc-Air Batteries

A critical bottleneck limiting the performance of rechargeable zinc-air batteries lies in the inefficient bifunctional electrocatalysts for the oxygen reduction and evolution reactions at the air electrodes. Hybridizing transition-metal oxides with functional graphene materials has shown great advantages due to their catalytic synergism. However, both the mediocre catalytic activity of metal oxides and the restricted 2D mass/charge transfer of graphene render these hybrid catalysts inefficient. Here, an effective strategy combining anion substitution, defect engineering, and the dopant effect to address the above two critical issues is shown. This strategy is demonstrated on a hybrid catalyst consisting of sulfur-deficient cobalt oxysulfide single crystals and nitrogen-doped graphene nanomeshes (CoO 0.87 S 0.13 /GN). The defect chemistries of both oxygen-vacancy-rich, nonstoichiometric cobalt oxysulfides and edge-nitrogen-rich graphene nanomeshes lead to a remarkable improvement in electrocatalytic performance, where CoO 0.87 S 0.13 /GN exhibits strongly comparable catalytic activity to and much better stability than the best-known benchmark noble-metal catalysts. In application to quasi-solid-state zinc-air batteries, CoO 0.87 S 0.13 /GN as a freestanding catalyst assembly benefits from both structural integrity and enhanced charge transfer to achieve efficient and very stable cycling operation over 300 cycles with a low discharge-charge voltage gap of 0.77 V at 20 mA cm(-2) under ambient conditions.

bifunctional electrocatalysts↗

Instruction Roofline: An insightful visual performance model for GPUs

The Roofline performance model provides an intuitive approach to identify performance bottlenecks and guide performance optimization. However, the classic FLOP-centric approach is inappropriate for the emerging applications that perform more integer operations than floating point operations. In this article, we reintroduce our Instruction Roofline Model on NVIDIA GPUs and expand our evaluation of it. The Instruction Roofline incorporates instructions and memory transactions across all memory hierarchies together, and provides more performance insights than the FLOP-oriented Roofline Model, that is, instruction throughput, stride memory access patterns, bank conflicts, and thread predication. We use our Instruction Roofline methodology to analyze eight proxy applications: HPGMG from AMReX, Matrix Transpose benchmarks, ADEPT from MetaHipMer's sequence alignment phase, EXTENSION from MetaHipMer's local assembly phase, CUSP, cuSPARSE, cudaTensorCoreGemm, and cuBLAS. We demonstrate the ability of our methodology to understand various aspects of performance and performance bottlenecks on NVIDIA GPUs and motivate code optimizations.

Ding, N↗

Panda: A Compiler Framework for Concurrent CPU $+$ GPU Execution of 3D Stencil Computations on GPU-accelerated Supercomputers

We present a new compiler framework for truly heterogeneous 3D stencil computation on GPU clusters. Our framework consists of a simple directive-based programming model and a tightly integrated source-to-source compiler. Annotated with a small number of directives, sequential stencil C codes can be automatically parallelized for large-scale GPU clusters. The most distinctive feature of the compiler is its capability to generate hybrid MPI$+$ CUDA$+$ OpenMP code that uses concurrent CPU$+$ GPU computing to unleash the full potential of powerful GPU clusters. The auto-generated hybrid codes hide the overhead of various data motion by overlapping them with computation. Test results on the Titan supercomputer and the Wilkes cluster show that auto-translated codes can achieve about 90 % of the performance of highly optimized handwritten codes, for both a simple stencil benchmark and a real-world application in cardiac modeling. The user-friendliness and performance of our domain-specific compiler framework allow harnessing the full power of GPU-accelerated supercomputing without painstaking coding effort.

97 MATHEMATICS AND COMPUTING↗