Search NASA⌕ Search

SEARCH · Search NASA

Results for “program optimizations”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,045 records · Page 58

Aligning parallel arrays to reduce communication

Axis and stride alignment is an important optimization in compiling data-parallel programs for distributed-memory machines. We previously developed an optimal algorithm for aligning array expressions. Here, we examine alignment for more general program graphs. We show that optimal alignment is NP-complete in this setting, so we study heuristic methods. This paper makes two contributions. First, we show how local graph transformations can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. Second, we give a heuristic that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. Our algorithms have been implemented; we present experimental results showing their effect on the performance of some example programs running on the CM-5.

Sheffler, Thomas J.↗

ROCOPT: A user friendly interactive code to optimize rocket structural components

ROCOPT is a user-friendly, graphically-interfaced, microcomputer-based computer program (IBM compatible) that optimizes rocket components by minimizing the structural weight. The rocket components considered are ring stiffened truncated cones and cylinders. The applied loading is static, and can consist of any combination of internal or external pressure, axial force, bending moment, and torque. Stress margins are calculated by means of simple closed form strength of material type equations. Stability margins are determined by approximate, orthotropic-shell, closed-form equations. A modified form of Powell's method, in conjunction with a modified form of the external penalty method, is used to determine the minimum weight of the structure subject to stress and stability margin constraints, as well as user input constraints on the structural dimensions. The graphical interface guides the user through the required data prompts, explains program options and graphically displays results for easy interpretation.

Rule, William K.↗

An optimization study to minimize surface distortions of a hoop-column antenna

An automated procedure to lessen the tedium of manual approach currently used to minimize surface distortions in a hoop/column antenna is studied. Three fundamental elements are used for the study: (1) The finite element analysis program is used to calculate the antenna surface distortions due to externally applied loads; (2) a general purpose optimization program is used to determine the set of control cable tensions which minimize the antenna surface distortions; and (3) another program is used to calculate the best fit parabola passing through a distorted antenna shape and to calculate the RMS distortion error. The interim results of this feasibility study are given.

Wrenn, G. A.↗

Performance Refactoring of Instrumentation, Measurement, and Analysis Technologies for Petascale Computing. The PRIMA Project

The growing number of cores provided by today’s high-­end computing systems present substantial challenges to application developers in their pursuit of parallel efficiency. To find the most effective optimization strategy, application developers need insight into the runtime behavior of their code. The University of Oregon (UO) and the Juelich Supercomputing Centre of Forschungszentrum Juelich (FZJ) develop the performance analysis tools TAU and Scalasca, respectively, which allow high-­performance computing (HPC) users to collect and analyze relevant performance data – even at very large scales. TAU and Scalasca are considered among the most advanced parallel performance systems available, and are used extensively across HPC centers in the U.S., Germany, and around the world. The TAU and Scalasca groups share a heritage of parallel performance tool research and partnership throughout the past fifteen years. Indeed, the close interactions of the two groups resulted in a cross-­fertilization of tool ideas and technologies that pushed TAU and Scalasca to what they are today. It also produced two performance systems with an increasing degree of functional overlap. While each tool has its specific analysis focus, the tools were implementing measurement infrastructures that were substantially similar. Because each tool provides complementary performance analysis, sharing of measurement results is valuable to provide the user with more facets to understand performance behavior. However, each measurement system was producing performance data in different formats, requiring data interoperability tools to be created. A common measurement and instrumentation system was needed to more closely integrate TAU and Scalasca and to avoid the duplication of development and maintenance effort. The PRIMA (Performance Refactoring of Instrumentation, Measurement, and Analysis) project was proposed over three years ago as a joint international effort between UO and FZJ to accomplish these objectives: (1) refactor TAU and Scalasca performance system components for core code sharing and (2) integrate TAU and Scalasca functionality through data interfaces, formats, and utilities. As presented in this report, the project has completed these goals. In addition to shared technical advances, the groups have worked to engage with users through application performance engineering and tools training. In this regard, the project benefits from the close interactions the teams have with national laboratories in the United States and Germany. We have also sought to enhance our interactions through joint tutorials and outreach. UO has become a member of the Virtual Institute of High-­Productivity Supercomputing (VI-­HPS) established by the Helmholtz Association of German Research Centres as a center of excellence, focusing on HPC tools for diagnosing programming errors and optimizing performance. UO and FZJ have conducted several VI-­HPS training activities together within the past three years.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Energy Resilience Assessment and Enhancement in Urban Communities: A Case Study in Detroit

