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 1,405 records · Page 78

Parametric study and optimization trends for the Von-Kármán-sodium dynamo experiment

In this paper, we present magneto-hydrodynamic simulations of liquid sodium flow performed with the PLUTO compressible MHD code. We investigated the influence of the remanent magnetic field orientation and intensity, the impinging velocity field due to Ekman pumping as well as the impeller dimensions on the magnetic field collimation by helical flows in-between the impeller blades. For a simplified Cartesian geometry, we model the flow dynamics of a multi-blade impeller inspired by the Von-Kármán-Sodium experiment. This study shows that a remanent magnetic field oriented in the toroidal direction is the less efficient configuration to collimate the magnetic field, although if the radial or vertical components are not negligible, the collimation is significantly improved. As the intensity of the remanent magnetic field increases, the system magnetic energy becomes larger, but the magnetic field collimation efficiency remains the same, so the gain of magnetic energy is smaller as the remanent magnetic field intensity increases. The magnetic field collimation is modified if the impinging velocity field changes: the collimation is weaker if the impinging velocity increases from Γ = 0.8 to 0.9 and slightly larger if the impinging velocity decreases from Γ = 0.8 to 0.7. The analysis of the impeller dimensions points out that the most efficient configuration to collimate the magnetic field requires a ratio between the impeller blade height and the base longitude between 0.375 and 0.5. The largest enhancement of the hypothetical α 2 dynamo loop, compared to the hypothetical Ω-α dynamo loop, is observed for the model that mimics the TM 73 impeller configuration rotating in the unscooping direction with a remanent magnetic field of 10 –3 T orientated in the radial or vertical direction. Finally, the optimization trends obtained in the parametric analysis are also confirmed by simulations with a higher resolution and turbulence degree.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Generate Optimized Genetic Rhythm for Enzyme Expression in Non-native systems

Most amino acids are represented by more than one codon, resulting in redundancy in the genetic code. Silent codon substitutions that do not alter the amino acid sequence still have an effect on protein expression. We have developed an algorithm, GoGREEN, to enhance the expression of foreign proteins in a host organism. GoGREEN selects codons according to frequency patterns seen in the gene of interest using the codon usage table from the host organism. GoGREEN is also designed to accommodate gaps in the sequence.This software takes for input (1) the aligned protein sequences for genes the user wishes to express, (2) the codon usage table for the host organism, (3) and the DNA sequence for the target protein found in the host organism. The program will select codons based on codon usage patterns for the target DNA sequence. The program will also select codons for “gaps” found in the aligned protein sequences using the codon usage table from the host organism.

Source record↗

Dosimetric quality, accuracy, and deliverability of modulated radiotherapy treatments for spinal metastases

Cancer often metastasizes to the vertebra, and such metastases can be treated successfully using simple, static posterior or opposed-pair radiation fields. However, in some cases, including when re-irradiation is required, spinal cord avoidance becomes necessary and more complex treatment plans must be used. This study evaluated 16 sample intensity-modulated radiation therapy (IMRT) and volumetric-modulated arc therapy (VMAT) treatment plans designed to treat 6 typical vertebral and paraspinal volumes using a standard prescription, with the aim of investigating the advantages and limitations of these treatment techniques and providing recommendations for their optimal use in vertebral treatments. Treatment plan quality and beam complexity metrics were evaluated using the Treatment And Dose Assessor (TADA) code. A portal-imaging–based quality assurance (QA) system was used to evaluate treatment delivery accuracy, and radiochromic film measurements were used to provide high-resolution verification of treatment plan dose accuracy, especially in the steep dose gradient regions between each vertebral target and spinal cord. All treatment modalities delivered approximately the same doses and the same levels of dose heterogeneity to each planning target volume (PTV), although the minimum PTV doses in the vertebral plans were substantially lower than the prescription, because of the requirement that the plans meet a strict constraint on the dose to the spinal cord and cord planning risk volume (PRV). All plans met required dose constraints on all organs at risk, and all measured PTV-cord dose gradients were steeper than planned. Beam complexity analysis suggested that the IMRT treatment plans were more deliverable (less complex, leading to greater QA success) than the VMAT treatment plans, although the IMRT plans also took more time to deliver. The accuracy and deliverability of VMAT treatment plans were found to be substantially increased by limiting the number of monitor units (MU) per beam at the optimization stage, and thereby limiting beam modulation complexity. The VMAT arcs that were optimized with MU limitation had higher QA pass rates as well as higher modulation complexity scores (less complexity), lower modulation indices (less modulation), lower MU per beam, larger beam segments, and fewer small apertures than the VMAT arcs that were optimized without MU limitation. It is recommended that VMAT treatments for vertebral volumes, where the PTV abuts or surrounds the spinal cord, should be optimized with MU limitation. IMRT treatments may be preferable to the VMAT treatments, for dosimetry and deliverability reasons, but may be inappropriate for some patients because of their increased treatment delivery time.

