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.

SourceResearch connectionFrom yearThrough year

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

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Optimizing design and dispatch of a resilient renewable energy microgrid for a South African hospital

Lack of access to reliable energy is a major concern for countries in sub-Saharan Africa. The national grids are unable to consistently satisfy demand. Therefore, users turn to distributed generation systems in the form of back-up generators. However, such systems are usually designed based on a rule of thumb. We employ a mixed-integer linear programming model that considers several options such as renewable energy, combined heat and power, and storage technologies, in addition to those on-site, to provide optimal design and dispatch decisions that minimize total cost. We apply this model to a case study for a hospital in South Africa, considering its need for reliable electricity in light of multiple outages that might occur over the course of a year, as well as its high heating and cooling loads. Our results show that optimal design and dispatch decisions for the distributed generation system address reliability challenges, regardless of the time at which they occur. And, these solutions yield millions of dollars in savings, suggesting that technologies such as the absorption chiller may be overlooked in typical designs; its integration can reduce demand charges even in the absence of combined heat and power. We show that total cost is most sensitive to changes in site electrical demand, followed by capital cost, fuel cost, photovoltaic production, and monthly demand charges; changes in fuel cost primarily affect system sizes of combined heat and power and the absorption chiller, while photovoltaic system size is more sensitive to the changes in capital and fuel costs, photovoltaic resource availability, and hourly electrical demand. Finally, an outage simulator demonstrates the ability of our optimized system to sustain with no interruptions in power five-hour outages with probability 1.0 and ten-hour outages with probability 0.65, significant improvements over 0.5 and 0.0, respectively, under a business-as-usual case.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

An improved method for direct incident solar radiation calculation from hourly solar insolation data in building energy simulation

Solar radiation considerably influences the energy consumption of buildings and the power production of building integrated photovoltaic (BIPV) systems. Hourly solar insolation (Wh/m 2 ), represented as the amount of solar irradiance collected on the ground during a 1-h period, is the most common solar radiation data available and widely used in weather files applied in building energy modeling programs (BEMPs). Because the solar beam and position vary over time, the use of hourly insolation data as the input might result in errors in the estimation of the direct incident solar radiation on a particular surface. In this study, methods used in BEMPs for direct incident solar radiation calculations are first analyzed, and an improved method adopting a new algorithm for estimating the solar irradiance is proposed. Furthermore, the algorithm assumes that the solar irradiance changes linearly within a 1-h period and can be estimated based on the solar irradiance at the half clock and slope. The collected direct normal solar irradiance data of 2016 from eight solar radiation stations in China were used to demonstrate the proposed method and evaluate its performance by comparing the results with those from three conventional methods used in BEMPs along with the ground truth measurements. In addition, in this study, factors affecting the accuracy of the calculation results are explored. The results of the estimated direct incident solar radiation show that the proposed method achieves the best accuracy, followed by the methods used in DOE-2, EnergyPlus, and DeST. The proposed method guarantees that the hourly direct solar insolation will remain the same and reflects the variation in the direct solar irradiance across a 1-h time frame. The proposed method can be adopted in BEMPs to improve the accuracy of the solar radiation calculation, thereby improving the accuracy of the simulated building performance and the BIPV production.

14 SOLAR ENERGY↗

DOE OSTI2020

Optimization of harvest and logistics for multiple lignocellulosic biomass feedstocks in the northeastern United States

A mixed-integer linear programming model was developed to optimize the multiple biomass feedstock supply chains, including feedstock establishment, harvest, storage, transportation, and preprocessing. The model was applied for analyses of multiple biomass feedstocks at county level for 13 states in the northeastern United States. In the base case with a demand of 180,000 dry Mg/year of biomass, the delivered costs ranged from $\$67.90$ to $\$86.97$ per dry Mg with an average of $\$79.58$ /dry Mg. The biomass delivered costs by county were from $\$67.90$ to 150.81 per dry Mg across the northeastern U.S. Considered the entire study area, the delivered cost averaged $\$85.30$ /dry Mg for forest residues, $\$84.47$ /dry Mg for hybrid willow, $\$99.68$ for switchgrass and $\$97.87$ per dry Mg for Miscanthus. Seventy seven out of 387 counties could be able to deliver biomass at $84 per dry Mg or less a target set by US DOE by 2022. A sensitivity analysis was also conducted to evaluate the effects of feedstock availability, feedstock price, moisture content, procurement radius, and facility demand on the delivered cost. Lastly, our results showed that procurement radius, facility capacity, and forest residue availability were the most sensitive factors affecting the biomass delivered costs.