This paper presents a data-driven framework for assessing and enhancing energy resilience in urban communities. The resilience assessment is based on two datasets: 1) annual aggregated power outage data and 2) 15-minute interval outage data. High-impact, low-probability (HILP) events are identified within these datasets to evaluate community resilience under extreme conditions. To enhance resilience, an optimization framework utilizing mixed integer linear programming is developed to determine the optimal sizing and placement of solar photovoltaic (PV) systems and battery energy storage systems (BESS). This method offers a cost-effective and practical solution for improving energy resilience in vulnerable communities. Furthermore, a case study of the City of Detroit in Michigan demonstrates the effectiveness of the framework through simulation and validation.

Energy resilience assessment↗

An intelligent allocation algorithm for parallel processing

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

Carroll, Chester C.↗

Sustainable hydrogen manufacturing via renewable-integrated intensified process for refueling stations

The widescale consumer adoption of hydrogen fuel cell electric vehicles (HFCEVs) is currently hindered by the high cost of small-scale hydrogen generation and the lack of extensive hydrogen refueling infrastructure. Natural gas-based hydrogen is cheaper when produced in large volumes but is also associated with high CO 2 emissions. To counter these challenges, we propose a hybrid approach where both natural gas and renewables are integrated in a synergistic manner using a dynamic process intensification technology that can be deployed on-site for meeting local demands of refueling stations. The technology is based on sorption enhanced steam methane reforming (SE-SMR) that utilizes a combination of reaction with in-situ CO 2 adsorption for enhancing process modularity, productivity and efficiency thereby outperforming conventional SMR at small scale. We develop a mixed integer linear programming (MILP)-based optimization framework for simultaneous design and scheduling of the SE-SMR process. The simultaneous optimization provides a synergistic combination whereby the renewables allow sustainable hydrogen manufacturing and the dynamic SE-SMR allows optimal use of the intermittency of the renewables. The U.S. nationwide analysis indicates that for futuristic renewable prices and a hydrogen production capacity of 2 ton/day, hydrogen can be produced at 50% less cost compared to the current cost of small-scale hydrogen generation. Finally, the city-wise analysis with varying hydrogen demand shows that even with just 5% HFCEV market penetration level, hydrogen production cost less than $3/kg can be obtained at small scales across the United States with even cheaper hydrogen for large cities.

08 HYDROGEN↗

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Characterization of the ITER CS conductor and projection to the ITER CS performance

The ITER Central Solenoid (CS) is one of the critical elements of the machine. The CS conductor went through an intense optimization and qualification program, which included characterization of the strands, a conductor straight short sample testing in the SULTAN facility at the Swiss Plasma Center (SPC), Villigen, Switzerland, and a single-layer CS Insert coil recently tested in the Central Solenoid Model Coil (CSMC) facility in QST-Naka, Japan. In this paper, we obtained valuable data in a wide range of the parameters (current, magnetic field, temperature, and strain), which allowed a credible characterization of the CS conductor in different conditions. Finally, using this characterization, we will make a projection to the performance of the CS in the ITER reference scenario.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dataset of theoretical multinary perovskite oxides

