Search NASA⌕ Search

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.

At least 271 records · Page 15

A survey on software methods to improve the energy efficiency of parallel computing

Energy consumption is one of the top challenges for achieving the next generation of supercomputing. Codesign of hardware and software is critical for improving energy efficiency (EE) for future large-scale systems. Many architectural power-saving techniques have been developed, and most hardware components are approaching physical limits. Accordingly, parallel computing software, including both applications and systems, should exploit power-saving hardware innovations and manage efficient energy use. In addition, new power-aware parallel computing methods are essential to decrease energy usage further. This article surveys software-based methods that aim to improve EE for parallel computing. It reviews the methods that exploit the characteristics of parallel scientific applications, including load imbalance and mixed precision of floating-point (FP) calculations, to improve EE. In addition, this article summarizes widely used methods to improve power usage at different granularities, such as the whole system and per application. In particular, it describes the most important techniques to measure and to achieve energy-efficient usage of various parallel computing facilities, including processors, memories, and networks. Overall, this article reviews the state-of-the-art of energy-efficient methods for parallel computing to motivate researchers to achieve optimal parallel computing under a power budget constraint.

97 MATHEMATICS AND COMPUTING↗

autoGEMM: Pushing the Limits of Irregular Matrix Multiplication on Arm Architectures

This paper presents an open-source library that pushes the limits of performance portability for irregular General Matrix Multiplication (GEMM) on the widely-used Arm architectures. Our library, autoGEMM, is designed to support a wide range of Arm processors: from edge devices to HPC-grade CPUs. autoGEMM generates optimized kernels for various hardware configurations by auto-combining fragments of autogenerated micro-kernels that employ hand-written optimizations to maximize computational efficiency. We optimize the kernel pipeline by tuning the register reuse and the data load/store overlapping. In addition, we use a dynamic tiling scheme to generate balanced tile shapes. Finally, we position autoGEMM on top of the TVM framework where our dynamic tiling scheme prunes the search space for TVM to identify the optimal combination of parameters for code optimization. Evaluations on five different classes of Arm chips demonstrate the advantages of autoGEMM. For small matrices, autoGEMM achieves 98% of peak and up to 2.0x speedup over state-of-the-art libraries such as LIBXSMM and LibShalom. For irregular matrices (i.e. tall skinny and long rectangles), autoGEMM is 1.3-2.0x faster than widely-used libraries such as OpenBLAS and Eigen. autoGEMM is publicly available at: https://github.com/wudu98/autoGEMM.

Wu, Du↗

Optimization of Multi-Fidelity Computer Experiments via the EQIE Criterion

Computer experiments based on mathematical models are powerful tools for understanding physical processes. This article addresses the problem of kriging-based optimization for deterministic computer experiments with tunable accuracy. Our approach is to use multi- delity computer experiments with increasing accuracy levels and a nonstationary Gaussian process model. We propose an optimization scheme that sequentially adds new computer runs by following two criteria. The first criterion, called EQI, scores candidate inputs with given level of accuracy, and the second criterion, called EQIE, scores candidate combinations of inputs and accuracy. Here, from simulation results and a real example using finite element analysis, our method out-performs the expected improvement (EI) criterion which works for single-accuracy experiments.

97 MATHEMATICS AND COMPUTING↗

Performance-driven optimization of urban open space configuration in the cold-winter and hot-summer region of China

Urbanization has led to changes in urban morphology and climate, while urban open space has become an important ecological factor for evaluating the performance of urban development. This study presents an optimization approach using computational performance simulation. With a genetic algorithm using the Grasshopper tool, this study analyzed the layout and configuration of urban open space and its impact on the urban micro-climate under summer and winter conditions. The outdoor mean Universal Thermal Climate Index (UTCI) was applied as the performance indicator for evaluating the quality of the urban micro-climate. Two cases—one testbed and one real urban block in Nanjing, China -- were used to validate the computer-aided simulation process. The optimization results in the testbed showed UTCI values varied from 36.5 to 37.3 °C in summer and from -4.9 to -1.9 °C in winter. In the case of the real urban block, optimization results show, for summer, although the average UTCI value increased by 0.6 °C, the average air velocity increased by 0.2 m/s; while in winter, the average UTCI value increased by 1.7 °C and the average air velocity decreased by 0.2 m/s. These results demonstrate that the proposed computer-aided optimization process can improve the thermal comfort conditions of open space in urban blocks. Finally, this study discusses strategies and guidelines for the layout design of urban open space to improve urban environment comfort.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Computational simulations and beamline optimizations for an electron beam degrader at CEBAF

