Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel 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 919 records · Page 51

On the minimax feedback control of uncertain dynamic systems.

In this paper the problem of optimal feedback control of uncertain discrete-time dynamic systems is considered where the uncertain quantities do not have a stochastic description but instead are known to belong to given sets. The problem is converted to a sequential minimax problem and dynamic programming is suggested as a general method for its solution. The notion of a sufficiently informative function, which parallels the notion of a sufficient statistic of stochastic optimal control, is introduced, and conditions under which the optimal controller decomposes into an estimator and an actuator are identified.

Bertsekas, D. P.↗

Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems.

The problem of optimal feedback control of uncertain discrete-time dynamic systems is considered where the uncertain quantities do not have a stochastic description but instead are known to belong to given sets. The problem is converted to a sequential minimax problem and dynamic programming is suggested as a general method for its solution. The notion of a sufficiently informative function, which parallels the notion of a sufficient statistic of stochastic optimal control, is introduced, and conditions under which the optimal controller decomposes into an estimator and an actuator are identified.

Bertsekas, D. P.↗

Accelerating Computation of the Unit Commitment Problem (Presentation)

Production cost models (PCMs) simulate power system operation at hourly (or higher) resolution. While computation times often extend into multiple days, the sequential nature of PCM's makes parallelism difficult. We exploit the persistence of unit commitment decisions to select partition boundaries for simulation horizon decomposition and parallel computation. Partitioned simulations are benchmarked against sequential solutions for optimality and computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient Breadth-First Search on the Cell/BE Processor

Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented level of complexity in algorithmic design and software development. In this paper we describe the challenges involved in designing a breadth-first search (BFS) for advanced multi-core processors. The proposed methodology combines a high-level algorithmic design that captures the machine-independent aspects, to guarantee portability with performance to future processors, with a low-level implementation that embeds processor-specific optimizations. Using a fine-graind global coordination strategy derived by the Bulk-Synchronous Parallel (BSP) model we have determined an accurate performance model that has guided the implementation and the optimization of our algorithms. To validate our approach, we use a state-of-the-art multicore processor, the Cell Broadband Engine (Cell BE). Our experiments, obtained on a pre-production Cell BE board running at 3.2 GHz, show almost linear speedups when using multiple synergistic processing elements, and an impressive level of performance when compared to other processors. The Cell BE is typically an order of magnitude faster than conventional processors, such as the AMD Opteron and the Intel Pentium 4 and Woodcrest, an order of magnitude faster than the MTA-2 multi-threaded processor, and two orders of magnitude faster than a BlueGene/L processor. Index Terms—Multi-core processors, Parallel Computing, Cell Broadband Engine, Parallelization Techniques, Graph Exploration Algorithms, Breadth-First Search, BFS.

97 MATHEMATICS AND COMPUTING↗

An Efficient Multiblock Method for Aerodynamic Analysis and Design on Distributed Memory Systems

The work presented in this paper describes the application of a multiblock gridding strategy to the solution of aerodynamic design optimization problems involving complex configurations. The design process is parallelized using the MPI (Message Passing Interface) Standard such that it can be efficiently run on a variety of distributed memory systems ranging from traditional parallel computers to networks of workstations. Substantial improvements to the parallel performance of the baseline method are presented, with particular attention to their impact on the scalability of the program as a function of the mesh size. Drag minimization calculations at a fixed coefficient of lift are presented for a business jet configuration that includes the wing, body, pylon, aft-mounted nacelle, and vertical and horizontal tails. An aerodynamic design optimization is performed with both the Euler and Reynolds Averaged Navier-Stokes (RANS) equations governing the flow solution and the results are compared. These sample calculations establish the feasibility of efficient aerodynamic optimization of complete aircraft configurations using the RANS equations as the flow model. There still exists, however, the need for detailed studies of the importance of a true viscous adjoint method which holds the promise of tackling the minimization of not only the wave and induced components of drag, but also the viscous drag.

Reuther, James↗

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a 3D unstructured-grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data-structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which ease the implementation of computational problems on parallel architecture machines by relieving the user of the low-level machine specific issues. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

Optimizing Desalination Operations for Energy Flexibility

Despite the value of energy optimization in desalination processes, modeling dynamic operations for monthly billing periods has remained a computational challenge. This work proposes a framework for energy flexibility optimization, which includes new modeling features for independent operation of parallel skids, start-up delays associated with chemical stabilization, the consideration of industrial energy tariff structures, and inclusion of hourly electrical carbon intensities. This is done using a modular and computationally efficient formulation that guarantees a globally optimal solution with standard optimization solvers. In this study, the approach is demonstrated in two distinct case studies: a seawater desalination plant in Santa Barbara, CA, and an indirect potable reuse facility in San Jose, CA. Trends predicted from the model are validated against operational facility measurements from a demand response shutdown event. Preliminary results show that optimizing energy flexibility can result in 18.51% monthly cost savings over energy efficiency-optimized operation. The value extracted from a facility-wide shutdown during peak electricity price hours is hampered by start-up delays in post-treatment chemical stabilization. In cases in which a facility does not have much excess capacity, using a flow equalization tank or operating over a wide recovery range may be cost-effective.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel algorithms for finding connected components using linear algebra

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.