Perovskite oxides (ternary chemical formula ABO 3 ) are a diverse class of materials with applications including heterogeneous catalysis, solid-oxide fuel cells, thermochemical conversion, and oxygen transport membranes. However, their multicomponent (chemical formula $A_xA^{'}_{1-x}B_yB^{'}_{1-y}O_3$) chemical space is underexplored due to the immense number of possible compositions. To expand the number of computed $A_xA^{'}_{1-x}B_yB^{'}_{1-y}O_3$ compounds we report a dataset of 66,516 theoretical multinary oxides, 59,708 of which are perovskites. First, 69,407 $A_{0.5}A^{'}_{0.5}B_{0.5}B^{'}_{0.5}O_3$ compositions were generated in the a - b + a - Glazer tilting mode using the computationally-inexpensive Structure Prediction and Diagnostic Software (SPuDS) program. Next, we optimized these structures with density functional theory (DFT) using parameters compatible with the Materials Project (MP) database. Our dataset contains these optimized structures and their formation (ΔH f ) and decomposition enthalpies (ΔH d ) computed relative to MP tabulated elemental references and competing phases, respectively. This dataset can be mined, used to train machine learning models, and rapidly and systematically expanded by optimizing more SPuDS-generated $A_{0.5}A^{'}_{0.5}B_{0.5}B^{'}_{0.5}O_3$ perovskite structures using MP-compatible DFT calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Impurity transport studies at the HSX stellarator using active and passive CVI spectroscopy

The transport of carbon impurities has been studied in the helically symmetric stellarator experiment (HSX) using active and passive charge exchange recombination spectroscopy (CHERS). For the analysis of the CHERS signals, the STRAHL impurity transport code has been re-written in the python programming language and optimized for the application in stellarators. In addition, neutral hydrogen densities both along the NBI line of sight as well as for the background plasma have been calculated using the FIDASIM code. By using the basinhopping algorithm to minimize the difference between experimental and predicted active and passive signals, significant levels of impurity diffusion are observed. In this work, comparisons with neoclassical calculations from DKES/PENTA show that the inferred levels exceed the neoclassical transport by about a factor of four in the core and more than 100 times towards the plasma edge, thus indicating a high level of anomalous transport. This observation is in agreement with experimental heat diffusivites determined from a power balance analysis which exhibits strong anomalous transport as well.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Constraint of pionless EFT using two-nucleon spectra from lattice QCD

Finite-volume pionless effective field theory (FVEFT π/ ) at next-to-leading order (NLO) is used to analyze the two-nucleon lattice QCD spectrum of Ref. [1], performed at quark masses corresponding to a pion mass of approximately 800 MeV. Specifically, the effective theory is formulated in finite volume, and variational sets of wave functions are optimized using differential programming. Using these wave functions projected to the appropriate finite-volume symmetry group, variational bounds from FVEFT π/ are obtained for the ground state, as well as excited states. By comparison with the lattice QCD GEVP spectrum, different low energy constants (LECs) are constrained. Furthermore, relativistic corrections are incorporated, allowing for the s-d-wave mixing term in the deuteron channel.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Ancilla-Free Quantum Error Correction Codes for Quantum Metrology

Quantum error correction has recently emerged as a tool to enhance quantum sensing under Markovian noise. It works by correcting errors in a sensor while letting a signal imprint on the logical state. This approach typically requires a specialized error-correcting code, as most existing codes correct away both the dominant errors and the signal. To date, however, few such specialized codes are known, among which most require noiseless, controllable ancillas. We show here that such ancillas are not needed when the signal Hamiltonian and the error operators commute, a common limiting type of decoherence in quantum sensors. We give a semidefinite program for finding optimal ancilla-free sensing codes in general, as well as closed-form codes for two common sensing scenarios: qubits undergoing dephasing, and a lossy bosonic mode. Lastly, we analyze the sensitivity enhancement offered by the qubit code under arbitrary spatial noise correlations, beyond the ideal limit of orthogonal signal and noise operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Trilevel Model for Segmentation of the Power Transmission Grid Cyber Network

