Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Scalable Failure Masking for Stencil Computations using Ghost Region Expansion and Cell to Rank Remapping

In order to achieve exascale systems, application resilience needs to be addressed. Some programming models, such as task-DAG (directed acyclic graphs) architectures, currently embed resilience features whereas traditional SPMD (single program, multiple data) and message-passing models do not. Since a large part of the community's code base follows the latter models, it is still required to take advantage of application characteristics to minimize the overheads of fault tolerance. To that end, this paper explores how recovering from hard process/node failures in a local manner is a natural approach for certain applications to obtain resilience at lower costs in faulty environments. In particular, this paper targets enabling online, semitransparent local recovery for stencil computations on current leadership-class systems as well as presents programming support and scalable runtime mechanisms. Also described and demonstrated in this paper is the effect of failure masking, which allows the effective reduction of impact on total time to solution due to multiple failures. Furthermore, we discuss, implement, and evaluate ghost region expansion and cell-to-rank remapping to increase the probability of failure masking. To conclude, this paper shows the integration of all aforementioned mechanisms with the S3D combustion simulation through an experimental demonstration (using the Titan system) of the ability to tolerate high failure rates (i.e., node failures every five seconds) with low overhead while sustaining performance at large scales. In addition, this demonstration also displays the failure masking probability increase resulting from the combination of both ghost region expansion and cell-to-rank remapping.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Performing fully parallel constraint logic programming on a quantum annealer

A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially outperforming classical computing systems. However, despite quantum annealers having recently become commercially available, there are relatively few high-level programming models that target these devices. In this article, we show how to compile a subset of Prolog enhanced with support for constraint logic programming into a two-local Ising-model Hamiltonian suitable for execution on a quantum annealer. In particular, we describe the series of transformations one can apply to convert constraint logic programs expressed in Prolog into an executable form that bears virtually no resemblance to a classical machine model yet that evaluates the specified constraints in a fully parallel manner. We evaluate our efforts on a 1,095-qubit D-Wave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Lowering and Runtime Support for Fortran’s Multi-Image Parallel Features using LLVM Flang, PRIF, and Caffeine

This paper provides an overview of the multi-image parallel features in Fortran 2023 and their implementation in the LLVM flang compiler and the Caffeine parallel runtime library. The features of interest support a Single-Program, Multiple-Data (SPMD) programming model based on executing multiple “images”, each of which is a program instance. The features also support a Partitioned Global Address Space (PGAS) in the form of “coarray” distributed data structures. The paper discusses the lowering of multi-image features to the Parallel Runtime Interface for Fortran (PRIF) and the implementation of PRIF in the Caffeine parallel runtime library. This paper also provides an early view into the design of a new multi-image dialect of the LLVM Multi-Level Intermediate Representation (MLIR). We describe validation and testing of the resulting software stack, and demonstrate that performance compares favorably to another open-source compiler and runtime library: GNU Compiler Collection (GCC) gfortran and OpenCoarrays, respectively.

Bonachea, Dan↗
DOE OSTI2021

Dynamic Ride-Matching for Large-Scale Transportation Systems

Efficient dynamic ride-matching (DRM) in large-scale transportation systems is a key driver in transport simulations to yield answers to challenging problems. Although the DRM problem is simple to solve, it quickly becomes a computationally challenging problem in large-scale transportation system simulations. Therefore, this study thoroughly examines the DRM problem dynamics and proposes an optimization-based solution framework to solve the problem efficiently. To benefit from parallel computing and reduce computational times, the problem’s network is divided into clusters utilizing a commonly used unsupervised machine learning algorithm along with a linear programming model. Then, these sub-problems are solved using another linear program to finalize the ride-matching. At the clustering level, the framework allows users adjusting cluster sizes to balance the trade-off between the computational time savings and the solution quality deviation. A case study in the Chicago Metropolitan Area, U.S., illustrates that the framework can reduce the average computational time by 58% at the cost of increasing the average pick up time by 26% compared with a system optimum, that is, non-clustered, approach. Another case study in a relatively small city, Bloomington, Illinois, U.S., shows that the framework provides quite similar results to the system-optimum approach in approximately 62% less computational time.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2015

