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 235 records · Page 13

Demonstrating GPU code portability and scalability for radiative heat transfer computations

High performance computing frameworks utilizing CPUs, Nvidia GPUs, and/or Intel Xeon Phis necessitate portable and scalable solutions for application developers. Nvidia GPUs in particular present numerous portability challenges with a different programming model, additional memory hierarchies, and partitioned execution units among streaming multiprocessors. This work presents modifications to the Uintah asynchronous many-task runtime and the Kokkos portability library to enable one single codebase for complex multiphysics applications to run across different architectures. Scalability and performance results are shown on multiple architectures for a globally coupled radiation heat transfer simulation, ranging from a single node to 16,384 Titan compute nodes.

Computer Science↗

Synthetic Proxy Infrastructure for Task Evaluation

The Synthetic Proxy Infrastructure for Task Evaluation is a proxy application designed to support application developers in gauging the performance of various task granularities when determining how best to utilize task based programming models.The infrastructure is designed to provide examples of common communication patterns with a synthetic workload intended to provide performance data to evaluate programming model and platform overheads for the purpose of determining task granularity for task decomposition purposes. This is presented as a reference implementation of a proxy application with run-time configurable input and output task dependencies ranging from an embarrassingly parallel scenario to patterns with stencil-like dependencies upon their nearest neighbors. Once all, if any, inputs are satisfied each task will execute a synthetic workload (a simple DGEMM of in this case) of varying size and output all, if any, outputs to the next tasks.The intent is for this reference implementation to be implemented as a proxy app in different programming models so as to provide the same infrastructure and to allow for application developers to simulate their own communication needs to assist in task decomposition under various models on a given platform.

Junghans, Christoph↗

Synthetic Proxy Infrastructure for Task Evaluation

The Synthetic Proxy Infrastructure for Task Evaluation is a proxy application designed to support application developers in gauging the performance of various task granularities when determining how best to utilize task based programming models.The infrastructure is designed to provide examples of common communication patterns with a synthetic workload intended to provide performance data to evaluate programming model and platform overheads for the purpose of determining task granularity for task decomposition purposes. This is presented as a reference implementation of a proxy application with run-time configurable input and output task dependencies ranging from an embarrassingly parallel scenario to patterns with stencil-like dependencies upon their nearest neighbors. Once all, if any, inputs are satisfied each task will execute a synthetic workload (a simple DGEMM of in this case) of varying size and output all, if any, outputs to the next tasks.The intent is for this reference implementation to be implemented as a proxy app in different programming models so as to provide the same infrastructure and to allow for application developers to simulate their own communication needs to assist in task decomposition under various models on a given platform.

Junghans, Christoph↗

Special Issue on Data-Intensive Scalable Computing Systems

Traditional high performance computing (HPC) systems were designed from a compute-centric perspective, with an emphasis on high floating point performance. As scientific and analytics applications become more data intensive, there is a need to rethink HPC system architectures, programming models, runtime systems, and tools with a focus on scalable data intensive computing. Industry approaches supporting data intensive applications have been highly successful, leading many in the HPC community to search for ways to adapt them to HPC hardware and software contexts. Conversely, industry looks to the HPC community for their expertise in designing, deploying, and using extremely large and high performance computing systems. This special issue contains seven articles, each of which is an extended version of a paper presented in the 2015 International Workshop on Data Intensive Scalable Computing Systems (DISCS-2015) held in Austin, Texas on November 15, 2015. The workshop program included papers that ranged from programming models to systems software to storage, each with a strong focus on data intensive computing.

97 MATHEMATICS AND COMPUTING↗

Two-stage minimax stochastic unit commitment

The study proposes a stochastic optimisation approach based on discrete scenarios and the minimax criterion to deal with demand uncertainty in the two-stage unit commitment problem. To avoid making an over-conservative decision, the approach is designed to assign a probability-based weight to each demand scenario and provide a unit commitment schedule that minimises the maximum possible-weighted generation cost. Unit commitment is determined in the first stage and the economic dispatch under the scenario that corresponds to the maximum possible-weighted generation cost is determined in the second stage. The problem is formulated as a type of min-max-min mixed integer programming model. By introducing an auxiliary variable, the model is further transformed into a minimisation problem. A Benders decomposition algorithm is developed to solve the problem. The Benders master problem determines the unit commitment decision, while the Benders subproblem determines the dispatch decision. Multiple Benders feasibility cuts are constructed when the Benders subproblem is infeasible. Valid inequalities are derived to improve the lower bound provided by the Benders master problem. Numerical results show the performance of the algorithm.

Che, Ping↗

The nth-plant scenario for blended feedstock conversion and preprocessing nationwide: biorefineries and depots