09 BIOMASS FUELS↗

DOE OSTI2020

Development of a CPU/GPU portable software library for Lagrangian–Eulerian simulations of liquid sprays

The Lagrangian–Eulerian method is widely used for simulations of fuel sprays in turbulent combustion because of the advantage of treating the spray droplets as discrete points. One challenge of the Lagrangian–Eulerian method is the intense computational requirement when tracking the large number of Lagrangian particles needed for high fidelity. We have developed a performance-portable library, Grit, to track the Lagrangian particles in parallel on central processing unit (CPU) and graphics processing unit (GPU) accelerated high performance computing (HPC) architectures. Grit is a C++ library which employs Message Passing Interface (MPI) for distributed memory parallelism and Kokkos programming model for on-node shared memory parallelism with performance portability across different architectures of GPUs and multi-core/manycore CPUs. The parallel algorithms, key parallel kernels, and their performances on the pre-exascale supercomputer, Summit, are presented. Grit is coupled with a direct numerical simulation (DNS) solver, S3D, for multiphase simulations. A conservative formulation has been developed and implemented in Grit for phase coupling with thermodynamic consistency. The formulation separates the conservation of mass, momentum and energy from the physical models to prevent accidental violation of conservation laws due to inconsistent models. The formulation also enforces consistent definitions of enthalpies of the fuel for both phases and the latent heat of evaporation. Finally, simulations of turbulent particle-laden flow and the evaporation of dilute turbulent spray jet are performed to verify the software implementation, and to demonstrate the scalability of Grit for large-scale multiphase simulations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Parallel physics-informed neural networks via domain decomposition

Here we develop a distributed framework for the physics-informed neural networks (PINNs) based on two recent extensions, namely conservative PINNs (cPINNs) and extended PINNs (XPINNs), which employ domain decomposition in space and in time-space, respectively. This domain decomposition endows cPINNs and XPINNs with several advantages over the vanilla PINNs, such as parallelization capacity, large representation capacity, efficient hyperparameter tuning, and is particularly effective for multi-scale and multi-physics problems. Here, we present a parallel algorithm for cPINNs and XPINNs constructed with a hybrid programming model described by MPI + X, where X ∈ {CPUs, GPUs}. The main advantage of cPINN and XPINN over the more classical data and model parallel approaches is the flexibility of optimizing all hyperparameters of each neural network separately in each subdomain. We compare the performance of distributed cPINNs and XPINNs for various forward problems, using both weak and strong scalings. Our results indicate that for space domain decomposition, cPINNs are more efficient in terms of communication cost but XPINNs provide greater flexibility as they can also handle time-domain decomposition for any differential equations, and can deal with any arbitrarily shaped complex subdomains. To this end, we also present an application of the parallel XPINN method for solving an inverse diffusion problem with variable conductivity on the United States map, using ten regions as subdomains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Spherical time-encoded radiation imaging simulations

Radiation source localization is important for nuclear nonproliferation and can be obtained using time-encoded imaging systems with unsegmented detectors. A scintillation crystal can be used with a moving coded-aperture mask to vary the detected count rate produced from radiation sources in the far field. The modulation of observed counts over time can be used to reconstruct an image with the known coded-aperture mask pattern. Current time-encoded imaging systems incorporate cylindrical coded-aperture masks and have limits to their fully coded imaging field-of-view. This work focuses on expanding the field-of-view to 4π by using a novel spherical coded-aperture mask. A regular icosahedron is used to approximate a spherical mask. This icosahedron consists of 20 equilateral triangles; the faces of which are each subdivided into four equilateral triangle-shaped voxels which are then projected onto a spherical surface, creating an 80-voxel coded-aperture mask. Furthermore, these polygonal voxels can be made from high-Z materials for gamma-ray modulation and/or low-Z materials for neutron modulation. In this work, we present Monte Carlo N-Particle (MCNP) simulations and simple models programmed in Mathematica to explore image reconstruction capabilities of this 80-voxel coded-aperture mask.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2020