61 RADIATION PROTECTION AND DOSIMETRY↗

A light weight regularization for wave function parameter gradients in quantum Monte Carlo

The parameter derivative of the expectation value of the energy, ∂E/∂p, is a key ingredient in variational Monte Carlo (VMC) wave function optimization methods. In some cases, a naïve estimate of this derivative suffers from an infinite variance, which inhibits the efficiency of optimization methods that rely on a stable estimate of the derivative. In this work, we derive a simple regularization of the naïve estimator, which is trivial to implement in existing VMC codes, has finite variance, and a negligible bias, which can be extrapolated to zero bias with no extra cost. We use this estimator to construct an unbiased, finite variance estimation of ∂E/∂p for a multi-Slater–Jastrow trial wave function on the LiH molecule and in the optimization of a multi-Slater–Jastrow trial wave function on the CuO molecule. This regularized estimator is a simple and efficient estimator of ∂E/∂p for VMC optimization techniques.

36 MATERIALS SCIENCE↗

Enhancement of PyARC for Westinghouse Electric Company’s Lead Fast Reactor Design and Modeling (Final TCF Report)

Westinghouse Electric Company is a nuclear reactor vendor headquartered in the U.S. that is developing advanced reactor technology for the U.S. and global markets. Westinghouse has been relying on the neutronics Argonne Reactor Codes (ARC) executed through the NEAMS Workbench and its PyARC module that are developed under the DOE-NE Nuclear Energy Advanced Modeling and Simulation (NEAMS) and Advanced Reactor Technology (ART) – Fast Reactor programs. Through this user experience, Westinghouse identified several enhancements that would benefit the ARC codes’ usability by the US industry and therefore its commercialization potential. The enhancements were proposed to deliver both improvements in workflow and analysis capabilities to better support effective fast reactor core design and analysis to the nuclear industry. The PyARC workflow was extended in this project by integrating non-neutronic ARC codes DASSH and NUBOW-3D. The Ducted Assembly Steady-State Heat equation (DASSH) code is developed at ANL to perform steady-state thermal hydraulic sub-channel analysis in liquid metal fast reactor assemblies to determine optimized coolant flow and temperature distributions, which in this project was updated and validated for lead fast reactor (LFR) applications. The interface between REBUS and NUBOW-3D were improved in this project to assess the impact of the core restraint design and thermal induced expansion effects on the reactivity of the core, and to model the deformations of the fuel assemblies induced by temperature and irradiation. Finally, the ARC models that were extensively verified and validated through various SFR-based modeling benchmarks are extended in this project through code-to-code comparison on relevant LFR-specific neutronics benchmarks against Monte-Carlo neutronic solutions. Overall, this work enables verification of the capability of the ARC codes for a wide range of Generation-IV reactor designs. The outcome of this project is the release of a comprehensive modeling toolkit of validated, robust and efficient codes, as well as their user interface, that enables industry to perform a wide range of fast reactor analyses for design and licensing of their concepts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hierarchical computation in the SPMD programming model

Large-scale parallel machines are programmed mainly with the single program, multiple data (SPMD) model of parallelism. While this model has advantages of scalability and simplicity, it does not fit well with divide-and-conquer parallelism or hierarchical machines that mix shared and distributed memory. In this paper, we define the recursive single program, multiple data model (RSPMD) that extends SPMD with a hierarchical team mechanism to support hierarchical algorithms and machines. We implement this model in the Titanium language and describe how to eliminate a class of deadlocks by ensuring alignment of collective operations. We present application case studies evaluating the RSPMD model, showing that it enables divide-and-conquer algorithms such as sorting to be elegantly expressed and that team collective operations increase performance of conjugate gradient by up to a factor of two. The model also facilitates optimizations for hierarchical machines, improving scalability of particle in cell by 8x and performance of sorting and a stencil code by up to 40% and 14%, respectively.