The sustainability of the biofuel industry depends on the development of a mature conversion technology on a national level that can take advantage of the economies of scale: the nth-plant. Defining the future location and supply logistics of conversion plants is imperative to ultimately transform the nation’s renewable biomass resources into cost-competitive, high-performance feedstock for production of biofuels and bioproducts. Since the US has put restrictions on production levels of conventional biofuels from edible resources, the nation needs to plan for the widespread accessibility and development of the cellulosic biofuel scenario. Conventional feedstock supply systems will be unable to handle cellulosic biomass nationwide, making it essential to expand the industry with an advanced feedstock supply system incorporating a distributed network of preprocessing depots and conversion plants, or biorefineries. Current studies are mostly limited to designing supply systems for specific regions of the country. We developed a national database with potential locations for depots and biorefineries to meet the nation’s target demand of cellulosic biofuel. Blended feedstock with switchgrass and corn stover (harvested by either a two- or three-pass method) are considered in a Mixed Integer Linear Programming model to deliver on-spec biomass that considers both, a desired quantity and quality at the biorefinery. A total delivered feedstock cost that is less than $79.07/dt (2016$) is evaluated for years 2022, 2030, and 2040. In 2022, 124 depots and 59 biorefineries could be supplied with 42.8 million dt of corn stover and switchgrass. In 2030 and 2040, the total accessible biomass could increase to 215% and 393% respectively when compared to 2022. However, an $8/dry tons reduction in targeted delivery cost could reduce total accessible biomass by 67%. Kansas, Nebraska, South Dakota and Texas were identified as potential states with a strong biofuel economy given that they had six or more biorefineries located in all scenarios. In some scenarios, Colorado, Alabama, Georgia, Minnesota, Mississippi and South Carolina would greatly benefit from a depot network as these could only deliver to a biorefinery in a nearby state. To elaborate the impact of a nationwide consideration, the findings were compared with existing literature for different US regions. We also present results for biorefinery capacities that are double, triple, and quadruple in size.

09 BIOMASS FUELS↗

A global coupled ensemble data assimilation system using the Community Earth System Model and the Data Assimilation Research Testbed

In this paper, we present a description of the CESM/DART ensemble coupled data assimilation (DA) system based on the Community Earth System Model (CESM) and the Data Assimilation Research Testbed (DART) assimilation software. The CESM/DART should be viewed as a flexible system to support the DA needs of the CESM research community and not as a static reanalysis product. In this implementation of the CESM/DART, conventional insitu observations of the ocean and atmosphere are assimilated into the respective component models of the CESM using a 30-member ensemble adjustment Kalman filter (EAKF). CESM/DART is run in a “weakly coupled” configuration wherein observations native to each climate system component only directly impact the state vector for that component. Information is passed between components indirectly through the short-term coupled model forecasts that provide the EAKF background ensemble. This system leverages previous ensemble DA development for the Community Atmosphere Model and Parallel Ocean Program models using the DART EAKF. The CESM/DART project is a step towards providing increasingly useful DA capabilities for the CESM research community. Results are presented for our prototype 12-year reanalysis, run from 1970 to mid 1982. Multiple lines of evidence demonstrate that the system is capable of constraining the CESM coupled model to simulate the historical variability of the climate system in the well-observed Northern Hemisphere. A collection of monthly average variables, climate mode indices, observation diagnostics and snapshots of synoptic weather in the ocean and atmosphere are compared to established datasets, showing especially good agreement in the Northern Hemisphere. A discussion of the CESM/DART as a modular, community facility and the benefits and challenges associated with this vision is also included.

54 ENVIRONMENTAL SCIENCES↗

An Asynchronous Many-Task Implementation of In-Situ Statistical Analysis using Legion.

In this report, we propose a framework for the design and implementation of in-situ analy- ses using an asynchronous many-task (AMT) model, using the Legion programming model together with the MiniAero mini-application as a surrogate for full-scale parallel scientific computing applications. The bulk of this work consists of converting the Learn/Derive/Assess model which we had initially developed for parallel statistical analysis using MPI [PTBM11], from a SPMD to an AMT model. In this goal, we propose an original use of the concept of Legion logical regions as a replacement for the parallel communication schemes used for the only operation of the statistics engines that require explicit communication. We then evaluate this proposed scheme in a shared memory environment, using the Legion port of MiniAero as a proxy for a full-scale scientific application, as a means to provide input data sets of variable size for the in-situ statistical analyses in an AMT context. We demonstrate in particular that the approach has merit, and warrants further investigation, in collaboration with ongoing efforts to improve the overall parallel performance of the Legion system.

Pebay, Philippe Pierre↗

Milestone Completion Report STCO04-1 AAPS: engagements with code teams, vendors, collaborators, developers

The Advanced Architecture and Portability Specialists team (AAPS) worked with a select set of LLNL application teams to develop and/or implement a portability strategy for next-generation architectures. The team also investigated new and updated programming models and helped develop programming abstractions targeting maintainability and performance portability. Significant progress was made on both fronts in FY17, resulting in multiple applications being significantly more prepared for the nextgeneration machines than before.

97 MATHEMATICS AND COMPUTING↗

Distributionally Robust Building Load Control to Compensate Fluctuations in Solar Power Generation

This paper investigates the use of a collection of dispatchable heating, ventilation and air conditioning (HVAC) systems to absorb low-frequency fluctuations in renewable energy sources, especially in solar photo-voltaic (PV) generation. Given the uncertain and time-varying nature of solar PV generation, its probability distribution is difficult to be estimated perfectly, which poses a challenging problem of how to optimally schedule a fleet of HVAC loads to consume as much as local PV generation. We formulate a distributionally robust chance-constrained (DRCC) model to ensure that PV generation is consumed with a desired probability for a family of probability distributions, termed as an ambiguity set, built upon mean and covariance information. We benchmark the DRCC model with a deterministic optimization model and a stochastic programming model in a one-day simulation. We show that the DRCC model achieves constantly good performance to consume most PV generation even in the case with the presence of probability distribution ambiguity.

Zhang, Yiling↗

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↗

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↗

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↗