Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “code optimization”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer

We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer. In this regression algorithm, we concatenate the independent and dependent variables as a combined vector, and encode the high-order correlations between them into a dictionary optimized for sparse reconstruction. On a test dataset, the dependent variable is initialized to its average value and then a sparse reconstruction of the combined vector is obtained in which the dependent variable is typically shifted closer to its true value, as in a standard inpainting or denoising task. Here, a quantum annealer, which can presumably exploit a fully entangled initial state to better explore the complex energy landscape, is used to solve the highly non-convex sparse coding optimization problem. The regression algorithm is demonstrated for a lattice quantum chromodynamics simulation data using a D-Wave 2000Q quantum annealer and good prediction performance is achieved. The regression test is performed using six different values for the number of fully connected logical qubits, between 20 and 64. The scaling results indicate that a larger number of qubits gives better prediction accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗
DOE OSTI2019

Hierarchical Roofline analysis for GPUs: Accelerating performance optimization for the NERSC‐9 Perlmutter system

Summary The Roofline performance model provides an intuitive and insightful approach to identifying performance bottlenecks and guiding performance optimization. In preparation for the next‐generation supercomputer Perlmutter at NERSC, this paper presents a methodology to construct a hierarchical Roofline on NVIDIA GPUs and extends it to support reduced precision and Tensor Cores. The hierarchical Roofline incorporates L1, L2, device memory, and system memory bandwidths into one single figure, and it offers more profound insights into performance analysis than the traditional DRAM‐only Roofline. We use our Roofline methodology to analyze three proxy applications: GPP from BerkeleyGW, HPGMG from AMReX, and conv2d from TensorFlow. In doing so, we demonstrate the ability of our methodology to readily understand various aspects of performance and performance bottlenecks on NVIDIA GPUs and motivate code optimizations.

Yang, Charlene↗
DOE OSTI2024

Integrating quantum computing resources into scientific HPC ecosystems

Quantum Computing (QC) offers significant potential to enhance scientific discovery in fields such as quantum chemistry, optimization, and artificial intelligence. Yet QC faces challenges due to the noisy intermediate-scale quantum era’s inherent external noise issues. Here, this paper discusses the integration of QC as a computational accelerator within classical scientific high-performance computing (HPC) systems. By leveraging a broad spectrum of simulators and hardware technologies, we propose a hardware-agnostic framework for augmenting classical HPC with QC capabilities. Drawing on the HPC expertise of the Oak Ridge National Laboratory (ORNL) and the HPC lifecycle management of the Department of Energy (DOE), our approach focuses on the strategic incorporation of QC capabilities and acceleration into existing scientific HPC workflows. This includes detailed analyses, benchmarks, and code optimization driven by the needs of the DOE and ORNL missions. Our comprehensive framework integrates hardware, software, workflows, and user interfaces to foster a synergistic environment for quantum and classical computing research. This paper outlines plans to unlock new computational possibilities, driving forward scientific inquiry and innovation in a wide array of research domains.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

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↗
DOE OSTI2017

Nonlinear Force-free Coronal Magnetic Stereoscopy

Insights into the 3D structure of the solar coronal magnetic field have been obtained in the past by two completely different approaches. The first approach are nonlinear force-free field (NLFFF) extrapolations, which use photospheric vector magnetograms as boundary condition. The second approach uses stereoscopy of coronal magnetic loops observed in EUV coronal images from different vantage points. Both approaches have their strengths and weaknesses. Extrapolation methods are sensitive to noise and inconsistencies in the boundary data, and the accuracy of stereoscopy is affected by the ability of identifying the same structure in different images and by the separation angle between the view directions. As a consequence, for the same observational data, the 3D coronal magnetic fields computed with the two methods do not necessarily coincide. In an earlier work (Paper I) we extended our NLFFF optimization code by including stereoscopic constrains. The method was successfully tested with synthetic data, and within this work, we apply the newly developed code to a combined data set from SDO /HMI, SDO /AIA, and the two STEREO spacecraft. The extended method (called S-NLFFF) contains an additional term that monitors and minimizes the angle between the local magnetic field direction and the orientation of the 3D coronal loops reconstructed by stereoscopy. We find that when we prescribe the shape of the 3D stereoscopically reconstructed loops, the S-NLFFF method leads to a much better agreement between the modeled field and the stereoscopically reconstructed loops. We also find an appreciable decrease by a factor of two in the angle between the current and the magnetic field. This indicates the improved quality of the force-free solution obtained by S-NLFFF.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2012