Kamil, A↗

Solving a trillion unknowns per second with HPGMG on Sunway TaihuLight

Benchmarks for supercomputers are important tools, not only for evaluating and ranking modern supercomputers, but also for providing hints for future architecture design. As a new benchmark, HPGMG (high performance geometric multigrid) solves a linear equation set with a full geometric multi-grid algorithm. It involves computation on different scales, data movement with various volumes, global communication and neighbor communication with both large and small messages, etc., and is more correlated to real world applications than traditional benchmarks such as LINPACK. Therefore, it is desirable to examine how well HPGMG can perform on leadership supercomputers such as Sunway Taihulight. Sunway Taihulight, the No. 1 supercomputer in the Top 500 list from June 2016 to June 2018, which uses a specially designed many-core architecture SW26010, is of great interest to the community of high performance computing. With careful analysis and code design, we came up with an efficient implementation of HPGMG on SW26010 processors. We not only employed traditional optimization techniques such as 2.5D partitioning, double buffering, and collective data load, but also introduced a micro-benchmark to help with the choice of optimization direction and parameter tuning. Another contribution is that we proposed a new procedure for the major operations, by granulating and reordering the smooth function and the ghost exchange operation, leading to reduced memory copy and accelerated communication process. Our optimized implementation of HPGMG on Sunway TaihuLight achieved a ground-breaking performance of 1.036 × 10 12 Degrees of Freedom per second at the finest level, which is No. 1 on the HPGMG list of Nov 2017.

97 MATHEMATICS AND COMPUTING↗

Enhancing parallel quasi-static particle-in-cell simulations with a pipelining algorithm

A pipelining algorithm to overcome the limitation on scaling quasi-static particle-in-cell models of relativistic beams in plasmas to a very large number of processors is described. The pipelining algorithm uses multiple groups of processors and optimizes the job allocation on the processors in parallel computing. The algorithm is implemented on the quasi-static code QuickPIC and is shown to scale to over 10{sup 3} processors and increased the scale and speed by two orders of magnitude over the non-pipelined model. The new approach opens the door to performing full scale 3D simulations of future plasma wakefield accelerators or full lifetime models of beam interaction with electron clouds in circular accelerators such as the Large Hadron Collider (LHC) at CERN.

43 PARTICLE ACCELERATORS↗

Performance optimization, modeling and analysis of sparse matrix-matrix products on multi-core and many-core processors

Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is widely used in areas ranging from traditional numerical applications to recent big data analysis and machine learning. Although many SpGEMM algorithms have been proposed, hardware specific optimizations for multi- and many-core processors are lacking and a detailed analysis of their performance under various use cases and matrices is not available. In this work, we firstly identify and mitigate multiple bottlenecks with memory management and thread scheduling on Intel Xeon Phi (Knights Landing or KNL). Specifically targeting many-core processors, we develop a hash-table-based algorithm and optimize a heap-based shared-memory SpGEMM algorithm. We examine their performance together with other publicly available codes. Different from the literature, our evaluation also includes use cases that are representative of real graph algorithms, such as multi-source breadth-first search or triangle counting. Our hash-table and heap-based algorithms are showing significant speedups from libraries in the majority of the cases while different algorithms dominate the other scenarios with different matrix size, sparsity, compression factor and operation type. We wrap up in-depth evaluation results and make a recipe to give the best SpGEMM algorithm for target scenario. We build the performance model for hash-table and heap-based algorithms, which supports the recipe. A critical finding is that hash-table-based SpGEMM gets a significant performance boost if the nonzeros are not required to be sorted within each row of the output matrix. Finally, we integrate our implementations into a large-scale protein clustering code named HipMCL, accelerating its SpGEMM kernel by up to 10X and achieving an overall performance boost for the whole HipMCL application by 2.6X.

97 MATHEMATICS AND COMPUTING↗

Fast automated analysis of strong gravitational lenses with convolutional neural networks