Optimal planning of the joint placement of photovoltaic panels and green roofs under climate change uncertainty

Photovoltaic (PV) panels directly convert sunlight into electricity; but, sunlight also heats the panels, negatively impacting their efficiency. Green roofs are vegetative layers grown on rooftops, mainly to provide added insulation on the roof to save energy. Green roofs also cool near-surface air temperature. Hence, the joint installation of PV panels and green roofs may potentially lead to higher efficiency of PV panels in certain climates. We develop a two-stage stochastic programming model to optimally place PV panels and green roofs under climate change uncertainty to maximize the overall profit from energy generated and saved. We calibrate the model using the literature, industry reports, and the data from different, at times conflicting, climate projections. We then conduct a case study for a mid-size city in the U.S., perform extensive sensitivity and robustness analyses and provide insights.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2021

Evaluating MPI resource usage summary statistics

The Message Passing Interface (MPI) remains the dominant programming model for scientific applications running on today’s high-performance computing (HPC) systems. This dominance stems from MPI’s powerful semantics for inter-process communication that has enabled scientists to write applications for simulating important physical phenomena. MPI does not, however, specify how messages and synchronization should be carried out. Those details are typically dependent on low-level architecture details and the message characteristics of the application. Therefore, analyzing an application’s MPI resource usage is critical to tuning MPI’s performance on a particular platform. The result of this analysis is typically a discussion of the mean message sizes, queue search lengths and message arrival times for a workload or set of workloads. While a discussion of the arithmetic mean in MPI resource usage might be the most intuitive summary statistic, it is not always the most accurate in terms of representing the underlying data. In this paper, we analyze MPI resource usage for a number of key MPI workloads using an existing MPI trace collector and discrete-event simulator. Our analysis demonstrates that the average, while easy and efficient to calculate, is a useful metric for characterizing latency and bandwidth measurements, but may not be a good representation of application message sizes, match list search depths, or MPI inter-operation times. Additionally, we show that the median and mode are superior choices in many cases. We also observe that the arithmetic mean is not the best representation of central tendency for data that are drawn from distributions that are multi-modal or have heavy tails. Furthermore, the results and analysis of our work provide valuable guidance on how we, as a community, should discuss and analyze MPI resource usage data for scientific applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Measurement and analysis of GPU-accelerated applications with HPCToolkit

To address the challenge of performance analysis on the US DOE’s forthcoming exascale supercomputers, Rice University has been extending its HPCToolkit performance tools to support measurement and analysis of GPU-accelerated applications. To help developers understand the performance of accelerated applications as a whole, HPCToolkit’s measurement and analysis tools attribute metrics to calling contexts that span both CPUs and GPUs. To measure GPU-accelerated applications efficiently, HPCToolkit employs a novel wait-free data structure to coordinate monitoring and attribution of GPU performance. To help developers understand the performance of complex GPU code generated from high-level programming models, HPCToolkit constructs sophisticated approximations of call path profiles for GPU computations. To support fine-grained analysis and tuning, HPCToolkit uses PC sampling and instrumentation to measure and attribute GPU performance metrics to source lines, loops, and inlined code. To supplement fine-grained measurements, HPCToolkit can measure GPU kernel executions using hardware performance counters. To provide a view of how an execution evolves over time, HPCToolkit can collect, analyze, and visualize call path traces within and across nodes. Finally, on NVIDIA GPUs, HPCToolkit can derive and attribute a collection of useful performance metrics based on measurements using GPU PC samples. Here, we illustrate HPCToolkit’s new capabilities for analyzing GPU-accelerated applications with several codes developed as part of the Exascale Computing Project.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

OpenMP application experiences: Porting to accelerated nodes