ExaSAT: An exascale co-design tool for performance modeling

One of the emerging challenges to designing HPC systems is understanding and projecting the requirements of exascale applications. In order to determine the performance consequences of different hardware designs, analytic models are essential because they can provide fast feedback to the co-design centers and chip designers without costly simulations. However, current attempts to analytically model program performance typically rely on the user manually specifying a performance model. Here we introduce the ExaSAT framework that automates the extraction of parameterized performance models directly from source code using compiler analysis. The parameterized analytic model enables quantitative evaluation of a broad range of hardware design trade-offs and software optimizations on a variety of different performance metrics, with a primary focus on data movement as a metric. Finally, we demonstrate the ExaSAT framework’s ability to perform deep code analysis of a proxy application from the Department of Energy Combustion Co-design Center to illustrate its value to the exascale co-design process. ExaSAT analysis provides insights into the hardware and software trade-offs and lays the groundwork for exploring a more targeted set of design points using cycle-accurate architectural simulators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Energy Efficiency and Conservation Block Grant (EECBG): Better Buildings Neighborhood Program Final Report

The Neighbor to Neighbor Energy Challenge (N2N) brought together a consortium of 14 leading clean energy rural, suburban, and low income communities throughout Connecticut. N2N was awarded $4.2 million from the U.S. Department of Energy (DOE) competitive BetterBuildings Neighborhood Program on August 10, 2010 to run a two-year pilot program (plus one year of transition and evaluation) (Award No. EMCBC- 00969-10). N2N tested innovative program models and hypotheses for improving Connecticut’s existing residential energy efficiency programs that are overseen by the ratepayer fund board and administered by CT utilities. N2N’s original goal was to engage 10 percent of households in participating communities to reduce their energy usage by 20 percent through energy upgrades and clean energy measures. N2N planned for customers to complete more comprehensive whole-home energy efficiency and clean energy measures and to achieve broader penetration than existing utility-administered regulated programs. Since this was an ARRA award, we report the following figures on job creation in Table 1. Since N2N is not continuing in its current form, we do not provide figures on job retention. Table 1 N2N Job Creation by Quarter Jobs Created 2010 Q4 6.65 2011 Q1 7.13 2011 Q2 4.98 2011 Q3 9.66 2011 Q4 5.43 2012 Q1 11.11 2012 Q2 6.85 2012 Q3 6.29 2012 Q4 6.77 2013 Q1 5.57 2013 Q2 8.35 2013 Q3 6.52 Total 85.31 The N2N team encountered several gaps in the existing efficiency program performance that hindered meeting N2N’s and DOE’s short-term program goals, as well as the State of Connecticut’s long-term energy, efficiency, and carbon reduction goals. However, despite the slow program start, N2N found evidence of increasing upgrade uptake rates over time, due to delayed customer action of one to two years from N2N introduction to completion of deeper household upgrades. Two main social/behavioral principles have contributed to driving deeper upgrades in CT: 1. Word of mouth, where people share their experience with others, which leads to others to take action; and 2. Self-herding, where people follow past behavior, which leads to deeper and deeper actions within individual households.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2014

OpenARC: Extensible OpenACC Compiler Framework for Directive-Based Accelerator Programming Study

Directive-based, accelerator programming models such as OpenACC have arisen as an alternative solution to program emerging Scalable Heterogeneous Computing (SHC) platforms. However, the increased complexity in the SHC systems incurs several challenges in terms of portability and productivity. This paper presents an open-sourced OpenACC compiler, called OpenARC, which serves as an extensible research framework to address those issues in the directive-based accelerator programming. This paper explains important design strategies and key compiler transformation techniques needed to implement the reference OpenACC compiler. Moreover, this paper demonstrates the efficacy of OpenARC as a research framework for directive-based programming study, by proposing and implementing OpenACC extensions in the OpenARC framework to 1) support hybrid programming of the unified memory and separate memory and 2) exploit architecture-specific features in an abstract manner. Porting thirteen standard OpenACC programs and three extended OpenACC programs to CUDA GPUs shows that OpenARC performs similarly to a commercial OpenACC compiler, while it serves as a high-level research framework.

Lee, Seyong↗
DOE OSTI2020

