Search NASA⌕ Search

SEARCH · Search NASA

Results for “programming model”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Optimal Operation of PV Sources in DC Grids for Improving Technical, Economical, and Environmental Conditions by Using Vortex Search Algorithm and a Matrix Hourly Power Flow

This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times.

14 SOLAR ENERGY↗
DOE OSTI2021

Educating HPC Users in the use of advanced computing technology

We examine a multi-modal approach to educating and training users of an advanced computing technology testbed at the Institute for Advanced Computational Science at Stony Brook University. Ookami provides researchers worldwide with access to 176 Fujitsu A64FX compute nodes, this being the same processor technology powering the Japanese Fugaku supercomputer, the fastest computer in the world since June 2020. However, achieving high-performance on this Arm-based, leadership computing technology requires that users be familiar with details of computer architecture, performance analysis and modeling, and high-performance programming models that are commonly omitted in introductory programming courses. Indeed, regardless of their seniority, many of the testbed users are surprisingly unfamiliar with basic concepts such as vectorization, pipelining, latency/bandwidth, roofline models, computing energy/power, threads, and non-uniform memory access. These same concepts also pervade mainstream x86 technologies, so this is of widespread concern. Due to the national/global nature of our user community that is also very diverse in both discipline and experience, the inability to offer formal classes, and our experience that most people do not tend to read online documentation or training materials in sufficient depth, we have consciously employed multiple approaches that heavily emphasize (online) personal interactions and transfer of skills. Online documentation has been organized around best-practices and FAQs; twice-weekly hackathons and office hours via Zoom enable deep dives by both the team and the user community with multiple broad benefits; a Slack channel provides both real time and archived answers and discussions; and workshops, training and webinars target community needs as they arise. Furthermore, the perspective that these tools are being used in an educational setting rather than just for project communication makes them more effective and contributes to community success.

A64FX↗
DOE OSTI2024

Community Solar Program Design Considerations & Modeling Inputs

Designing and modeling a community solar (CS) program is a complex process with numerous variable inputs that are interconnected. Modeling a CS program can be useful to inform the programs design itself while also providing stakeholders of all types with information. Accurate data inputs and assumptions are key to ensuring that a model is informative and as representative of real market conditions as possible. This report is an exploration of community solar program modeling considerations, especially as it relates to data inputs such as capital costs, administrative fees, and subscription size, using a CS program in North Carolina as a case study.

14 SOLAR ENERGY↗
DOE OSTI2021

TBAA20: Task-Based Algorithms and Applications

The new challenges posed by Exascale system architectures have resulted in difficulty achieving a desired scalability using traditional distributed ­memory runtimes. Task­-based programming models show promise in addressing these challenges, providing application developers with a productive and performant approach to programming on next generation systems. Empirical studies show that task-based models can overcome load ­balancing issues that are inherent to traditional distributed ­memory runtimes, and that task-­based runtimes perform comparably to those systems when balanced. This panel is designed to explore the advantages of task-­based programming models on modern and future HPC systems from an industry, university, and national lab perspective. It aims at gathering application experts and proponents of these models to present concrete and practical examples of using task­-based runtimes to overcome the challenges posed by Exascale system architectures. This report describes the objectives, activities, and outcomes of the panel TBAA: Task­-Based Algorithms and Applications which was held at the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC 20) on November 18, 2020.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Progress on HL-LHC Nb 3 Sn Magnets

The high-luminosity Large Hadron Collider (HL-LHC) project aims at allowing to increase the collisions in the LHC by a factor of ten in the decade 2025-2035. One essential element is the superconducting magnet around the interaction region points, where the large aperture magnets will be installed to allow to further reduce the beam size in the interaction point. The core of this upgrade is the Nb 3 Sn triplet, made up of 150-mm aperture quadrupoles in the range of 7-8 m. The project is being shared between the European Organization for Nuclear Research and the US Accelerator Upgrade Program, based on the same design, and on the two strand technologies. The project is ending the short model phase, and entering the prototype construction. We will report on the main results of the short model program, including the quench performance and field quality. A second important element is the 11 T dipole that replaces a standard dipole making space for additional collimators. The magnet is also ending the model development and entering the prototype phase. A critical point in the design of this magnet is the large current density, allowing increase of the field from 8 to 11 T with the same coil cross section as in the LHC dipoles. This is also the first two-in-one Nb 3 Sn magnet developed so far. We will report the main results on the test and the critical aspects.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Solar Field Layout and Aimpoint Strategy Optimization