Network segmentation of a power grid's communication system can make the grid more resilient to cyberattacks. Here we develop a novel trilevel programming model to optimally segment a grid communication system, taking into account the actions of an information technology (IT) administrator, attacker, and grid operator. The IT administrator is allowed to segment existing networks, and the attacker is given a budget to inflict damage on the grid by attacking the segmented communication system. Finally, the grid operator can redispatch the grid after the attack to minimize damage. The resulting problem is a trilevel interdiction problem that we solve using a branch and bound algorithm for bilevel problems. We demonstrate the benefits of optimal network segmentation through case studies on the 9-bus Western System Coordinating Council (WSCC) system and the 30-bus IEEE system. These examples illustrate that network segmentation can significantly reduce the threat posed by a cyberattacker.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Impacts of Integrating Topology Reconfiguration and Vehicle-to-Grid Technologies on Distribution System Operation

Autonomous electric vehicles (AEVs) provide unique opportunities to cope with the uncertainties of distributed energy generation in distribution networks. But the effects are limited by both inherent radial topology and the behaviors of decentralized AEVs. As such, we investigate the potential benefits of dynamic distribution network reconfiguration (DDNR), taking into account AEVs' spatial-temporal availability and their charging demand. We propose a mixed integer programming model to optimally coordinate the charging/discharging of AEVs with DDNR, while satisfying AEVs' original travel plan. Numerical studies based on a test system overlaying the IEEE 33-node test feeder and Sioux Falls transportation network show that DDNR and AEV complement each other, which improves the operation of the distribution system. We also conduct sensitivity analyses on inputs including renewable fluctuation and AEVs penetration level.

33 ADVANCED PROPULSION SYSTEMS↗

WE-A-19A-01: SRT I: Comparison of SRT Techniques

Within the past several years, the field of radiosurgery has seen numerous technological enhancements, including new dedicated devices for stereotactic delivery, the use of re-locatable frames to facilitate fractionated delivery and the image guided frameless approaches. The goal of this symposium is to compare and contrast competing technologies for cranial SRS/SRT. The symposium will open with a review of the general concept of cranial SRS/SRT procedures as well as describe the key differences from conventional radiotherapy. The speakers will then review each of the delivery technique (Gamma Knife, CyberKnife and Conventional linear accelerator) in turn. The focus of each speaker will be to describe the general workflow of each SRS modality, indications and counterindications for treatment. To compare and contrast different technologies, 2–3 cases examples demonstrating interesting treatment situations and expected outcomes, a sample treatment plan (either live or pre-recorded with live commentary) demonstrating the treatment planning technique, and machine and patient-specific QA required for treatment (if applicable). Additionally, workflows and data describing the use of immobilization devices or tracking/monitoring during SRS/SRT delivery will also be discussed. The session will close with a roundtable discussion of methods to evaluate plan quality, and achievable technical and clinical goals for intracranial SRS. Learning Objectives: Understand the key differences between cranial SRS/SRT and conventional treatments. Review Gamma Knife, CyberKnife and Conventional Linac-based radiosurgery delivery techniques and quality assurance Compare and contrast treatment plans, treatment planning strategy and and quality assurance procedures for each technology. Be able to establish cranial SRS/SRT procedure with optimized quality assurance program for each technology.

60 APPLIED LIFE SCIENCES↗

Spectral Peak Enhancement by Combining Trusted Response Elements via Machine Learning (SPECTRE-ML) v0.8.0

SPECTRE-ML (Spectral Peak Enhancement by Combining Trusted Response Elements via Machine Learning) is a machine learning based program for finding optimal clusters of radiation detector segments (i.e., pixels or voxels) in order to improve spectral performance. It provides facilities for pre-processing and analyzing training datasets, running ML algorithms, and evaluating and visualizing outputs. SPECTRE-ML outperforms simpler ad-hoc segmentation methods such as uniform depth clusters, learning detector performance trends such as dead layers, edge effects, and gain shifts. Although extensible to arbitrary highly-segmented spectroscopic radiation detectors, SPECTRE-ML currently focuses on improving spectral performance in highly-segmented CdZnTe (CZT) detectors for International Atomic Energy Agency (IAEA) non-destructive assay (NDA) safeguards tasks.

Vavrek, Jayson↗