Grimsel Test Site - A Successful International Underground Research Laboratory for Many Decades - 20429

For more than 35 years, Nagra and its partners from around the world have been conducting underground research projects at the Grimsel Test Site (GTS, www.grimsel.com) to contribute to the development and confirmation of safe geological disposal concepts and for the characterization of suitable host rock formations. Over the years, the results of this internationally recognized research program have been, and continue to be, incorporated directly into exploration programs, modelling, safety, and engineering feasibility studies on options for deep geological repositories. Each project of the GTS program involves field-testing, laboratory studies, design and modelling tasks, and integrates all scientific and technical aspects. Each project phase is planned with a duration of three to five years to facilitate practical and administrative aspects and allow flexibility for updating the overall project plans with the latest findings. Scientific and engineering interaction among the different projects is ensured via an international steering committee meeting. Hosting an IAEA level C radiation- controlled zone, which allows use of radionuclides, including actinides such as thorium, uranium, neptunium, plutonium and americium, in in-situ experiments is one of the reasons why GTS also developed as a center of excellence for work with radioactive tracers under realistic in-situ boundary conditions. Last year, a new five-year program (2019 to 2023) started which includes projects with a planning horizon of decades. The new five-year program includes a new phase of in-situ experiments using radionuclides such as migration experiments in the Colloid Formation and Migration project (CFM), the Long-Term Diffusion experiment (LTD) and the newly established C-14 and I-129 Migration in cement project (CIM). The 'High Temperature effects on Bentonite' (HotBENT) project is starting in the current phase and is studying the effects of elevated temperatures (>175 deg. C) on bentonite materials. As a generic underground research laboratory (URL) it is expected that the GTS will provide in the coming years a platform for international collaboration, knowledge development and knowledge transfer for the next generation of scientists and engineers in the area of radioactive waste disposal and geosciences. A key role regarding knowledge transfer and training is provided by the well-established Grimsel Training Center (GTC), which (beside many URL related issues) also covers many general aspects of radioactive waste management. In this paper we provide an overview of the current program at the GTS, focusing on the experiments that study the migration of radionuclides through engineered barrier materials and the geosphere. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2015

Scaling to Nanotechnology Limits with the PIMS Computer Architecture and a new Scaling Rule

We describe a new approach to computing that moves towards the limits of nanotechnology using a newly formulated sc aling rule. This is in contrast to the current computer industry scali ng away from von Neumann's original computer at the rate of Moore's Law. We extend Moore's Law to 3D, which l eads generally to architectures that integrate logic and memory. To keep pow er dissipation cons tant through a 2D surface of the 3D structure requires using adiabatic principles. We call our newly proposed architecture Processor In Memory and Storage (PIMS). We propose a new computational model that integrates processing and memory into "tiles" that comprise logic, memory/storage, and communications functions. Since the programming model will be relatively stable as a system scales, programs repr esented by tiles could be executed in a PIMS system built with today's technology or could become the "schematic diagram" for implementation in an ultimate 3D nanotechnology of the future. We build a systems software approach that offers advantages over and above the technological and arch itectural advantages. Firs t, the algorithms may be more efficient in the conventional sens e of having fewer steps. Second, the algorithms may run with higher power efficiency per operation by being a better match for the adiabatic scaling ru le. The performance analysis based on demonstrated ideas in physical science suggests 80,000 x improvement in cost per operation for the (arguably) gene ral purpose function of emulating neurons in Deep Learning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Efficient implementation of the many-body Reactive Bond Order (REBO) potential on GPU

The second generation Reactive Bond Order (REBO) empirical potential is commonly used to accurately model a wide range hydrocarbon materials. It is also extensible to other atom types and interactions. REBO potential assumes complex multi-body interaction model, that is difficult to represent efficiently in the SIMD or SIMT programming model. Hence, despite its importance, no efficient GPGPU implementation has been developed for this potential. Here we present a detailed description of a highly efficient GPGPU implementation of molecular dynamics algorithm using REBO potential. The presented algorithm takes advantage of rarely used properties of the SIMT architecture of a modern GPU to solve difficult synchronizations issues that arise in computations of multi-body potential. Techniques developed for this problem may be also used to achieve efficient solutions of different problems. The performance of proposed algorithm is assessed using a range of model systems. It is compared to highly optimized CPU implementation (both single core and OpenMP) available in LAMMPS package. These experiments show up to 6x improvement in forces computation time using single processor of the NVIDIA Tesla K80 compared to high end 16-core Intel Xeon processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Geomagnetic Disturbance Uncertainty Quantification Modeling: An Electromagnetic Transient and Steady-State Simulation Based Approach