97 MATHEMATICS AND COMPUTING↗

PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve further as more functionality is added in the future.

97 MATHEMATICS AND COMPUTING↗

A scoping study of far-SOL main-wall protection limiters for steady-state operation of compact pilot plant tokamaks

We present a novel method for handling steady-state heat fluxes incident on the main wall of pilot plant-scale magnetic fusion devices, based on the utilization of protection limiters in the far scrape-off layer (SOL). This method helps avoid large plasma-wall gaps, without excessively compromising blanket performance. We present an optimization algorithm for determining the appropriate size and scale of these protection limiters given (1) probability distributions of SOL plasma parameters and (2) assumed risk tolerance. As part of this optimization, we have developed an analytic description of parallel heat fluxes across limiter shadows, and an objective cost function (the ‘Far-SOL Marginal Cost’) to quantify the impact that different main-wall thermal management design choices have on reactor capital cost. Applying the model to a midscale fusion pilot plant concept shows that making use of far-SOL protection limiters can reduce capital costs on the order of $500 M, relative to naively increasing the plasma-wall gap. Our analysis demonstrates that the far-SOL power decay length is the highest-leverage plasma assumption for thermal loading of the first wall, and the primary cost driver for main wall thermal management. The relative cost efficiency of protection limiters increases as assumptions on the far-SOL heat flux become more pessimistic. The concepts described in this paper motivate the further development of far-SOL protection limiters as part of larger efforts to design economical core-edge-wall compatible solutions for a fusion pilot plant.

Design under uncertainty↗

Efficient smoothed particle radiation hydrodynamics I: Thermal radiative transfer

This work presents efficient solution techniques for radiative transfer in the smoothed particle hydrodynamics discretization. Two choices that impact efficiency are how the material and radiation energy are coupled, which determines the number of iterations needed to converge the emission source, and how the radiation diffusion equation is solved, which must be done in each iteration. The coupled material and radiation energy equations are solved using an inexact Newton iteration scheme based on nonlinear elimination, which reduces the number of Newton iterations needed to converge within each time step. During each Newton iteration, the radiation diffusion equation is solved using Krylov iterative methods with a multigrid preconditioner, which abstracts and optimizes much of the communication when running in parallel. The code is verified for an infinite medium problem, a one-dimensional Marshak wave, and a two and three-dimensional manufactured problem, and exhibits first-order convergence in time and second-order convergence in space. For these problems, the number of iterations needed to converge the inexact Newton scheme and the diffusion equation is independent of the number of spatial points and the number of processors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discovery of Fragment-Derived Small Molecules for in Vivo Inhibition of Ketohexokinase (KHK)

Increased fructose consumption and its subsequent metabolism have been implicated in hepatic steatosis, dyslipidemia, obesity, and insulin resistance in humans. Since ketohexokinase (KHK) is the principal enzyme responsible for fructose metabolism, identification of a selective KHK inhibitor may help to further elucidate the effect of KHK inhibition on these metabolic disorders. Until now, studies on KHK inhibition with small molecules have been limited due to the lack of viable in vivo pharmacological tools. Herein we report the discovery of 12, a selective KHK inhibitor with potency and properties suitable for evaluating KHK inhibition in rat models. Key structural features interacting with KHK were discovered through fragment-based screening and subsequent optimization using structure-based drug design, and parallel medicinal chemistry led to the identification of pyridine 12.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Successes and Opportunities for Discovery of Metal Oxide Photoanodes for Solar Fuels Generators

We report that the importance of metal oxide photoanodes in solar fuels technology has garnered concerted efforts in photoanode discovery in recent decades, which complement parallel efforts in development of analytical techniques and optimization strategies using standard photoanodes such as TiO 2 , Fe 2 O 3 and BiVO 4 . Theoretical guidance of high-throughput experiments has been particularly effective in dramatically increasing the portfolio of metal oxide photoanodes, motivating a new era of photoanode development where the characterization and optimization techniques developed on traditional materials are applied to nascent photoanodes that exhibit visible light photoresponse. The compendium of metal oxide photoanodes presented in the present work can also serve as the basis for further technique development, with a primary goal to establish workflows for discovery of materials that perform better against the critical criteria of operational stability, visible light photoresponse, and photovoltage suitable for tandem absorber architectures.

