Early experiences with node-level power capping on the Cray XC40 platform
Explore the source record for details and available documents.
Pedretti, Kevin↗
SEARCH · Search NASA
Results for “optimization applications”
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.
Piecewise Linear Optimization for Public EV Charging Depots in Different Utility Environments
With the proliferation of electric vehicles (EVs), EV supply equipment technology is being pushed to increasingly higher power levels, such as extreme fast charging (XFC) at 300kW or more. As more public XFC depots are connected to electric distribution systems, utility operators will mitigate their impact with pricing schemes and programs such as demand response, demand charges, and time-varying prices. In this paper we describe an XFC management system that combines an on-site battery energy storage system and an optimization application that minimizes the cost to operate the depot in light of the utility pricing programs. We have designed the optimizer specially to use fast and simple linear programming so that it can be deployed to low-cost computing platforms. We also describe how several utility pricing schemes are integrated into a single piecewise model, reducing the engineering effort to implement the optimizer in different utility environments.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
YAPPA: a Compiler-Based Parallelization Framework for Irregular Applications on MPSoCs
Modern embedded systems include hundreds of cores. Because of the difficulty in providing a fast, coherent memory architecture, these systems usually rely on non-coherent, non-uniform memory architectures with private memories for each core. However, programming these systems poses significant challenges. The developer must extract large amounts of parallelism, while orchestrating communication among cores to optimize application performance. These issues become even more significant with irregular applications, which present data sets difficult to partition, unpredictable memory accesses, unbalanced control flow and fine grained communication. Hand-optimizing every single aspect is hard and time-consuming, and it often does not lead to the expected performance. There is a growing gap between such complex and highly-parallel architectures and the high level languages used to describe the specification, which were designed for simpler systems and do not consider these new issues. In this paper we introduce YAPPA (Yet Another Parallel Programming Approach), a compilation framework for the automatic parallelization of irregular applications on modern MPSoCs based on LLVM. We start by considering an efficient parallel programming approach for irregular applications on distributed memory systems. We then propose a set of transformations that can reduce the development and optimization effort. The results of our initial prototype confirm the correctness of the proposed approach.
Irregular applications↗
Visual Analytics of Performance of Quantum Computing Systems and Circuit Optimization
Driven by potential exponential speedups in business, security, and scientific scenarios, interest in quantum computing is surging. This interest feeds the development of quantum computing hardware, but several challenges arise in optimizing application performance for hardware metrics (e.g., qubit coherence and gate fidelity). In this work, we describe a visual analytics approach for analyzing the performance properties of quantum devices and quantum circuit optimization. Our approach allows users to explore spatial and temporal patterns in quantum device performance data and it computes similarities and variances in key performance metrics. Detailed analysis of the error properties characterizing individual qubits is also supported. We also describe a method for visualizing the optimization of quantum circuits. The resulting visualization tool allows researchers to design more efficient quantum algorithms and applications by increasing the interpretability of quantum computations.
Chae, Junghoon↗
Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment
Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s
AC power flow↗
COEK
COEK (C++ Optimization Expression Kernel) is a C++ library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. COEK. Supports several mechanisms for defining and managing expressions and performing automatic differentiation. COEK also includes low-level interfaces for defining optimization models and interfacing with optimization solvers.SAND2019-14491 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.
Hart, William↗
Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade
Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Isopod (inverse Optimization And Design): Moose-based Application For Performing Inverse Optimization On Multiphysics Modeling And Simulation
ISOPOD (InverSe OPtimizatiOn and Design) will be a MOOSE (Multiphysics Object Oriented Simulation Environment)-based framework which will iteratively estimate the parameters by minimizing the difference between simulated and experimental observables. While inverse optimization has long been used for parameter estimation, the unique feature of ISOPOD is rapid solution of new inverse problems, leading to accelerated Research, Development and Demonstration (RD&D) for complex parameter estimation problems. This will be achieved by extending the software structure of MOOSE to inverse optimization, as well as building on the unique automatic differentiation feature of MOOSE.
Munday, LynnB↗
POEK
POEK (Python Optimization Expression Kernel) is a Python library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. POEK interfaces with the COEK library to support fast methods for defining and managing expressions and performing automatic differentiation. POEK also interfaces with COEK to directly interface with optimization solvers (i.e. without relying on file I/O). SAND2019-14492 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Hart, William↗
A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems
The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Application of stochastic optimization to nuclear power plant asset management decisions
We describe the development and application of stochastic optimization models and algorithms to address an issue of critical importance in the strategic allocation of resources; namely, the selection of a portfolio of capital investment projects under the constraints of a limited and uncertain budget. This issue is significant and one that faces decision-makers across all industries. The objective of this strategic decision process is generally self evident - to maximize the value obtained from the portfolio of selected projects (with value usually measured in terms of the portfolio's net present value). However, heretofore, many organizations have developed processes to make these investment decisions using simplistic rule-based rank-ordering schemes. This approach has the significant limitation of not accounting for the (often large) uncertainties in the costs or economic benefits associated with the candidate projects or in the uncertainties in the actual funds available to be expended over the projected period of time. As a result, the simple heuristic approaches that typically are employed in industrial practice generate outcomes that are non-optimal and do not achieve the level of benefits intended. In this paper we describe the results of research performed to utilize stochastic optimization models and algorithms to address this limitation by explicitly incorporating the evaluation of uncertainties in the analysis and decision making process. (authors)
97 MATHEMATICS AND COMPUTING↗
HPC Resource Allocation Under Energy Constraints
We discuss the new problem faced by High-Performance Computing (HPC) facilities in allocating resources to users of their facilities: while facilities once allocated a single finite resource—node-hours—now facilities must also concurrently allocate a second scarce resource: electrical energy, which is bounded within each facility's annual operations budget. Current application optimization practices encourage conservation of the first resource, but can be potentially unaffordably wasteful of the second. We describe a framework for reasoning about such allocations that can be utilized by facilities to articulate policy, while encouraging scientific application developers to write code mindfully of both constraints. We outline the requirements on facilities, on developers, and on hardware vendors and integrators that are necessary to enable the implementation of this framework.
97 MATHEMATICS AND COMPUTING↗
Protein crystallization with microseed matrix screening: application to human germline antibody Fabs
The power of microseed matrix screening is demonstrated in the crystallization of a panel of antibody Fab fragments. The crystallization of 16 human antibody Fab fragments constructed from all pairs of four different heavy chains and four different light chains was enabled by employing microseed matrix screening (MMS). In initial screening, diffraction-quality crystals were obtained for only three Fabs, while many Fabs produced hits that required optimization. Application of MMS, using the initial screens and/or refinement screens, resulted in diffraction-quality crystals of these Fabs. Five Fabs that failed to give hits in the initial screen were crystallized by cross-seeding MMS followed by MMS optimization. The crystallization protocols and strategies that resulted in structure determination of all 16 Fabs are presented. These results illustrate the power of MMS and provide a basis for developing future strategies for macromolecular crystallization.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
The role of surface ligands in quantum-dot devices: Villain or unsung hero?
For over three decades, the study of nanocrystal quantum dots (QDs), which are solution-synthesized nanometer-scale bits of semiconductor materials, has produced singular advances in both our understanding of quantum confinement effects, and in our ability to make use of them in tech-relevant materials. Accordingly, QDs have found their way into the marketplace, specifically as high-performance fluorophores for, e.g., displays and biolabeling. In such applications, optimization of the QD surface, including the passivating ligands, is key to keeping photo-excited carriers from leaving the QD interior before recombining, resulting in a high fluorescence efficiency. Increasingly, attention has turned to realize the promise of QDs for optoelectronic applications (e.g., solar cells, LEDs, sensors) which require charge carriers to controllably enter, exit and/or travel through QDs, a much more challenging problem. In this scenario, the role of the QD surface must be completely reimagined, from being an impenetrable wall to being a gateway, or even a ramp. In this talk, I’ll explore the inherent contrast between QD fluorophore and device applications, and describe how ligands, originally thought only to be impediments to QD electronic devices, may actually give the savvy QD device designer control over function and performance in a manner unknown in bulk semiconductor devices. Finally, I’ll survey recent efforts at Los Alamos to develop a universal tool box for deposition of conductive QD films that may finally allow the manufacturing of economical, high-performance devices for a wide range of applications.
36 MATERIALS SCIENCE↗
Toward Performance Portable Programming for Heterogeneous System-on-Chips: Case Study with Qualcomm Snapdragon SoC
Future heterogeneous Domain-Specific System-on-Chips (DSSoC) will be extraordinarily complex in terms of processors, memory hierarchies, and interconnection networks.To manage this complexity, architects, system software designers, and application developers need programming technologies that are flexible, accurate, efficient, and productive. These technologies will need to be as independent of any one specific architecture as is practical, because the sheer dimensionality and scale of the complexity will not allow porting and optimizing applications foreach given DSSoC. To address these issues, we are developing Cosmic Castle, a performance portable programming toolchain for streaming applications on heterogeneous architectures. The primary focus of Cosmic Castle is on enabling efficient and performant code generation through the smart compiler and intelligent runtime system. This paper presents the preliminary evaluation of our ongoing work toward Cosmic Castle. Specifically, we detail our code porting efforts and evaluate various benchmarks on the Qualcomm Snapdragon SoC using tools developed through Cosmic Castle.
Cabrera, Anthony↗
PAO
PAO supports the formulation and analysis of mathematical models for complex optimization applications. This capability is commonly associated with algebraic modeling languages (AMLs), which support the description and analysis of mathematical models with a high-level language. PAO is derived from the Pyomo subpackage pyomo.bilevel, which has been deprecated. PAO supports the formulation and solution of optimization models that explicitly represent adversarial behavior. This includes variances of bilevel programming, including methods that represent challenging problems with discrete decisions and uncertain model parameters.
Hart, William↗
Optimization of Dry Storage Canister Cutting Operations - 20534
A recent project investigated the optimal cutting method for the opening of a welded dry storage/shielded canister (DSC) or dual purpose canister (DPC) containing Used Nuclear Fuel (UNF). Due to the lack of a disposal path for UNF in the U.S., the majority of UNF is currently moved into welded DSCs and DPCs designed by Orano TN, NAC, and Holtec. As the DSCs/DPCs were neither designed nor licensed for disposal and may not be able to be emplaced in a geologic repository due to physical emplacement constraints, near-term thermal limitations, or long-term criticality issues, the UNF in these existing DSCs/DPCs may need to be repackaged into transportation, aging, and disposal canisters (TADs), generic standard TADs (STADs), transportation casks, new cask/canister systems, and/or cask/canister/package systems suitable for disposal. These DSCs/DPCs may also be opened to simply remove the UNF in preparation for recycling, re-storage, or placement into a waste package suitable for disposal. Regardless of need, the DSCs/DPCs would require to be cut open by a potentially large scale operation. This project examined the multiple means for cutting welded metal systems and considered several factors to determine an optimal approach. Issues arose around some of the cutting approaches when applied to systems with 2 or 3 lids and with pre-cutting gas testing required. The resulting preferences in cutting methods with an optimized application for the opening of DSCs/DPCs are presented. (authors)
12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
Parallel simulated annealing with embedded machine learning and multifidelity models for reactor core design
This paper presents extensions to a penalty-free, parallel simulated annealing (SA) algorithm for multi-constrained combinatorial optimization with the aim of embedding multi-fidelity physics models into the annealing procedure. The method uses a low-fidelity, quickly executing model for rapid design space exploration and a high-fidelity model for detailed constraint resolution and on-the-fly bias correction. Machine learning models updated within the annealing procedure were used to bridge the gap between the multi-fidelity models, which led to accurate rapid exploration and efficient detailed constraint resolution. A software implementation of the new multi-fidelity optimization methods, called ML-PSA, was demonstrated on a continuous multi-fidelity optimization problem and a constrained combinatorial PWR lattice design problem. These problems demonstrate some of the features, parallel performance characteristics, and extensible nature of the multi-fidelity SA methods. This paper shows that the developed software and procedure are a general optimization tool that can be applied to a wide variety of scientific and engineering design optimization applications. (authors)
22 GENERAL STUDIES OF NUCLEAR REACTORS↗