Quantifying image distortions caused by strong gravitational lensing—the formation of multiple images of distant sources due to the deflection of their light by the gravity of intervening structures—and estimating the corresponding matter distribution of these structures (the ‘gravitational lens’) has primarily been performed using maximum likelihood modelling of observations. Our procedure is typically time- and resource-consuming, requiring sophisticated lensing codes, several data preparation steps, and finding the maximum likelihood model parameters in a computationally expensive process with downhill optimizers. Accurate analysis of a single gravitational lens can take up to a few weeks and requires expert knowledge of the physical processes and methods involved. Tens of thousands of new lenses are expected to be discovered with the upcoming generation of ground and space surveys. We report the use of deep convolutional neural networks to estimate lensing parameters in an extremely fast and automated way, circumventing the difficulties that are faced by maximum likelihood methods. We also show that the removal of lens light can be made fast and automated using independent component analysis of multi-filter imaging data. Our networks can recover the parameters of the ‘singular isothermal ellipsoid’ density profile, which is commonly used to model strong lensing systems, with an accuracy comparable to the uncertainties of sophisticated models but about ten million times faster: 100 systems in approximately one second on a single graphics processing unit. These networks can provide a way for non-experts to obtain estimates of lensing parameters for large samples of data.

79 ASTRONOMY AND ASTROPHYSICS↗

Modern quantum chemistry with [Open]Molcas

MOLCAS/OpenMolcas is an ab initio electronic structure program providing a large set of computational methods from Hartree–Fock and density functional theory to various implementations of multiconfigurational theory. This article provides a comprehensive overview of the main features of the code, specifically reviewing the use of the code in previously reported chemical applications as well as more recent applications including the calculation of magnetic properties from optimized density matrix renormalization group wave functions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Probabilistic flux limiters

The stable numerical integration of shocks in compressible flow simulations relies on the reduction or elimination of Gibbs phenomena (unstable, spurious oscillations). A popular method to virtually eliminate Gibbs oscillations caused by numerical discretization in under-resolved simulations is to use a flux limiter. A wide range of flux limiters have been studied in the literature, with recent interest in their optimization via machine learning methods trained on high-resolution datasets. The common use of flux limiters in numerical codes as plug-and-play blackbox components makes them key targets for design improvement. Even for deterministic dynamical models, numerical uncertainty is introduced via coarse-graining required by insufficient computational power to solve all scales of motion. Conventional flux limiters are deterministic and lack the capacity to address uncertainties, both aleatoric (inherent randomness) and epistemic (modeling uncertainty due to limited knowledge), which arise in coarse-grained numerical simulations. Here, we introduce a conceptually distinct type of flux limiter that is designed to handle the effects of randomness in the model and uncertainty in model parameters. Unlike traditional single-function flux limiters, these new probabilistic flux limiters incorporate multiple flux limiting functions, each applied with a learned probability drawn from high-resolution data to mitigate the effects of uncertainty in numerical simulations. This approach departs from traditional single-function limiters by explicitly modeling and incorporating uncertainty into the shock capturing process. Using the example of Burgers' equation as a testbed, we show that a machine learned, probabilistic flux limiter may be used in a shock capturing code to more accurately capture shock profiles. In particular, we show that our probabilistic flux limiter outperforms standard limiters and can be successively improved upon (up to a point) by expanding the set of probabilistically chosen flux limiting functions.

97 MATHEMATICS AND COMPUTING↗

Self-consistent modeling of tokamak edge plasma transport with lithium sources

Magnetic confinement fusion devices require effective heat and particle exhaust solutions on the divertor plates to operate sustainably, especially under reactor-relevant conditions. Liquid lithium divertors have been proposed to address two major challenges: control of excessive heat flux to plasma-facing components through vapor shielding and minimization of core plasma contamination from impurities. The National Spherical Torus Experiment-Upgrade (NSTX-U) will explore lithium as a divertor material due to its potential to meet both objectives. We present a self-consistent coupling framework between the plasma boundary transport code UEDGE and the lithium wall transport code Wall–Li to evaluate the feasibility and operational limits of lithium-based divertors. The model aims to optimize lithium sourcing levels to prevent core plasma contamination via fuel dilution while ensuring divertor protection through vapor shielding. This integrated framework, applicable to any tokamak with lithium sources, dynamically adjusts lithium sourcing based on local plasma conditions and surface temperature. The coupled model is tested using NSTX-like geometry and plasma conditions to assess its performance and reliability. Wall–Li calculates lithium fluxes from plasma-facing components, incorporating physical sputtering, thermally enhanced sputtering, and evaporation driven by surface temperature and ion flux. These fluxes are reintroduced into UEDGE as neutral lithium atoms, enabling simulation of their transport and distribution within the plasma. UEDGE computes plasma and neutral transport, surface heat flux, and iteratively feeds this information back to Wall–Li. A small time step is employed to ensure numerical stability and convergence, enabling accurate simulations over typical tokamak discharge durations. This integrated modeling approach provides a robust tool for identifying operational regimes that balance effective lithium sourcing with minimal core plasma contamination, offering critical insights for optimizing lithium-based divertor systems in current and future fusion devices.