MODELING MAGNETIC FIELD STRUCTURE OF A SOLAR ACTIVE REGION CORONA USING NONLINEAR FORCE-FREE FIELDS IN SPHERICAL GEOMETRY

We test a nonlinear force-free field (NLFFF) optimization code in spherical geometry using an analytical solution from Low and Lou. Several tests are run, ranging from idealized cases where exact vector field data are provided on all boundaries, to cases where noisy vector data are provided on only the lower boundary (approximating the solar problem). Analytical tests also show that the NLFFF code in the spherical geometry performs better than that in the Cartesian one when the field of view of the bottom boundary is large, say, 20 Degree-Sign Multiplication-Sign 20 Degree-Sign . Additionally, we apply the NLFFF model to an active region observed by the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory (SDO) both before and after an M8.7 flare. For each observation time, we initialize the models using potential field source surface (PFSS) extrapolations based on either a synoptic chart or a flux-dispersal model, and compare the resulting NLFFF models. The results show that NLFFF extrapolations using the flux-dispersal model as the boundary condition have slightly lower, therefore better, force-free, and divergence-free metrics, and contain larger free magnetic energy. By comparing the extrapolated magnetic field lines with the extreme ultraviolet (EUV) observations by the Atmospheric Imaging Assembly on board SDO, we find that the NLFFF performs better than the PFSS not only for the core field of the flare productive region, but also for large EUV loops higher than 50 Mm.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code

Highly optimized programs are prone to bit rot, where performance quickly becomes suboptimal in the face of new hardware and compiler techniques. In this paper we show how to automatically lift performance-critical stencil kernels from a stripped x86 binary and generate the corresponding code in the high-level domain-specific language Halide. Using Halide's state-of-the-art optimizations targeting current hardware, we show that new optimized versions of these kernels can replace the originals to rejuvenate the application for newer hardware. The original optimized code for kernels in stripped binaries is nearly impossible to analyze statically. Instead, we rely on dynamic traces to regenerate the kernels. We perform buffer structure reconstruction to identify input, intermediate and output buffer shapes. Here, we abstract from a forest of concrete dependency trees which contain absolute memory addresses to symbolic trees suitable for high-level code generation. This is done by canonicalizing trees, clustering them based on structure, inferring higher-dimensional buffer accesses and finally by solving a set of linear equations based on buffer accesses to lift them up to simple, high-level expressions. Helium can handle highly optimized, complex stencil kernels with input-dependent conditionals. We lift seven kernels from Adobe Photoshop giving a 75 % performance improvement, four kernels from Irfan View, leading to 4.97 x performance, and one stencil from the mini GMG multigrid benchmark netting a 4.25 x improvement in performance. We manually rejuvenated Photoshop by replacing eleven of Photoshop's filters with our lifted implementations, giving 1.12 x speedup without affecting the user experience.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An efficient, partitioned ensemble algorithm for simulating ensembles of evolutionary MHD flows at low magnetic Reynolds number

