SEARCH · Search NASA
Results for “Computational 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.
Autotuning algorithmic choice for input sensitivity
A daunting challenge faced by program performance autotuning is input sensitivity, where the best autotuned configuration may vary with different input sets. This paper presents a novel two-level input learning algorithm to tackle the challenge for an important class of autotuning problems, algorithmic autotuning. Here, the new approach uses a two-level input clustering method to automatically refine input grouping, feature selection, and classifier construction. Its design solves a series of open issues that are particularly essential to algorithmic autotuning, including the enormous optimization space, complex influence by deep input features, high cost in feature extraction, and variable accuracy of algorithmic choices. Experimental results show that the new solution yields up to a 3x speedup over using a single configuration for all inputs, and a 34x speedup over a traditional one-level method for addressing input sensitivity in program optimizations.
ParChain: a framework for parallel hierarchical agglomerative clustering using nearest-neighbor chain
This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarchical agglomerative clustering (HAC) algorithms, and using the framework we obtain novel parallel algorithms for the complete linkage, average linkage, and Ward's linkage criteria. Compared to most previous parallel HAC algorithms, which require quadratic memory, our new algorithms require only linear memory, and are scalable to large data sets. ParChain is based on our parallelization of the nearest-neighbor chain algorithm, and enables multiple clusters to be merged on every round. We introduce two key optimizations that are critical for efficiency: a range query optimization that reduces the number of distance computations required when finding nearest neighbors of clusters, and a caching optimization that stores a subset of previously computed distances, which are likely to be reused. Experimentally, we show that our highly-optimized implementations using 48 cores with two-way hyper-threading achieve 5.8--110.1x speedup over state-of-the-art parallel HAC algorithms and achieve 13.75--54.23x self-relative speedup. Compared to state-of-the-art algorithms, our algorithms require up to 237.3x less space. Our algorithms are able to scale to data set sizes with tens of millions of points, which existing algorithms are not able to handle.
Climbing the Summit and Pushing the Frontier of Mixed Precision Benchmarks at Extreme Scale
The rise of machine learning (ML) applications and their use of mixed precision to perform interesting science are driving forces behind AI for science on HPC. The convergence of ML and HPC with mixed precision offers the possibility of transformational changes in computational science. The HPL-AI benchmark is designed to measure the performance of mixed precision arithmetic as opposed to the HPL benchmark which measures double precision performance. Pushing the limits of systems at extreme scale is nontrivial -little public literature explores optimization of mixed precision computations at this scale. In this work, we demonstrate how to scale up the HPL-AI benchmark on the pre-exascale Summit and exascale Frontier systems at the Oak Ridge Leadership Computing Facility (OLCF) with a cross-platform design. We present the implementation, performance results, and a guideline of optimization strategies employed for delivering portable performance on both AMD and NVIDIA GPUs at extreme scale.
Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
A lower bound for a finite-scenario-based chance-constrained program is the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of solving larger subproblems. The quality of the bound depends on how the scenarios are grouped. In this paper, we formulate a mixed-integer bilevel program that optimally groups scenarios to tighten the quantile bounds. For general chance-constrained programs, we propose a branch-and-cut algorithm to optimize the bilevel program, and for chance-constrained linear programs, a mixed-integer linear-programming reformulation is derived. Here, we also propose several heuristics for grouping similar or dissimilar scenarios. Our computational results demonstrate that optimal grouping bounds are much tighter than heuristic bounds, resulting in smaller root-node gaps and better performance of scenario decomposition for solving chance-constrained 0-1 programs. Also, the optimal grouping bounds can be greatly strengthened using larger group size.
Advanced Modeling and Process-Materials Co-Optimization Strategies for Swing Adsorption Based Gas Separations
This project devised a computational framework for simultaneously co-optimizing pressure swing adsorption process designs along with the sorbent materials (specifically, metal-organic frameworks) to be employed in the associated packed bed columns. The materials optimization aspect involved search over a design space that can describe the material’s molecular structure, while the process optimization aspect considered various process degrees of freedom for steps arising in various cycle configurations. This framework was demonstrated on the separation of nitrogen and carbon dioxide, which arises ubiquitously in a multitude of post-combustion carbon capture and “blue” hydrogen production applications. Our results led to metal-organic framework molecular descriptor choices that are predicted to outperform standard structures used in practice, providing guidance for future metal-organic framework synthesis efforts.
Functional Partitioning to Optimize End-to-End Performance on Many-core Architectures
Scaling computations on emerging massive-core supercomputers is a daunting task, which coupled with the significantly lagging system I/O capabilities exacerbates applications end-to-end performance. The I/O bottleneck often negates potential performance benefits of assigning additional compute cores to an application. In this paper, we address this issue via a novel functional partitioning (FP) runtime environment that allocates cores to specific application tasks - checkpointing, de-duplication, and scientific data format transformation - so that the deluge of cores can be brought to bear on the entire gamut of application activities. The focus is on utilizing the extra cores to support HPC application I/O activities and also leverage solid-state disks in this context. For example, our evaluation shows that dedicating 1 core on an oct-core machine for checkpointing and its assist tasks using FP can improve overall execution time of a FLASH benchmark on 80 and 160 cores by 43.95% and 41.34%, respectively.
HPC formulations of optimization algorithms for tensor completion
Tensor completion is a powerful tool used to estimate or recover missing values in multi-way data. It has seen great success in domains such as product recommendation and healthcare. Tensor completion is most often accomplished via low-rank sparse tensor factorization, a computationally expensive non-convex optimization problem which has only recently been studied in the context of parallel computing. In this work, we study three optimization algorithms that have been successfully applied to tensor completion: alternating least squares (ALS), stochastic gradient descent (SGD), and coordinate descent (CCD++). We explore opportunities for parallelism on shared- and distributed-memory systems and address challenges such as memory- and operation-efficiency, load balance, cache locality, and communication. Among our advancements are a communication-efficient CCD++ algorithm, an ALS algorithm rich in level-3 BLAS routines, and an SGD algorithm which combines stratification with asynchronous communication. Furthermore, we show that introducing randomization during ALS and CCD++ can accelerate convergence. We evaluate our parallel formulations on a variety of real datasets on a modern supercomputer and demonstrate speedups through 16384 cores. Further, these improvements reduce time-to-solution from hours to seconds on real-world datasets. We show that after our optimizations, ALS is advantageous on parallel systems of small-to-moderate scale, while both ALS and CCD++ provide the lowest time-to-solution on large-scale distributed systems.
Theoretical study of isomerization and decomposition of propenal
We investigated the dynamics of isomerization and multi-channel dissociation of propenal (CH{sub 2}CHCHO), methyl ketene (CH{sub 3}CHCO), hydroxyl propadiene (CH{sub 2}CH{sub 2}CHOH), and hydroxyl cyclopropene (cyclic-C{sub 3}H{sub 3}-OH) in the ground potential-energy surface using quantum-chemical calculations. Optimized structures and vibrational frequencies of molecular species were computed with method B3LYP/6-311G(d,p). Total energies of molecules at optimized structures were computed at the CCSD(T)/6-311+G(3df,2p) level of theory. We established the potential-energy surface for decomposition to CH{sub 2}CHCO + H, CH{sub 2}CH + HCO, CH{sub 2}CH{sub 2}/CH{sub 3}CH + CO, CHCH/CH{sub 2}C + H{sub 2}CO, CHCCHO/CH{sub 2}CCO + H{sub 2}, CHCH + CO + H{sub 2}, CH{sub 3}+ HCCO, CH{sub 2}CCH + OH, and CH{sub 2}CC/cyclic-C{sub 3}H{sub 2}+ H{sub 2}O. Microcanonical rate coefficients of various reactions of trans-propenal with internal energies 148 and 182 kcal mol{sup -1} were calculated using Rice-Ramsperger-Kassel-Marcus and Variational transition state theories. Product branching ratios were derivable using numerical integration of kinetic master equations and the steady-state approximation. The concerted three-body dissociation of trans-propenal to fragments C{sub 2}H{sub 2}+ CO + H{sub 2} is the prevailing channel in present calculations. In contrast, C{sub 3}H{sub 3}O + H, C{sub 2}H{sub 3}+ HCO and C{sub 2}H{sub 4}+ CO were identified as major channels in the photolysis of trans-propenal. The discrepancy between calculations and experiments in product branching ratios indicates that the three major photodissociation channels occur mainly on an excited potential-energy surface whereas the other channels occur mainly on the ground potential-energy surface. This work provides profound insight in the mechanisms of isomerization and multichannel dissociation of the system C{sub 3}H{sub 4}O.
Accelerating Simulation for High-Fidelity PV Inverter System Reliability Assessment with High-Performance Computing
The overall cost of photovoltaic (PV) systems has shown a downward trend during the last decade; however, PV inverter failures account for the highest cost of operation and maintenance. To address this, reliability tools with powerful computation and better accuracy are required for the lifetime prediction and degradation evaluation of PV inverters. This paper proposes an event-driven parallel computing-based simulator. The proposed simulator applies high-performance computing techniques and other accessory optimization techniques-including cluster merging, adaptive model updates, and steady-state identification-to make reliability assessments for PV inverters under given input mission profiles and operating conditions with high efficiency and high fidelity. The main idea of the simulator and its workflow are introduced. Then, a demo PV inverter system simulator is implemented, and the speedup of the total simulations of the switching model reaches 123.03 times.
Stochastic Optimization for Unit Commitment-A Review
Optimization models have been widely used in the power industry to aid the decision-making process of scheduling and dispatching electric power generation resources, a process known as unit commitment (UC). Since UC's birth, there have been two major waves of revolution on UC research and real life practice. The first wave has made mixed integer programming stand out from the early solution and modeling approaches for deterministic UC, such as priority list, dynamic programming, and Lagrangian relaxation. With the high penetration of renewable energy, increasing deregulation of the electricity industry, and growing demands on system reliability, the next wave is focused on transitioning from traditional deterministic approaches to stochastic optimization for unit commitment. Since the literature has grown rapidly in the past several years, this paper is to review the works that have contributed to the modeling and computational aspects of stochastic optimization (SO) based UC. Relevant lines of future research are also discussed to help transform research advances into real-world applications.
Grid-Integrated Production of Fischer-Tropsch Synfuels from Nuclear Power
Idaho National Laboratory (INL) investigates the relative economic profitability of an integrated energy system (IES) coupling an NPP with a synfuel production process at selected case study locations across the United States. In the synfuel IES, a high-temperature steam electrolysis (HTSE) plant is thermally and electrically coupled with an NPP to produce zero-carbon hydrogen. The synthetic fuel is produced from this H 2 combined with a CO 2 supply using the reverse water gas shift process followed by the Fischer-Tropsch (FT) reaction. This analysis considers a system in which the CO 2 is sourced from regional CO 2 emitters via the construction and operation of pipeline-based CO 2 supply networks. Locating the FT plant at the same site as the NPP and HTSE plants enables the NPP to provide zero-carbon heat and power to the HTSE plant and zero-carbon power to the FT plant as well as avoid the requirement for long-distance H 2 product transport from the HTSE plant to the FT plant. Hydrogen storage is used to enable the NPP to dispatch power to the electrical grid (instead of the HTSE plant) when grid demand increases, thus enabling the FT plant to continue to operate in a steady-state production mode. The ability to cease hydrogen production for several hours within each day enables the NPP to provide power to the grid to balance the electricity market during peak periods and maximize revenues for the nuclear synfuel IES. The FT process design considered has a 99% carbon conversion efficiency. The use of nuclear energy and nuclear energy-derived hydrogen enables synfuel production to achieve this high level of carbon utilization. Additionally, the life-cycle carbon emissions of the nuclear-based synfuel production process are very low, with WTW emissions of approximately 25 gCO 2 e/MJ, including steam credits (generated from FT process excess heat), and approximately 7 gCO 2 e/MJ, if steam credits are excluded. This compares favorably with the WTW emissions of 90.5 gCO 2 e/MJ for a compression-ignition, direct injection (CIDI) vehicle with a fuel economy of 31.6 miles per gallon gasoline equivalent (MPGGE), using low-sulfur diesel produced using conventional petroleum production and refining processes. Several NPPs in various regions of the U.S. are considered as case study analyses. Supply locations and transportation via pipeline of the CO 2 feedstock to the NPP site are analyzed through the National Energy Technology Laboratory (NETL) CO 2 Transport Cost model. The team finds that the amount of CO 2 generated by different sectors is sufficient for the synfuel production process at all locations considered. The CO 2 transportation costs are functions of the distance of the source to the NPP location, the CO 2 capture cost at the source, and the quantity of CO 2 transported. Historical electricity prices for the NPP case study locations are collected and analyzed. Monthly average prices, price range, and duration of negative-price periods vary among these locations. For each location, an auto-regressive moving average (ARMA) model is trained on historical electricity price data. ARMA validation is done to ensure the synthetic price distributions represent one of historical prices with high fidelity. Synthetic time series from these ARMA models are used in a coupled dispatch and system optimization in the Holistic Energy Resource Optimization Network (HERON) to compute the differential net present value (NPV) of the IES. The team finds that this econometric is positive, ranging from $14M–1.3bn (2020) depending on the location. The optimal synfuel IES configuration to obtain this increase in NPV often maximizes the size of the synfuel production process with regards to the size of the NPP. However, the team shows that the NPP still plays a stabilizing role for the grid: In periods of high prices and high loads, more electricity from the NPP is sent to the grid. A high variability of electricity prices and extreme maximum prices tend to drive up electricity production. While it requires significant investment, the synfuel IES could increase the economic profitability for the existing fleet of LWRs across the country while still maintaining the grid stabilizer role of NPPs. During its lifetime, the main costs for the nuclear synfuel IES are the carbon feedstock transportation costs, followed by the capital expenses (CAPEX) and operation and maintenance (O&M) costs while the revenue comes first from the IRA H 2 production tax credit (PTC) and then from the sales of synfuel products. The profitability of the synfuel IES is most sensitive to the value of the hydrogen PTC and the synfuel products as well as the cost of the carbon feedstock, highlighting the importance of governmental incentives regarding hydrogen, carbon emissions, and synfuel in driving the deployment of future nuclear synfuel IESs.
Design and simulation of the nuSTORM facility
This thesis provides a full design and simulation of the nuSTORM beam line facility including the pion beam line , the pion and muon orbit combination section, and the muon decay ring. The study also includes the development of numerical optimization methods and their application to the design. At nuSTORM, one proton batch from the Main Injector (MI) is extracted and transported to the target station to bombard a solid target. A magnetic horn is used as the collection device for the secondary particles such as pions and kaons. A pion beam line is designed to transport the secondary particles downstream to the muon decay ring. In order to avoid the use of a fast kicker with a large aperture for the injection, an Orbit Combination Section (OCS) was designed to combine the reference pion orbit with the circulating muon orbit. This ful lls the stochastic injection scheme proposed in the 1980s. It is shown through the simulation that the pion beam line is able to deliver 0.011 muons per proton on target within the acceptance of the ring. In order to improve the circulating muon ux, an optimization of the magnetic collection horn was studied. A Multi-Objective Genetic Algorithm (MOGA), that was modi ed to integrate Message Passing Interface (MPI) in the process, is applied to the optimization. The number of muons within the ring acceptance from the pion decay is estimated by the pions after the collection horn. This new method was proposed to lower the requirement on the computing resources for the optimization. The study gives a new and better target and horn con guration after a full investigation of the system. The nuSTORM ring is examined with two optics designs. With di erent features, the two designs are optimized via correcting the nonlinearities with sextupolar eld distribution in the ring. A modi ed MPI-based Simulated Annealing (SA) algorithm was applied to obtain the optimal ring acceptance. The comparison with the GA shows good agreements on the achieved optimal ring acceptance. The pion and muon beams at nuSTORM were simulated and yield avor-pure and precisely measurable neutrino beams, which can be used to provide a de nite statement about the existence of a sterile neutrino.
A Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT): Part II. The cloudy-sky model
The Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT) reported in Part I of this report is enhanced to include the requirements for cloudy-sky conditions. Surface radiances in 2002 narrow-wavelength bands from 0.28 to 4.0 um are analytically computed by solving the radiative transfer equation for five independent photon paths accounting for clear-sky absorption, Rayleigh scattering, and cloud absorption and scattering. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS) is used to show the optical thickness of the clear-sky atmosphere. Unlike Part I, which approximates the computation of aerosol scattering using the single-scattering phase function, the cloud transmittance and reflectance are efficiently retrieved from a comprehensive look-up table pre-computed by a 32-stream DIScrete Ordinates Radiative Transfer (DISORT) model for possible cloud conditions as well as solar and viewing geometries. A resolution assessment is performed to observe the optimal balance between the computational efficiency and accuracy in the development of the look-up table. Model simulations by DISORT and TMYSPEC are used to evaluate the performance of FARMS-NIT under cloudy-sky conditions. Compared to DISORT, FARMS-NIT yields 2-3% uncertainties on average, but it substantially reduces the computational time because of the independent computation of cloud properties and the implementation of the look-up table. In contrast to TMYSPEC, which uses successive steps to empirically compute plane-of-array (POA) irradiances and spectral irradiances, FARMS-NIT directly solves spectral radiances from the radiative transfer equation, which profoundly increases the accuracy in surface irradiances, especially over inclined photovoltaics (PV) panels.
On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces
Newton’s method is usually preferred when solving optimization problems due to its superior convergence properties compared to gradient-based or derivative-free optimization algorithms. However, deriving and computing second-order derivatives needed by Newton’s method often is not trivial and, in some cases, not possible. In such cases quasi-Newton algorithms are a great alternative. In this paper, we provide a new derivation of well-known quasi-Newton formulas in an infinite-dimensional Hilbert space setting. Furthermore, it is known that quasi-Newton update formulas are solutions to certain variational problems over the space of symmetric matrices. In this paper, we formulate similar variational problems over the space of bounded symmetric operators in Hilbert spaces. By changing the constraints of the variational problem we obtain updates (for the Hessian and Hessian inverse) not only for the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method but also for Davidon–Fletcher–Powell (DFP), Symmetric Rank One (SR1), and Powell-Symmetric-Broyden (PSB). In addition, for an inverse problem governed by a partial differential equation (PDE), we derive DFP and BFGS “structured” secant formulas that explicitly use the derivative of the regularization and only approximates the second derivative of the misfit term. We show numerical results that demonstrate the desired mesh-independence property and superior performance of the resulting quasi-Newton methods.
Geant4 Computing Performance Benchmarking and Monitoring
Performance evaluation and analysis of large scale computing applications is essential for optimal use of resources. As detector simulation is one of the most compute intensive tasks and Geant4 is the simulation toolkit most widely used in contemporary high energy physics (HEP) experiments, it is important to monitor Geant4 through its development cycle for changes in computing performance and to identify problems and opportunities for code improvements. All Geant4 development and public releases are being profiled with a set of applications that utilize different input event samples, physics parameters, and detector configurations. Results from multiple benchmarking runs are compared to previous public and development reference releases to monitor CPU and memory usage. Observed changes are evaluated and correlated with code modifications. Besides the full summary of call stack and memory footprint, a detailed call graph analysis is available to Geant4 developers for further analysis. The set of software tools used in the performance evaluation procedure, both in sequential and multi-threaded modes, include FAST, IgProf and Open|Speedshop. In conclusion, the scalability of the CPU time and memory performance in multi-threaded application is evaluated by measuring event throughput and memory gain as a function of the number of threads for selected event samples.
NCCS High Performance GMRES Mixed Precision
HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.
Optimization of a Lightweight Floating Offshore Wind Turbine with Water Ballast Motion Mitigation Technology
Floating offshore wind turbines are a promising technology for addressing energy needs by utilizing wind resources offshore. The current state of the art is based on heavy, expensive platforms to survive the ocean environment. Typical design techniques do not involve optimization because of the computationally expensive time domain solvers used to model motions and loads in the ocean environment. However, this design uses an efficient frequency domain solver with a genetic algorithm to rapidly optimize the design of a novel floating wind turbine concept. The concept utilizes a liquid ballast mass to mitigate motions on a lightweight post-tensioned concrete platform. The simple cruciform-shaped design of the platform made of post-tensioned concrete is less expensive than steel, reducing the raw material and manufacturing cost. The use of ballast water to behave as a tuned mass damper allows a smaller platform to achieve the same motions as a much larger platform, thus reducing the mass and cost. The optimization techniques applied with these design innovations resulted in a design with a levelized cost of energy of USD 0.0753/kWh, roughly half the cost of the current state of the art.