As recent enhancements to the OpenMP specification become available in its implementations, there is a need to share the results of experimentation in order to better understand the OpenMP implementation’s behavior in practice, to identify pitfalls, and to learn how the implementations can be effectively deployed in scientific codes. We report on experiences gained and practices adopted when using OpenMP to port a variety of ECP applications, mini-apps and libraries based on different computational motifs to accelerator-based leadership-class high-performance supercomputer systems at the United States Department of Energy. Additionally, we identify important challenges and open problems related to the deployment of OpenMP. Through our report of experiences, we find that OpenMP implementations are successful on current supercomputing platforms and that OpenMP is a promising programming model to use for applications to be run on emerging and future platforms with accelerated nodes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Multi-GPU porting of a phase-change cascaded lattice Boltzmann method for three-dimensional pool boiling simulations

The Lattice Boltzmann method (LBM) has proven effective in simulating phase-change phenomena, such as melting, solidification, evaporation, and boiling. In this work, we develop a highly parallelized multi-GPU implementation of LBM for three-dimensional pool boiling simulations. The code is based on the OpenACC programming model, which enables the code to be deployed efficiently on multi-core CPUs, GPUs, and potentially other accelerators, without the need for architecture-specific rewrites. To support large-scale simulations, the domain is decomposed and distributed across multiple compute nodes using MPI. We demonstrate that the code exhibits excellent scaling properties, with ideal strong-scaling running with up to 256 GPUs on the MareNostrum5 cluster.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Techno-economic analysis and network design for CO 2 conversion to jet fuels in the United States

The conversion of carbon dioxide (CO 2 ) into jet fuel holds significant potential for reducing CO 2 emissions, providing an alternative to carbon-based resources, and offering a renewable means of energy storage. The objective of this study is to conduct a techno-economic analysis and optimize the supply chain network for converting CO 2 to jet fuel in the United States, aiming to minimize total costs while assessing the environmental and economic feasibility of two CO 2 conversion pathways. This first pathway is based on Fischer-Tropsch synthesis (FTS), and the other one is based on the valorization and upgrading of light methanol (MeOH). Incorporating spatial and techno-economic data, a mixed-integer linear programming model was developed to select source plants and conversion pathways, locations of conversion refinery sites, and the amount of captured CO 2 across the United States. The optimal results indicate that the FTS pathway is adopted at all selected refineries when the hydrogen price is 1000 dollars/t and the operating cost, mainly electricity used in conversion, is reduced to 5 % of its current level. Under this scenario, the total annual profit is 8 billion dollars, and the net carbon emissions are -88,783,284 tons. The sensitivity analyses reveal that the prices of electricity and hydrogen significantly contribute to total production costs. The CO 2 recycle percentage of the FTS pathway influences the choice of applied pathways at refineries. Additionally, a higher conversion rate holds a substantial promise for reducing the total production cost and can make the MeOH pathway a viable choice.

10 SYNTHETIC FUELS↗

DOE OSTI2021

Generation of low–latitude seamount–trapped waves: a case study of the Seychelles Plateau

Baroclinic seamount-trapped waves are thought to influence their surrounding ecosystem; however, trapped waves are not well-studied in near-equatorial settings, where stratification is strong and Burger numbers are large. Motivated by observations, we use daily output (2005-2009) from the global 0.1-degree Parallel Ocean Program Model (POP) to examine topographically trapped baroclinic waves around the Seychelles Plateau (S > 400) in the tropical Indian Ocean. These trapped waves are associated with velocity and temperature oscillations at periods of 15–16 days, similar to the dominant period of some equatorial Yanai waves. Energy flux maps using POP output suggest that quasi-biweekly equatorial Yanai waves excite trapped waves on the western and south-western flanks of the Seychelles Plateau, near the surface. Here, the anticyclonic energy flux associated with the trapped wave extends vertically throughout the water column and around most of the plateau circumference, diminishing on the eastern flank of the plateau. This work highlights the role that equatorial planetary waves and trapped waves play in facilitating energy redistribution, dissipation, and mixing in the tropical ocean.

58 GEOSCIENCES↗

DOE OSTI2021

Performance of CUDA Unified Memory in CMS Heterogeneous Pixel Reconstruction