Studying the propagation of uncertainties in a nonlinear dynamical system usually involves generating a set of samples in the stochastic parameter space and then repeated simulations with different sampled parameters. The main difficulty faced in the process is the excessive computational cost. In this paper, we present an efficient, partitioned ensemble algorithm to determine multiple realizations of a reduced Magnetohydrodynamics (MHD) system, which models MHD flows at low magnetic Reynolds number. The algorithm decouples the fully coupled problem into two smaller subphysics problems, which reduces the size of the linear systems that to be solved and allows the use of optimized codes for each subphysics problem. Moreover, the resulting coefficient matrices are the same for all realizations at each time step, which allows faster computation of all realizations and significant savings in computational cost. We prove this algorithm is first order accurate and long time stable under a time step condition. Numerical examples are provided to verify the theoretical results and demonstrate the efficiency of the algorithm.

Jiang, Nan↗
DOE OSTI2017

Experiences Evaluating Functionality and Performance of IBM POWER8+ Systems

In preparation for Summit, Oak Ridge National Laboratory’s next generation supercomputer, two IBM Power-based systems were deployed in late 2016 at the Oak Ridge Leadership Computing Facility (OLCF). This paper presents a detailed description of the acceptance of the first IBM Power-based early access systems installed at the OLCF. The two systems, Summitdev and Tundra, contain IBM POWER8+ processors with NVIDIA Pascal GPUs and were acquired to provide researchers with a platform to optimize codes for the Power architecture. In addition, this paper presents early functional and performance results obtained on Summitdev with the latest software stack available.

Vergara Larrea, Veronica G.↗
DOE OSTI2019

Finite element analyses of single particle crushing tests incorporating computed tomography imaging and damage mechanics

Fracture of individual grains within a granular assembly affect the strength and deformation behavior of granular materials under large stress states. Interparticle forces, leading to contact stresses and ultimately fracture initiation, are influenced by particle morphology. A numerical method that incorporates both particle fracture and morphology can provide a more accurate model of a granular material’s macro-scale response. This research investigates an approach to modeling fracture initiation and propagation within individual grains, utilizing high resolution X-ray computed tomography (CT) imaging to consider grain morphology and an explicit finite element code optimized for high performance computing which incorporates damage mechanics. Using precisely measured force-displacement curves from single particle crushing tests of manufactured quartz spheres, the method is validated, and the effects of fracture properties on grain fragmentation are determined. This approach is then used to simulate single particle crushing of Ottawa sand, with grain morphology incorporated through discretized CT images. Here the effect of grain orientation on the force and applied displacement at catastrophic splitting is also explored. The proposed discrete particle based finite element framework can be applied to modeling granular assemblies, considering the effect of individual particle shape and fracture on the assembly’s deformation response through well calibrated numerical simulations.

42 ENGINEERING↗
DOE OSTI2016

Direction Modulated Brachytherapy for Treatment of Cervical Cancer. II: Comparative Planning Study With Intracavitary and Intracavitary–Interstitial Techniques

Purpose: To perform a comprehensive comparative planning study evaluating the utility of the proposed direction modulated brachytherapy (DMBT) tandem applicator against standard applicators, in the setting of image guided adaptive brachytherapy of cervical cancer. Methods and Materials: A detailed conceptual article was published in 2014. The proposed DMBT tandem applicator has 6 peripheral grooves of 1.3-mm width, along a 5.4-mm-thick nonmagnetic tungsten alloy rod of density 18.0 g/cm{sup 3}, capable of generating directional dose profiles. We performed a comparative planning study with 45 cervical cancer patients enrolled consecutively in the prospective observational EMBRACE study. In all patients, MRI-based planning was performed while utilizing various tandem-ring (27 patients) and tandem-ring-needles (18 patients) applicators, in accordance with the Groupe Européen de Curiethérapie–European Society for Radiotherapy and Oncology recommendations. For unbiased comparisons, all cases were replanned with an in-house–developed inverse optimization code while enforcing a uniform set of constraints that are reflective of the clinical practice. All plans were normalized to the same high-risk clinical target volume D90 values achieved in the original clinical plans. Results: In general, if the standard tandem was replaced with the DMBT tandem while maintaining all other planning conditions the same, there was consistent improvement in the plan quality. For example, among the 18 tandem-ring-needles cases, the average D2cm{sup 3} reductions achieved were −2.48% ± 11.03%, −4.45% ± 5.24%, and −5.66% ± 6.43% for the bladder, rectum, and sigmoid, respectively. An opportunity may also exist in avoiding use of needles altogether for when the total number of needles required is small (approximately 2 to 3 needles or less), if DMBT tandem is used. Conclusions: Integrating the novel DMBT tandem onto both intracavitary and intracavitary–interstitial applicator assembly enabled consistent improvement in the sparing of the OARs, over a standard “single-channel” tandem, though individual variations in benefit were considerable. Although at an early stage of development, the DMBT concept design is demonstrated to be useful and pragmatic for potential clinical translation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2019