An electron beam degrader is under development with the objective of measuring the transverse and longitudinal acceptance of the Continuous Electron Beam Accelerator Facility (CEBAF) at Jefferson Lab. This project is in support of the CE+BAF positron capability. Computational simulations of beam-target interactions and particle tracking were performed integrating the GEANT4 and Elegant toolkits. A solenoid was added to the setup to control the beam's divergence. Parameter optimization of the solenoid field and magnetic quadrupoles gradient was also performed to further reduce particle loss through the rest of the injector beamline.

Lizárraga-Rubio, V.↗

Analysis and selection of optimal function implementations in massively parallel computer

An apparatus, program product and method optimize the operation of a parallel computer system by, in part, collecting performance data for a set of implementations of a function capable of being executed on the parallel computer system based upon the execution of the set of implementations under varying input parameters in a plurality of input dimensions. The collected performance data may be used to generate selection program code that is configured to call selected implementations of the function in response to a call to the function under varying input parameters. The collected performance data may be used to perform more detailed analysis to ascertain the comparative performance of the set of implementations of the function under the varying input parameters.

97 MATHEMATICS AND COMPUTING↗

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

97 MATHEMATICS AND COMPUTING↗

Quantum Optimal Control Using High Performance Computing

This feasibility study developed numerical methods for the optimal control problem for realizing logical gates in closed quantum systems, where the evolution of the state vector is governed by the time dependent Schrodinger equation. The number of parameters in the control functions is made independent of the number of time steps by expanding them in terms of B-spline basis functions, with and without carrier waves. We use an interior point gradient-based technique from the IPOPT package to minimize the gate infidelity subject to amplitude constraints on the control functions. The symplectic Stromer-Verlet scheme is used to integrate a real-valued formulation of Schrodinger's equation in time and the gradient of the gate infidelity is obtained by solving the corresponding adjoint equation. This allows all components of the gradient to be calculated at the cost of solving three Schrodinger systems, independently of the number of parameters in the control functions. The correctness of the method is verified and applied to Hamiltonians that model the dynamics of coupled super-conducting qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗

A Range and Performance Optimized Version of the Computer-Aided Speckle Interferometry Algorithm for Real-Time Displacement-Strain Field Monitoring

Abstract This work presents an optimized implementation of the Computer-Aided Speckle Interferometry algorithm which enables full-field determination of displacements and strains on commodity Graphics Processing Units at high resolution and frame rates. By combining careful control of the average speckle size in a laser speckle pattern with a simple sampling rate conversion scheme, a compact representation of the optical speckle is achieved. This allows for optimal use of Graphics Processing Unit architecture with robust range extension. The optimal mapping of the Computer-Aided Speckle Interferometry algorithm to Graphics Processing Unit architecture is shown in detail, and a straightforward method for disambiguating large displacements is illustrated. Lastly, this paper demonstrates a two-step subimage-tapering modification to the original algorithm that enables robust range enhancement while maintaining resolution. Results from numerical simulations on synthetic speckle patterns are shown, and runtime performance metrics are provided, with performance ranging up to 60 frames per second in some cases. The method is suitable for interactive experimental mechanics research, process and testing or any application where real-time high-resolution displacement-strain monitoring is needed. A .NET Framework class library enabling the incorporation of the algorithm into 3rd -party applications is available for download.

42 ENGINEERING↗