The existing methods that determine heliostat aiming strategies for concentrating solar power (CSP) central receiver plants typically use heuristics and/or are computationally expensive, and they lack flexibility for different desired flux profiles and receiver geometries. Because of the interaction between layout and aimpoint strategy, considering the former without accounting for the latter may yield solutions with superfluous heliostats that cannot be used efficiently without compromising receiver flux constraints. To that end, we develop a software decision tool that uses innovative optimization methods to both optimize aimpoint strategies and improve candidate layouts for the solar collection field of a CSP central receiver plant. A CSP plant’s effectiveness relies on the optical efficiency of the solar field, which may be limited by losses due to (i) the cosine effect, (ii) atmospheric attenuation, (iii) interference (i.e., shading and blocking) between heliostats, (iv) spillage as a result of heliostat positioning and geometry, and (iv) some heliostats’ inability to direct irradiance to the receiver without damage due to excessive thermal flux. The goal of this work is to obtain optimized aiming strategies and improved solar field layouts that reduce capital cost and increase field optical efficiency and utilization, while meeting the power requirements of a given CSP receiver design. We formulate the aimpoint optimization problem as a mixed-integer linear programming model, which we then decompose into submodels that we solve in parallel. The decomposition subdivides the solar field into sections, and aimpoint strategies for each section are obtained independently of the others. To improve existing layouts, we develop a utilization-weighted efficiency metric that we use to relocate heliostats to sections of the solar field with similar efficiency and higher utilization. Finally, to connect our software to high-fidelity flux models, we develop a Python application programming interface for SolarPILOT, a mature software package that characterizes solar field performance and generates the heliostat layouts and flux maps that serve as input to our models.

14 SOLAR ENERGY↗
DOE OSTI2018

Direct numerical simulations of reacting flows with detailed chemistry using many-core/GPU acceleration

A new direct numerical simulation (DNS) code for multi-component gaseous reacting flows has been developed at KAUST, with the state-of-the-art programming model for next generation high performance computing platforms. The code, named KAUST Adaptive Reacting Flows Solver (KARFS), employs the MPI+X programming, and relies on Kokkos for “X” for performance portability to multi-core, many-core and GPUs, providing innovative software development while maintaining backward compatibility with established parallel models and legacy code. The capability and potential of KARFS to perform DNS of reacting flows with large, detailed reaction mechanisms is demonstrated with various model problems involving ignition and turbulent flame propagations with varying degrees of chemical complexities.

Computer Science↗
DOE OSTI2024

Decomposing a renewable energy design and dispatch model

We address a mixed-integer linear programming model which selects a cost-minimizing set of available technologies with which to design a renewable energy system and prescribe their associated dispatch decisions. Realistically sized instances of such models pose computational challenges. To this end, we develop a Lagrangian heuristic based on a decomposition methodology which partitions the model into blocks and optimizes these more manageable, smaller subproblems. It also provides a lower bound to assess solution quality. In conclusion, we apply this methodology to the National Renewable Energy Laboratory's Renewable Energy Integration and Optimization (REopt TM ) model to generate near-optimal solutions to realistic instances containing, on average, approximately 300,000 variables and at least as many constraints, with a mean 30% optimality gap improvement using a five-minute solution time limit, compared to directly solving the original monolith.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Distributed Load Restoration in Unbalanced Active Distribution Systems

We present that the resilience of modern power systems has been constantly threatened by various natural disasters and manmade attacks. Under those threats, fast and automatic restoration actions are critical for restoring impacted systems to normal operating conditions and preventing from additional disastrous consequences. Smart grid technologies, such as distributed energy resources (DERs) and microgrids, provide both opportunities and challenges for distribution system restoration. In this paper, distributed load restoration (DLR), in unbalanced active distribution networks is developed using the alternating direction method of multipliers (ADMM) algorithm. The step-by-step restoration actions are provided to schedule the output of DERs and distribution system control devices, as well as the power consumption from transmission system restoration. The nonlinearities from three-phase unbalanced power flow and distribution components modeling are relaxed into a convex quadratic programming model. Then, the problem is decomposed into subproblems for each node by applying ADMM-DLR; and solves through each agent by exchanging limited information with neighboring nodes in an iterative procedure. The developed models and algorithms are validated and demonstrated through testing of the IEEE 13-node and 123-node test feeders. Lastly, simulation results demonstrate the effectiveness of restoring unbalanced distribution system with the hybrid bottom-up and top-down restoration strategies.

14 SOLAR ENERGY↗
DOE OSTI2019

Graph Algorithms in PGAS: Chapel and UPC++