Parallel accelerated Custom Correlation Coefficient calculations for genomics applications

The massive quantities of genomic data being made available through gene sequencing techniques are enabling breakthroughs in genomic science in many areas such as medical advances in the diagnosis and treatment of diseases. Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity—leading to the need for leadership scale computing. In this paper we describe a new approach to calculations of the Custom Correlation Coefficient (CCC) between Single Nucleotide Polymorphisms (SNPs) across a population, suitable for parallel systems equipped with graphics processing units (GPUs) or Intel Xeon Phi processors. We describe the mapping of the algorithms to accelerated processors, techniques used for eliminating redundant calculations due to symmetries, and strategies for efficient mapping of the calculations to many-node parallel systems. Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion (9 × 10 15 ) elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being orders of magnitude faster than rates achieved using other codes and platforms as reported in the literature. Also it is estimated that as many as 90 quadrillion (90 × 10 15 ) comparisons per second may be achievable on the upcoming ORNL Summit system, an additional 10X performance increase. Finally, in a companion paper we describe corresponding techniques applied to calculations of the Proportional Similarity metric for comparative genomics applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs

For over a decade now, physical and energy constraints have limited clock speed improvements in commodity microprocessors. Instead, chipmakers have been pushed into producing lower-power, multi-core processors such as Graphical Processing Units (GPU), ARM CPUs, and Intel MICs. Broad-based efforts from manufacturers and developers have been devoted to making these processors user-friendly enough to perform general computations. However, extracting performance from a larger number of cores, as well as specialized vector or SIMD units, requires special care in algorithm design and code optimization. One of the most computationally challenging problems in high-energy particle experiments is finding and fitting the charged-particle tracks during event reconstruction. This is expected to become by far the dominant problem at the High-Luminosity Large Hadron Collider (HL-LHC), for example. Today the most common track finding methods are those based on the Kalman filter. Experience with Kalman techniques on real tracking detector systems has shown that they are robust and provide high physics performance. This is why they are currently in use at the LHC, both in the trigger and offine. Previously we reported on the significant parallel speedups that resulted from our investigations to adapt Kalman filters to track fitting and track building on Intel Xeon and Xeon Phi. Here, we discuss our progresses toward the understanding of these processors and the new developments to port the Kalman filter to NVIDIA GPUs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2017

Cosmological neutrino simulations at extreme scale

Constraining neutrino mass remains an elusive challenge in modern physics. Precision measurements are expected from several upcoming cosmological probes of large-scale structure. Achieving this goal relies on an equal level of precision from theoretical predictions of neutrino clustering. Numerical simulations of the non-linear evolution of cold dark matter and neutrinos play a pivotal role in this process. We incorporate neutrinos into the cosmological N-body code CUBEP3M and discuss the challenges associated with pushing to the extreme scales demanded by the neutrino problem. We highlight code optimizations made to exploit modern high performance computing architectures and present a novel method of data compression that reduces the phase-space particle footprint from 24 bytes in single precision to roughly 9 bytes. We scale the neutrino problem to the Tianhe-2 supercomputer and provide details of our production run, named TianNu, which uses 86% of the machine (13,824 compute nodes). With a total of 2.97 trillion particles, TianNu is currently the world’s largest cosmological N-body simulation and improves upon previous neutrino simulations by two orders of magnitude in scale. We finish with a discussion of the unanticipated computational challenges that were encountered during the TianNu runtime.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Evaluating CUDA Portability with HIPCL and DPCT