Directive-Based, High-Level Programming and Optimizations for High-Performance Computing with FPGAs

Reconfigurable architectures like Field Programmable Gate Arrays (FPGAs) have been used for accelerating computations from several domains because of their unique combination of flexibility, performance, and power efficiency. However, FPGAs have not been widely used for high-performance computing, primarily because of their programming complexity and difficulties in optimizing performance. In this paper, we present a directive-based, high-level optimization framework for high-performance computing with FPGAs, built on top of an OpenACC-to-FPGA translation framework called OpenARC. We propose directive extensions and correspond- ing compile-time optimization techniques to enable the compiler to generate more efficient FPGA hardware configuration files. Empirical evaluation of the proposed framework on an Intel Stratix V with five OpenACC benchmarks from various application domains shows that FPGA-specific optimizations can lead to significant increases in performance across all tested applications. We also demonstrate that applying these high-level directive-based optimizations can allow OpenACC applications to perform similarly to lower-level OpenCL applications with hand-written FPGA-specific optimizations, and offer runtime and power performance benefits compared to CPUs and GPUs.

Lambert, Jacob↗

Formulation analysis and computation of an optimization-based local-to-nonlocal coupling method

We present an optimization-based coupling method for local and nonlocal continuum models. Our approach couches the coupling of the models into a control problem where the states are the solutions of the nonlocal and local equations, the objective is to minimize their mismatch on the overlap of the local and nonlocal problem domains, and the virtual controls are the nonlocal volume constraint and the local boundary condition. We present the method in the context of Local-to-Nonlocal diffusion coupling. Numerical examples illustrate the theoretical properties of the approach.

97 MATHEMATICS AND COMPUTING↗

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

Investigation of surface termination by directional elastic peak electron spectroscopy: Experiment and theory

Experimental and theoretical details concerning the directional elastic peak electron spectroscopy are presented. The application of this experimental method to the identification of a crystalline structure of surface layers is shown for Cu(111) and Ru(0001), which enables the analysis of different surface terminations associated with different sequences of atoms along the surface normal. Theoretical data are obtained by applying the multiple scattering theory and different sources of phase shifts. The quantitative analysis performed by an R-factor reveals almost the same populations of A and B terminated (0001) terraces and proves explicitly the presence of steps of atomic height on the clean Ru(0001) surface. This is not the case for the Cu(111) surface, where the terrace termination does not affect the distribution of atomic directions within the first few atomic layers. The averaging of theoretical data versus scattering volume defined by the sphere radius R{sub max} around the emitter site is discussed in view of the computation time optimization. - Highlights: • We examined the structure and surface termination of fcc and hcp monocrystals. • Crystalline structure within the first few atomic layers was determined by DEPES. • Multiple scattering formalism was used to obtain theoretical results. • Populations of terraces with different terminations were determined. • Scattering parameters are discussed in the context of computation time optimization.

36 MATERIALS SCIENCE↗

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

Computational Simulation of an Additively Manufactured Marine Component

Early work in finite-element analysis of additive manufacturing (AM) components was not able to include distortion and residual stress of the entire build, yielding uncertainty in the computational model predictions. To address this, current versions of recently developed computational tools are being used to understand their role in validation at the Naval Surface Warfare Center, Carderock Division, for laser powder-bed fusion (L-PBF) AM. A 316L stainless steel L-PBF build containing multiple parts, which exhibited the same local part failure over multiple AM fabrication runs, was selected for computational analysis. Single-part simulations analyzed optimization of computational speed and prediction accuracy. Full-build simulations exposed the smallest re-coater tolerances early in part fabrication as a result of part shrinkage and subsequent cupping. This cupping was predicted to change the powder spreading and result in the non-consolidation of the support structures, which paralleled the failures seen in the physical builds. Part redesign of the conventionally produced part to align with AM fabrication requirements was recommended to alleviate the build failures. This project is part of a larger program focused on validation of the computational tools to determine best practices for insertion of AM simulation into the greater Naval enterprise.

36 MATERIALS SCIENCE↗