The management of separate memory spaces of CPUs and GPUs brings an additional burden to the development of software for GPUs. To help with this, CUDA unified memory provides a single address space that can be accessed from both CPU and GPU. The automatic data transfer mechanism is based on page faults generated by the memory accesses. This mechanism has a performance cost, that can be with explicit memory prefetch requests. Various hints on the inteded usage of the memory regions can also be given to further improve the performance. The overall effect of unified memory compared to an explicit memory management can depend heavily on the application. In this paper we evaluate the performance impact of CUDA unified memory using the heterogeneous pixel reconstruction code from the CMS experiment as a realistic use case of a GPU-targeting HEP reconstruction software. We also compare the programming model using CUDA unified memory to the explicit management of separate CPU and GPU memory spaces.

Kortelainen, Matti J.↗

DOE OSTI2020

ddcMD: A fully GPU-accelerated molecular dynamics program for the Martini force field

We have implemented the Martini force field within Lawrence Livermore National Laboratory’s molecular dynamics program, ddcMD. The program is extended to a heterogeneous programming model so that it can exploit graphics processing unit (GPU) accelerators. In addition to the Martini force field being ported to the GPU, the entire integration step, including thermostat, barostat, and constraint solver, is ported as well, which speeds up the simulations to 278-fold using one GPU vs one central processing unit (CPU) core. A benchmark study is performed with several test cases, comparing ddcMD and GROMACS Martini simulations. The average performance of ddcMD for a protein–lipid simulation system of 136k particles achieves 1.04 µs/day on one NVIDIA V100 GPU and aggregates 6.19 µs/day on one Summit node with six GPUs. The GPU implementation in ddcMD offloads all computations to the GPU and only requires one CPU core per simulation to manage the inputs and outputs, freeing up remaining CPU resources on the compute node for alternative tasks often required in complex simulation campaigns.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Multi-level parallelization of quantum-chemical calculations

Here, strategies for multiple-level parallelizations of quantum-mechanical calculations are discussed, with an emphasis on using groups of workers for performing parallel tasks. These parallel programming models can be used for a variety ab initio quantum chemistry approaches, including the fragment molecular orbital method and replica-exchange molecular dynamics. Strategies for efficient load balancing on problems of increasing granularity are introduced and discussed. A four-level parallelization is developed based on a multi-level hierarchical grouping, and a high parallel efficiency is achieved on the Theta supercomputer using 131 072 OpenMP threads.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Static Graphs for Coding Productivity in OpenACC

The main contribution of this work is to increase the coding productivity for GPU programming by using the concept of Static Graphs. To do so, we have combined the new CUDA Graph API with the OpenACC programming model. We use as test cases a well-known and widely used problems in HPC and AI: the Particle Swarm Optimization. We complement the OpenACC functionality with the use of CUDA Graph, achieving accelerations of more than one order of magnitude, and a performance very close to a reference and optimized CUDA code. Finally, we propose a new specification to incorporate the concept of Static Graphs into the OpenACC specification.

Toledo, Leonel↗

DOE OSTI2025

SYCL for Performance Portability: Application Experience with Coupled Cluster Formalism in Quantum Chemistry on Exascale Systems

The exascale computing has brought unprecedented heterogeneity in node architectures, with systems such as Frontier and Aurora featuring diverse GPU accelerators, network connectivity among others. Ensuring performance portability across these platforms is a key challenge. To address this, we employ the SYCL programming model to develop portable, high-performance quantum chemistry workloads. As a representative application, we focus on the non-iterative Triples component of the coupled-cluster CCSD(T) method, a key driver in quantum chemistry. In this work, we report on our experience deploying SYCL-based implementations using both DPC++ and AdaptiveCPP across two flagship exascale platforms: OLCF Frontier with AMD MI250X GPUs and ALCF Aurora with Intel GPUs. Our results demonstrate that SYCL enables efficient, single-source implementations that scale to thousands of nodes, delivering performance on par with vendor-optimized HIP solutions. We highlight key insights into runtime behavior, kernel portability, and scaling characteristics, showing that SYCL offers a viable path for performance-portable computing.

Bagusetty, Abhishek [Argonne National Laboratory (↗