Geomagnetic disturbances have been shown to disrupt the operation of the bulk electrical system through low-frequency effects in the earth's magnetic field that in turn induce changing electrical fields on the earth's surface. As a result, geomagnetically induced currents flow in transmission lines, introducing the risk for widespread damage to high-voltage transformers and voltage collapse due to induced reactive power loss. In a previous paper, the authors showed how certain modeling assumptions can lead to results that are unacceptable in certain edge case scenarios. In this paper, the authors build on their previous results using modeling uncertainty quantification in order to compare the results from electromagnetic transient program modeling software, ATP, to the positive-sequence calculation software, PowerWorld.

Bretas, Arturo Suman↗
DOE OSTI2025

FY25 Report on Water NSTF Testing: Parametric and Accident Testing with Lower Tank Inlet

The Natural Convection Shutdown Heat Removal Test Facility (NSTF) at Argonne National Laboratory has continued to generate empirical validation data on the performance of water-based reactor cavity cooling system (RCCS) for seven years. This data is actively being used to support the development of passive decay heat removal systems for advanced reactors. Distinguishing this facility are 1) the large, ½ scale of the facility and 2) its governance under an NQA-1 qualified program for producing data of the highest pedigree for advanced reactor designers and regulators. In addition to the experimental activities discussed in this report, a computational modeling program continues to support the experimental program and further accuracy and understanding of the computational models. Together, the experimental and computational work create a mutually beneficial relationship integral to the overall program objective of advancing the understanding of the RCCS technology.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Dispatch optimization of a concentrating solar power system under uncertain solar irradiance and energy prices

The integration of thermal energy storage into a concentrating solar power system allows for mitigating some of the risk associated with uncertain solar irradiance and uncertain energy prices. We solve a 48 h dispatch optimization model with continually updated conditional point forecasts of both direct normal irradiance (DNI) and electricity prices with a rolling-horizon scheme at hourly resolution over the course of a year. Joint, conditional forecasts for DNI and prices are formed using an autoregressive moving-average time series model with exogenous weather predictors. We guide dispatch using a mixed-integer programming model, but in order to evaluate performance we use the System Advisor Model (SAM) of the National Renewable Energy Laboratory. SAM is a techno-economic simulation model that accounts for plant thermodynamics with higher fidelity. Our conditional DNI forecasts improve annual revenue by 4%–12% over using historical forecasts based on data from previous years. Conditional price forecasts improve annual revenue by 6%–19% in the real-time market over analogous historical forecasts. Updating these forecasts every six hours, rather than every 24 h, further improves annual revenue by 5%–6%. Here, we also investigate a method that values terminal inventory in our dispatch optimization model, again when used in a rolling-horizon scheme.

14 SOLAR ENERGY↗
DOE OSTI2020

Combining Three-Dimensional Modeling with Artificial Intelligence to Increase Specificity and Precision in Peptide–MHC Binding Predictions

The reliable prediction of the affinity of candidate peptides for the MHC is important for predicting their potential antigenicity and thus influences medical applications, such as decisions on their inclusion in T cell–based vaccines. In this study, we present a rapid, predictive computational approach that combines a popular, sequence-based artificial neural network method, NetMHCpan 4.0, with three-dimensional structural modeling. We find that the ensembles of bound peptide conformations generated by the programs MODELLER and Rosetta FlexPepDock are less variable in geometry for strong binders than for low-affinity peptides. In tests on 1271 peptide sequences for which the experimental dissociation constants of binding to the well-characterized murine MHC allele H-2D b are known, by applying thresholds for geometric fluctuations the structure-based approach in a standalone manner drastically improves the statistical specificity, reducing the number of false positives. Furthermore, filtering candidates generated with NetMHCpan 4.0 with the structure-based predictor led to an increase in the positive predictive value (PPV) of the peptides correctly predicted to bind very strongly (i.e., Kd < 100 nM) from 40 to 52% (p = 0.027). The combined method also significantly improved the PPV when tested on five human alleles, including some with limited data for training. Overall, an average increase of 10% in the PPV was found over the standalone sequence-based method. The combined method should be useful in the rapid design of effective T cell–based vaccines.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2026

