Search NASA⌕ Search

SEARCH · Search NASA

Results for “Programming Models”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
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 OSTI2016

Asynchronous Runtimes in Action: An Introspective Framework for a Next Gen Runtime

One of the most critical challenges that new high performance systems face is the lack of system software support for these large scale systems. Investment on system stack components is essential in the development, debugging and optimization of the new emerging programming models. These emerging models have the promise to better utilize the vast hardware resources available in current and future systems. To aid in the development of applications and new system stacks, runtimes, as instances of their respective execution models, need to produce facilities to introspect their inner workings and allow an indepth attribution of performance bottlenecks and computational patterns. In other words, the runtime systems need to reduce their opacity to observers so that users of a novel program execution model can adapt their designs to fit the intended model usage, regardless of the layer that they are working on. This design/development loop (akin to co-design) enables synergistic opportunities across the entire computational stack. This paper presents the design and implementation of a simple “gray” box performance attribution harness running inside a fine grain runtime system: the Open Community Runtime (OCR). We showcase what such a framework can indicate regarding the runtime behavior while running at scale. To this end, we have designed a set of synthetic scenarios aimed to test the runtime at their best and worst cases. We present an analysis of the most important runtime features, properties and idiosyncrasies that will affect the development of new runtime features, algorithmic selection, and application development.

high performance distributed runtimes↗
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 OSTI2016

Delivering Science on Day One

While benchmarking software is useful for testing the performance limits and stability of Argonne National Laboratory’s new Theta supercomputer, there is no substitute for running real applications to explore the system’s potential. The Argonne Leadership Computing Facility’s Theta Early Science Program, modeled after its highly successful code migration program for the Mira supercomputer, has one primary aim: to deliver science on day one. Here is a closer look at the type of science problems that will be getting early access to Theta, a next-generation machine being rolled out this year.

Williams, Timothy J.↗
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 OSTI2015

Global Arrays

Global Arrays (GA) is a distributed-memory programming model that allows for shared-memory-style programming combined with one-sided communication, to create a set of tools that combine high performance with ease-of-use. GA exposes a relatively straightforward programming abstraction, while supporting fully-distributed data structures, locality of reference, and high-performance communication. GA was originally formulated in the early 1990’s to provide a communication layer for the Northwest Chemistry (NWChem) suite of chemistry modeling codes that was being developed concurrently.

global arrays↗
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↗
DOE OSTI2019

Improving Ligand Geometry in Protein Data Bank Structures Computationally

Information about the three‐dimensional structures of complex biological molecules is an indispensable research tool for many fields of study, including biology, chemistry, pharmacology, and computer science. The Protein Data Bank (PDB) is an public digital archive providing access to structures of nucleic acids, proteins, and large macromolecular machines determined experimentally by X‐ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, and 3‐dimensional electron microscopy (3DEM). PDB structures undergo validation for structural plausibility upon their deposition into the PDB using the program Mogul, which cross references each deposited structure against similar data in the Cambridge Structural Database (CSD). Ligands associated with PDB structures are a common source of structural inaccuracy. In this study, a programmatic pipeline was developed to determine if ligand geometric accuracy could be improved using known computational tools. Ligands with dubious geometry were identified through a Python mining code. A sample set of the identified structures was remodeled into minimum energy conformations using the molecular dynamics program AMBER and then fit to the original experimental density maps using the molecular modeling program Coot. The refined models were compared to the original models in the PDB as well as to similar structures in the CSD using the deposition statistical validation server. Preliminary results suggest that the pipeline effectively identifies and improves ligand structures that possess inaccurate geometry. This method can be used to evaluate and improve the accuracy of specific ligands in structures both archived and pending deposition. Support or Funding Information This work was supported by an NSF REU and the RCSB PDB [NSF (DBI‐1338415), NIH, and DOE.] This abstract is from the Experimental Biology 2019 Meeting. There is no full text article associated with this abstract published in The FASEB Journal .

Miller, Beck↗
DOE OSTI2016

The Uranium from Seawater Program at the Pacific Northwest National Laboratory: Overview of Marine Testing, Adsorbent Characterization, Adsorbent Durability, Adsorbent Toxicity, and Deployment Studies