14 SOLAR ENERGY↗

Accelerating computational modeling and design of high-entropy alloys

High-entropy alloys, with N elements and compositions {$c_{ν = 1,N}$} in competing crystal structures, have large design spaces for unique chemical and mechanical properties. In this work, to enable computational design, we use a metaheuristic hybrid Cuckoo search (CS) to construct alloy configurational models on the fly that have targeted atomic site and pair probabilities on arbitrary crystal lattices, given by supercell random approximates (SCRAPs) with S sites. Our Hybrid CS permits efficient global solutions for large, discrete combinatorial optimization that scale linearly in a number of parallel processors, and linearly in sites S for SCRAPs. For example, a four-element, 128-site SCRAP is found in seconds—a more than 13,000-fold reduction over current strategies. Our method thus enables computational alloy design that is currently impractical. We qualify the models and showcase application to real alloys with targeted atomic short-range order. Being problem-agnostic, our Hybrid CS offers potential applications in diverse fields.

36 MATERIALS SCIENCE↗

Chemical accuracy from quantum Monte Carlo for the benzene dimer

We report an accurate study of interactions between benzene molecules using variational quantum Monte Carlo (VMC) and diffusion quantum Monte Carlo (DMC) methods. We compare these results with density functional theory using different van der Waals functionals. In our quantum Monte Carlo (QMC) calculations, we use accurate correlated trial wave functions including three-body Jastrow factors and backflow transformations. We consider two benzene molecules in the parallel displaced geometry, and find that by highly optimizing the wave function and introducing more dynamical correlation into the wave function, we compute the weak chemical binding energy between aromatic rings accurately. We find optimal VMC and DMC binding energies of −2.3(4) and −2.7(3) kcal/mol, respectively. The best estimate of the coupled-cluster theory through perturbative triplets/complete basis set limit is −2.65(2) kcal/mol [Miliordos et al., J. Phys. Chem. A 118, 7568 (2014)]. Our results indicate that QMC methods give chemical accuracy for weakly bound van der Waals molecular interactions, comparable to results from the best quantum chemistry methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hvac: Removing I/O Bottleneck for Large-Scale Deep Learning Applications

Scientific communities are increasingly adopting deep learning (DL) models in their applications to accelerate scientific discovery processes. However, with rapid growth in the computing capabilities of HPC supercomputers, large-scale DL applications have to spend a significant portion of training time performing I/O to a parallel storage system. Previous research works have investigated optimization techniques such as prefetching and caching. Unfortunately, there exist non-trivial challenges to adopting the existing solutions on HPC supercomputers for large-scale DL training applications, which include non-performance and/or failures at extreme scale, lack of portability and generality in design, complex deployment methodology, and being limited to a specific application or dataset. To address these challenges, we propose High-Velocity AI Cache (HVAC), a distributed read-cache layer that targets and fully exploits the node-local storage or near node-local storage technology. HVAC seamlessly accelerates read I/O by aggregating node-local or near node-local storage, avoiding metadata lookups and file locking while preserving portability in the application code. We deploy and evaluate HVAC on 1,024 nodes (with over 6000 NVIDIA V100 GPUS) of the Summit supercomputer. In particular, we evaluate the scalability, efficiency, accuracy, and load distribution of HVAC compared to GPFS and XFS-on-NVMe. With four different DL applications, we observe an average 25 % performance improvement atop GPFS and 9% drop against XFS-on-NVMe, which scale linearly and are considered the performance upper bound. We envision HVAC as an important caching library for upcoming HPC supercomputers such as Frontier.

Khan, Awais↗

Exploiting communication concurrency on high performance computing systems

Although logically available, applications may not exploit enough instantaneous communication concurrency to maximize hardware utilization on HPC systems. This is exacerbated in hybrid programming models such as SPMD+OpenMP. We present the design of a "multi-threaded" runtime able to transparently increase the instantaneous network concurrency and to provide near saturation bandwidth, independent of the application configuration and dynamic behavior. The runtime forwards communication requests from application level tasks to multiple communication servers. Our techniques alleviate the need for spatial and temporal application level message concurrency optimizations. Experimental results show improved message throughput and bandwidth by as much as 150% for 4KB bytes messages on InfiniBand and by as much as 120% for 4KB byte messages on Cray Aries. For more complex operations such as all-to-all collectives, we observe as much as 30% speedup. This translates into 23% speedup on 12,288 cores for a NAS FT implemented using FFTW. We also observe as much as 76% speedup on 1,500 cores for an already optimized UPC+OpenMP geometric multigrid application using hybrid parallelism.

97 MATHEMATICS AND COMPUTING↗