Demand response event simulator and risk-aware bidding tool for industrial customers

Incentive Based Demand Response (IBDR) program participation delivers financial benefits to the consumers and resiliency benefits to the electricity grid. Effectively participating in these programs as an industrial consumer requires bidding strategies that balance financial risk with operational constraints. Existing bidding tools tend not to fully incorporate stochastic IBDR event modeling, program specific baseline and payment/penalty calculations, or demand reduction process control schemes that account for the cascading impacts of shutdown in complex facilities. Here, this work presents an IBDR event simulator and risk-aware bidding framework tool integrating three key components: a flexible, parameterized demand response event generator that rigorously accounts for program structures and stochasticity, a demand response operational simulation model that generates explicit control strategies for load reduction, and a Monte Carlo simulator to evaluate financial risk for varied capacity bids. A case study at a wastewater treatment plant participating in PG&E's Capacity Bidding Program demonstrates the framework's utility. In the peak capacity price month of August, optimal bidding by the wastewater treatment plant nets a mean IBDR benefit of $101,000 (67% of the August electricity bill) with 0.4% probability of a financial loss. This framework enables industrial operators to make informed bidding decisions, negotiate better program terms with demand response load aggregators, and analyze energy flexibility investments at their facilities. Ultimately, this work reduces participation barriers in IBDR programs and supports the broader goal of enhancing grid reliability and renewable energy integration.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Optimal charging management and infrastructure planning for free-floating shared electric vehicles

Recently, major car-sharing service providers have begun to include electric vehicles (EVs) in free-floating car-sharing fleets. For these EVs, downtime due to charging, including time spent traveling to and waiting in queues at charging stations in a sparse charging infrastructure network, is a major barrier to sustainable operation. An intuitive solution to overcome this barrier is to increase the number of fast-charging stations in the fleet service area. This paper studies the relationship between fleet vehicle downtime and the number of charging stations by modeling the fleet operations of a major car-sharing service provider. An integer programming model is developed that jointly optimizes charging station allocation, in terms of the number and location of charging stations, and the assignment of EVs to charging stations. Case study results showed that fleet vehicle charging time comprises 72-75% of the total downtime spent on charging trips. This indicates that charging time, as opposed to travel time or waiting time, is the dominant component of total fleet downtime for charging. The study also shows that by adding 5 to 20 new charging stations reduces total fleet downtime and travel time during charging trips by 2-4% and 26-49%, respectively. Although adding new charging stations to the fleet service area reduces total charging trip travel time significantly, it does not reduce total downtime significantly. Results also show that if the EV battery state of the charge (SOC) threshold—below which a charging trip is initiated—is less than 18%, not all EVs in the car-sharing fleet can be charged using the existing direct current fast chargers (DCFCs) in the fleet’s service area. Furthermore, this implies that adequate charging infrastructure coverage is required to ensure that EVs of a given range can operate in the car-sharing fleet.

25 ENERGY STORAGE↗
DOE OSTI2012

Supporting the Global Arrays PGAS Model Using MPI One-Sided Communication

The industry-standard Message Passing Interface (MPI) provides one-sided communication functionality and is available on virtually every parallel computing system. However, it is believed that MPI’s one-sided model is not rich enough to support higher-level global address space parallel programming models. We present the first successful application of MPI one-sided communication as a runtime system for a PGAS model, Global Arrays (GA). This work has an immediate impact on users of GA applications, such as NWChem, who often must wait several months to a year or more before GA becomes available on a new architecture. We explore challenges present in the application of MPI-2 to PGAS models and motivate new features in the upcoming MPI-3 standard. The performance of our system is evaluated on several popular high-performance computing architectures through communication benchmarking and application benchmarking using the NWChem computational chemistry suite.

ARMCI↗