Magnetic confinement fusion↗

Quantum measurements of atoms using cavity QED

Generalized quantum measurements are an important extension of projective or von Neumann measurements in that they can be used to describe any measurement that can be implemented on a quantum system. We describe how to realize two nonstandard quantum measurements using cavity QED. The first measurement optimally and unambiguously distinguishes between two nonorthogonal quantum states. The second example is a measurement that demonstrates superadditive quantum coding gain. The experimental tools used are single-atom unitary operations effected by Ramsey pulses and two-atom Tavis-Cummings interactions. We show how the superadditive quantum coding gain is affected by errors in the field-ionization detection of atoms and that even with rather high levels of experimental imperfections, a reasonable amount of superadditivity can still be seen. To date, these types of measurements have been realized only on photons. It would be of great interest to have realizations using other physical systems. This is for fundamental reasons but also since quantum coding gain in general increases with code word length, and a realization using atoms could be more easily scaled than existing realizations using photons.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-Performance Sparse Matrix-Matrix Products on Intel KNL and Multicore Architectures

Sparse matrix-matrix multiplication (SpGEMM) is a computational primitive that is vastly used in areas ranging from traditional numerical applications to recent big data analysis and machine learning. While many SpGEMM algorithms have been proposed, hardware specific optimizations for multi- and many-core processors are lacking and a detailed analysis of their performance under various use cases and matrices is not available. We firstly identify and mitigate multiple bottlenecks with memory management and thread scheduling on Intel Xeon Phi (Knights Landing or KNL). Specifically targeting multi- and many-core processors, we develop a hash-table-based algorithm and optimize a heap-based shared-memory SpGEMM algorithm. We investigate their performance together with other publicly available codes. Different from the literature, our evaluation also includes use cases that are representative of real graph algorithms, such as multi-source breadth-first search or triangle counting. Our hash-table and heap-based algorithms are showing significant speedups from libraries in the majority of the cases while different algorithms dominate the other scenarios with different matrix size, sparsity, compression factor and operation type. We wrap up in-depth evaluation results and make a recipe to give the best SpGEMM algorithm for target scenario. In conclusion, a critical finding is that hash-table-based SpGEMM gets a significant performance boost if the nonzeros are not required to be sorted within each row of the output matrix.

97 MATHEMATICS AND COMPUTING↗

PETSc/TAO developments for GPU-based early exascale systems

The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy’s Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. In conclusion, we evaluate the performance of these developments on some pre-exascale systems as well as the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.

Exascale Computing Project (ECP)↗

Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments

Sequence alignment algorithms are a key component of many bioinformatics applications. Though various fast Smith-Waterman local sequence alignment implementations have been developed for x86 CPUs, most are embedded into larger database search tools. In addition, fast implementations of Needleman-Wunsch global sequence alignment and its semi-global variants are not as widespread. This article presents the first software library for local, global, and semi-global pairwise intra-sequence alignments and improves the performance of previous intra-sequence implementations. As a result, a faster intra-sequence pairwise alignment implementation is described and benchmarked. Using a 375 residue query sequence a speed of 136 billion cell updates per second (GCUPS) was achieved on a dual Intel Xeon E5-2670 12-core processor system, the highest reported for an implementation based on Farrar’s ’striped’ approach. When using only a single thread, parasail was 1.7 times faster than Rognes’s SWIPE. For many score matrices, parasail is faster than BLAST. The software library is designed for 64 bit Linux, OS X, or Windows on processors with SSE2, SSE41, or AVX2. Source code is available from https://github.com/jeffdaily/parasail under the Battelle BSD-style license. In conclusion, applications that require optimal alignment scores could benefit from the improved performance. For the first time, SIMD global, semi-global, and local alignments are available in a stand-alone C library.

97 MATHEMATICS AND COMPUTING↗