The Pacific Northwest National Laboratory’s (PNNL) Marine Science Laboratory (MSL) located along the coast of Washington State is evaluating the performance of uranium adsorption materials being developed for seawater extraction under realistic marine conditions with natural seawater. Two types of exposure systems were employed in this program: flow-through columns for testing of fixed beds of individual fibers and pellets and a recirculating water flume for testing of braided adsorbent material. Testing consists of measurements of the adsorption of uranium and other elements from seawater as a function of time, typically 42 to 56 day exposures, to determine the adsorbent capacity and adsorption rate (kinetics). Analysis of uranium and other trace elements collected by the adsorbents was conducted following strong acid digestion of the adsorbent with 50% aqua regia using either Inductively Coupled Plasma Optical Emission Spectrometry (ICP-OES) or Inductively Coupled Plasma Mass Spectrometer (ICP-MS). The ORNL 38H adsorbent had a 56 day adsorption capacity of 3.30 ± 0.68 g U/ kg adsorbent (normalized to a salinity of 35 psu), a saturation adsorption capacity of 4.89 ± 0.83 g U/kg of adsorbent material (normalized to a salinity of 35 psu) and a half-saturation time of 28 ± 10 days. The AF1 adsorbent material had a 56 day adsorption capacity of 3.9 ± 0.2 g U/kg adsorbent material (normalized to a salinity of 35 psu), a saturation capacity of 5.4 ± 0.2 g U/kg adsorbent material (normalized to a salinity of 35 psu) and a half saturation time of 23 ± 2 days. The ORNL amidoxime-based adsorbent materials are not specific for uranium, but also adsorb other elements from seawater. The major doubly charged cations in seawater (Ca and Mg) account for a majority of the cations adsorbed (61% by mass and 74% by molar percent). For the ORNL AF1 adsorbent material, U is the 4th most abundant element adsorbed by mass and 7th most abundant by molar percentage

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Locality-Aware Scheduling for Scalable Heterogeneous Environments

Heterogeneous computing promise boost performance of scientific applications by allowing massively parallel execution of computational tasks. However, manually managing extremely heterogeneous, multi-device systems is complicated and may result in sub-optimal performance. Specifically, data management is an extremely challenging problem on multi-device systems. In this work, we introduce two locality-aware schedulers for the Minos Computing Library (MCL), an asynchronous, task-based programming model and runtime for extremely heterogeneous systems. The first scheduler implements a pure locality-aware algorithm to maximize data reuse, though it might incur in ”hot-spots” that limit system utilization. The second scheduler mitigates this drawback by dynamically targeting between locality-awareness and system utilization based on the current workload and available computing devices. Our results show that locality-awareness greatly benefit applications that exhibit data reuse, providing up to 6.9x and 7.9x over the original MCL scheduler and equivalent OpenCL implementations, respectively. Moreover, our schedulers introduce negligible overhead compared with the original MCL scheduler and achieve similar performance for applications that don’t benefit from data locality.

Architecture, co-design, Task-based programming mo↗
DOE OSTI2023

Pair distribution function analysis of discrete nanomaterials in PDFgui

Pair distribution functions (PDFs) are a leading tool for atomic structure analysis of nanomaterials. However, the most widely used programs for refining atomic structure against PDF data are based on extended crystallographic models, which cannot be applied to discrete, whole nanoparticles. Furthermore, this work describes a straightforward approach to simulate and refine atomistic models of discrete clusters and nanoparticles employing widely used PDF modelling programs such as PDFgui that utilize extended crystallographic models. In this approach, the whole particle to be modelled is contained within an expanded, and otherwise empty, unit cell that is sufficiently large to avoid correlations between atoms in neighbouring unit cells over the r range analyzed. The PDF of the particle is simulated as a composite using two conventional `phases': one that calculates the atom–atom correlations and one that approximates the local number density. This approach is first validated for large nanoparticles that are well modelled by a conventional shape factor model, and then applied to simulate the PDF of discrete particles and low-dimensional materials (graphene and MXene) and to model the experimental PDF data for single-layer FeS nanosheets. A comparison of this approach with the DiffPy-CMI program, which calculates the PDF of discrete species, shows that the composite modelling approach is equally or more accurate. Example input files for implementing this approach within PDFgui and TOPAS, and recommendations for selecting model parameters for reliable application of this refinement strategy, are provided.

36 MATERIALS SCIENCE↗