The Partitioned Global Address Space (PGAS) programming model can be implemented «««< HEAD either with programming language features or with runtime library APIs, each implementation favoring different aspects (e.g., productivity, abstraction, flexibility, or performance). Certain language and runtime features, such as collectives, explicit and asynchronous communication primitives, and constructs facilitating overlap of communication and computation (such as futures and conjoined futures) can enable better performance and scaling for irregular applications, in particular for distributed graph analytics. We compare graph algorithms in one of each of these environments: the Chapel PGAS programming language and the UPC++ PGAS runtime library. We implement algorithms for breadth-first search and triangle counting graph kernels in both environments. We discuss the code in each of the environments, and compile performance data on a Cray Aries and an Infiniband platform. Our results show that the library-based approach of UPC++ currently provides strong performance while Chapel provides a high-level abstraction that, harder to optimize, still provides comparable performance. We argue that various language primitives and runtime library features should be considered in conjunction with each other to design future graph analytics libraries so as to incorporate the best of both worlds.

Distributed Algorithms, Graph algorithms, HPC↗
DOE OSTI2024

Building research capacity in Southern Appalachian mountain wetlands

This project increased research capacity in Southern Appalachian wetlands by facilitating new collaborations between the PI (UNC Asheville) and DOE and academic research partners. Mountain wetlands are among the rarest natural communities in the Southern Appalachians; most of the sites contain rare or endangered species and have been incorporated into or are being considered for the new Mountain Bogs National Wildlife Refuge (established in 2015). PI Wilcox’s research since 2010 has focused on wetland hydrology at over a dozen priority field sites in western North Carolina, eastern Tennessee, and northern Georgia. This project provided time and funding to learn about DOE programs and resources, including meteorological data, watershed modeling programs, analytical capabilities, and computing facilities. PI Wilcox was able to meet potential research partners at professional conferences and the DOE-BER-ESS PI meeting and invite several of those potential partners to visit UNC Asheville and nearby field sites in Western North Carolina. These connections have resulted in three new collaborative research proposals, and a new cooperative agreement with the US Fish and Wildlife Service that includes two new field sites.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Dispatch Optimization, System Design and Cost Benefit Analysis of a Nuclear Reactor with Molten Salt Thermal Storage

Variable renewable energy availability has increased the volatility in energy prices in most markets. Nuclear power plants, with a large ratio of capital to variable costs, have historically operated as base load energy suppliers but the need for more flexible operation is increasing. We simulate the techno-economic performance of a 950 MWt nuclear power plant, based on the Westinghouse lead-cooled fast reactor, coupled with molten salt thermal storage as a method for flexible energy dispatch. We use the System Advisor Model to model the nuclear reactor thermal power input and power cycle operating modes. We combine this robust engineering model with a mixed-integer linear program model for optimized dispatch scheduling. We then simulate the coupled nuclear and thermal storage system under different market scenarios with varying price volatility. We find that the coupled plant outperforms the base plant under markets where energy price peaks fluctuate by a factor of two or more about the mean price. We show that a calculated power purchase agreement price for the plant improves by up to 10% when operating under California energy market conditions. Sensitivity analysis on the thermal storage cost shows that the optimal design remains unchanged even when doubling costs.

25 ENERGY STORAGE↗
DOE OSTI2024

Research Highlight - Dispatch Optimization, System Design and Cost Benefit Analysis of a Nuclear Reactor with Molten Salt Thermal Storage

We highlight our work from our previous publication titled "Dispatch Optimization, System Design, and Cost Benefit Analysis of a Nuclear Reactor with Molten Salt Thermal Storage" published in MDPI Energies 2022 (doi.org/10.3390/en15103599). Variable renewable energy availability has increased the volatility in energy prices in most markets. Nuclear power plants, with a large ratio of capital to variable costs, have historically operated as base load energy suppliers but the need for more flexible operation is increasing. We simulate the techno-economic performance of a 950 MWt nuclear power plant, based on the Westinghouse lead-cooled fast reactor, coupled with molten salt thermal storage as a method for flexible energy dispatch. We use the System Advisor Model to model the nuclear reactor thermal power input and power cycle operating modes. We combine this robust engineering model with a mixed-integer linear program model for optimized dispatch scheduling. We then simulate the coupled nuclear and thermal storage system under different market scenarios with varying price volatility. We find that the coupled plant outperforms the base plant under markets where energy price peaks fluctuate by a factor of two or more about the mean price. We show that a calculated power purchase agreement price for the plant improves by up to 10% when operating under California energy market conditions. Sensitivity analysis on the thermal storage cost shows that the optimal design remains unchanged even when doubling costs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Simulated execution of hybrid quantum computing systems

We use modeling and simulation to study the behavior and performance of hybrid quantum computing systems. Our approach is based on a layered design with abstract machine models, which identify the key components and interfaces for quantum processing units, quantum programming models, and hybrid execution models. We use discrete-event simulating to track the dynamical state of hierarchical abstract machine models while executing test programs, and we collect statistics on time and energy consumption to forecast the resources required by quantum processors for future scientific computation.

Humble, Travis↗