HIPCL is expanding the scope of the CUDA portability route from an AMD platform to an OpenCL platform. In the meantime, the Intel DPC++ Compatibility Tool (DPCT) is migrating a CUDA program to a data parallel C++ (DPC++) program. Towards the goal of portability enhancement, we evaluate the performance of the CUDA applications from Rodinia, SHOC, and proxy applications ported using HIPCL and DPCT on Intel GPUs. After profiling the ported programs, we aim to understand their performance gaps, and optimize codes converted by DPCT to improve their performance. The open-source repository for the CUDA, HIP, and DPCT programs will be useful for the development of a translator.

Jin, Zheming↗
DOE OSTI2024

Field Harmonic Measurement of High-Gradient Permanent Magnet Quadrupoles for NSLS- II Upgrade

The National Synchrotron Light Source II (NSLS-II) is preparing for a major upgrade based on a new lattice concept, known as “Complex Bend,” to replace its existing double bend achromat (DBA) lattice. Here, this novel lattice will use high-gradient permanent magnet quadrupoles (PMQs) with small apertures in the range of 16–22 mm. A prototype complex bend branch with PMQs has been installed in the NSLS-II linac to evaluate the lattice's performance. An accurate and precise magnetic measurement system is required for field harmonic characterization and magnetic tuning of these PMQs. As part of this project a Rotating-Coil bench, based on a Printed Circuit Board (PCB) coil with a 12 mm diameter, has been configured to measure nine PMQs with bore diameter of 12.7 mm. This PCB coil has an active length of 270 mm, and is able to measure fields up to the 15th harmonic of the main field at a reference radius of 5 mm, while maintaining field quality levels within 10 ppm of the main field. This article presents the PCB coil setup, the harmonic measurement results and their temperature dependencies and repeatability. Simulation results on compensation of undesired multipoles using “IDBuilder”, a genetic algorithm-based optimizer code for magnetic tuning is included for field harmonic corrections.

36 MATERIALS SCIENCE↗
DOE OSTI2013

Rapid Reflective Facet Characterization Using Fringe Reflection Techniques

Reflective mirror facets for concentrating solar power (CSP) systems have stringent requirements on the surface slope accuracy in order to provide adequate system performance. This paper presents a tool that can fully characterize facets quickly enough for 100% inspection on a production line. A facet for a CSP system, specifically a dish concentrator has a parabolic design shape. This shape will concentrate near-parallel rays from the sun to a point (or a line for trough systems). Deviations of surface slope from the design shape impact the performance of the system, either losing power that misses the target or increasing peak fluxes to undesirable levels. During development or production, accurate knowledge of facet defects can lead to improvements to lower cost or improve performance. The reported characterization system, SOFAST (Sandia Optical Fringe Analysis Slope Tool), has a computer-connected camera that images the reflective surface, which is positioned so that it reflects an active target, such as an LCD screen, to the camera. A series of fringe patterns are displayed on the screen while images are captured. Using the captured information, the reflected target location of each pixel of mirror viewed can be determined, and thus through a mathematical transformation, a surface normal map can be developed. This is then fitted to the selected model equation, and the errors from design are characterized. While similar approaches have been explored, several key developments are presented here. The combination of the display, capture, and data reduction in one system allows rapid characterization. An “electronic boresight” approach is utilized to accommodate physical equipment positioning deviations, making the system insensitive to setup errors. Up to 1.5×10 6 points are characterized on each facet. Finally, while prior automotive industry commercial systems resolve the data to shape determination, SOFAST concentrates on slope characterization and reporting, which is tailored to solar applications. SOFAST can be used for facet analysis during development. However, the real payoff is in production, where complete analysis is performed in about 10s. With optimized coding, this could be further reduced.

14 SOLAR ENERGY↗