Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Programming”

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 1,531 records · Page 85

Institutional Computing Annual Report - W11_Friction

The IC W11_Friction program has as a goal the fundamental understanding of the physical mechanisms which determine the macroscopic frictional force between ductile metals for arbitrary compressions and relative velocities. The high performance computing platforms have allowed detailed understanding of physical mechanisms: elasticity, anharmonicity of phonons, plastic deformation, phase transitions and melting, and grain structure including grain growth and refinement. The method used has been Non Equilibrium Molecular Dynamics (NEMD) using the SPaSM parallel code developed at LANL. The results of these simulations have resulted in a scaling model for the metal-metal frictional force.

36 MATERIALS SCIENCE↗

IRIS-MASH: Efficient Multi-device Asynchronous Multi-Stream Heterogeneous Computing

In the rapidly evolving field of high-performance computing (HPC), effectively leveraging heterogeneous devices through asynchronous task programming is paramount. This paper presents a robust asynchronous task programming model tailored for a multi-device, multi-stream execution environment that incorporates a diverse array of heterogeneous computing units, including GPUs from various vendors and other accelerators. Current state-of-the-art task programming models provide methodologies to support asynchronous task executions, but they typically handle homogeneous devices using native programming languages, while support for heterogeneous devices is limited to frameworks like OpenCL. This gap presents significant challenges in abstracting heterogeneous devices to harness their true asynchronous capabilities effectively using their native programming languages. By implementing asynchronous task execution, our model significantly boosts the performance of tiled algorithm task graphs through overlapping data transfers with computation and enabling the simultaneous execution of multiple kernels. We integrate this approach into a heterogeneous Intelligent Runtime System (IRIS) and assess its performance using a suite of tiled algorithm benchmarks from the heterogeneous math kernels library (MatRIS) based on IRIS. Experimental results demonstrate a performance improvement ranging from 1.6 × to 2 × over IRIS without asynchronous support, and a notable 22% performance enhancement compared to established runtime systems such as StarPU and PaRSEC. This approach significantly improves computation efficiency of HPC workflows and provides a solid base for future exploration and development in the area of asynchronous task programming in heterogeneous systems.

Miniskar, Narasinga Rao [ORNL] (ORCID:000000018259↗

Tigres Workflow Library: Supporting Scientific Pipelines on HPC Systems

The growth in scientific data volumes has resulted in the need for new tools that enable users to operate on and analyze data on large-scale resources. In the last decade, a number of scientific workflow tools have emerged. These tools often target distributed environments, and often need expert help to compose and execute the workflows. Data-intensive workflows are often ad-hoc, they involve an iterative development process that includes users composing and testing their workflows on desktops, and scaling up to larger systems. In this paper, we present the design and implementation of Tigres, a workflow library that supports the iterative workflow development cycle of data-intensive workflows. Tigres provides an application programming interface to a set of programming templates i.e., sequence, parallel, split, merge, that can be used to compose and execute computational and data pipelines. We discuss the results of our evaluation of scientific and synthetic workflows showing Tigres performs with minimal template overheads (mean of 13 seconds over all experiments). We also discuss various factors (e.g., I/O performance, execution mechanisms) that affect the performance of scientific workflows on HPC systems.

97 MATHEMATICS AND COMPUTING↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the DAKOTA software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of DAKOTA-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of DAKOTA's iterative analysis capabilities.

99 GENERAL AND MISCELLANEOUS↗

Correction to Norm-conserving pseudopotentials and basis sets to explore Lanthanide chemistry in complex environments

Correction was made to the funding and acknowledgment: Funding V.-A.G. was supported by the U.S. Department of Energy, Office of Science, Basic Energy Sciences, Chemical Sciences, Geosciences, and Biosciences Division. R.R. and M.-T.N. were supported by the Laboratory Directed Research and Development Program at Pacific Northwest National Laboratory (PNNL) CheMSR Agile Investment. PNNL is operated by DE-AC05-76RLO01830. J.-B.L. and J.L. were supported by the National Natural Science Foundation of China (Nos. 21433005, 91645203, and 21590792). D.C.C. was supported by Research and Innovation at the University of Nevada, Reno. ACKNOWLEDGMENTS The research was performed using resources available through Research Computing at Pacific Northwest National Laboratory (PNNL), Tsinghua National Laboratory for Information Science and Technology and the Computational Chemistry Laboratory under Tsinghua Xuetang Talents Program, and University of Nevada, Reno High Performance Computing. J.- B.L. and J.L. acknowledge discussions with Dr. Yang-Gang Wang (Southern University of Science and Technology).

Lu, Jun-Bo↗

areaDetector: Software for 2-D Detectors in EPICS

areaDetector is a new EPICS module designed to support 2-D detectors. It is modular C++ code that greatly simplifies the task of writing support for a new detector. It also supports plugins, which receive detector data from the driver and process it in some way. Existing plugins perform Region-Of-Interest extraction and analysis, file saving (in netCDF, HDF, TIFF and JPEG formats), color conversion, and export to EPICS records for image display in clients like ImageJ and IDL. Drivers have now been written for many of the detectors commonly used at synchrotron beamlines, including CCDs, pixel array and amorphous silicon detectors, and online image plates.

99 GENERAL AND MISCELLANEOUS↗

Computational Determination of the Refractive Index of TATB, LLM-105, β-HMX, & α-RDX

In this study, we use Materials Studio CASTEP, an ab initio quantum mechanical (QM) program employing density functional theory (DFT), to compute the refractive index (RI) of solid energetic materials, specifically, PETN (tetragonal phase), TATB, LLM-105, β-HMX, and α-RDX. The use of quantum mechanical DFT methods affords the investigation of the optical mate rial properties of a system without the need for any experimental input. The RI values of PETN and TATB have been experimentally determined previously and are compared here to the QM derived RI values as validation of the theoretical approach in determining material optical proper ties. To date, experimental measurements to determine the RI values for LLM-105 have yet to be determined. This fact obviates the need to determine LLM-105 RI values using quantum mechanical means.

36 MATERIALS SCIENCE↗

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗

Navigating Large Chemical Spaces Using Graph Theory and Integer Programming

Navigating and analyzing large chemical spaces are necessary to accelerate the design and discovery of new molecules and chemical processes. In this work, we introduce a computational framework that integrates graph theory and integer programming to enable the efficient navigation of large chemical spaces. Our framework represents the chemical space as a graph, wherein nodes represent molecules and edges represent the degree of similarity or connectivity based on domain-specific information. Using the graph representation, we identify representative molecules by computing the so-called minimum dominating set (MDS), which in our context is the minimum set of molecules that is connected to all other molecules. We present a suite of solution strategies for the MDS problem including heuristic and rigorous integer programming (IP) approaches. We show that these approaches allow us to capture physicochemical properties and domain-specific logic and constraints, facilitating the identification of molecules with the target properties. We demonstrate the effectiveness of the proposed approach by navigating the chemical space of per- and polyfluoroalkyl substances (PFAS); this comprises approximately 15,000 molecular structures. We compare our framework against traditional dimensionality reduction and clustering methods such as t-SNE and K-means clustering.

Chemical structure↗

Bayesian Analysis of TRISO Fuel: Quantifying Model Inadequacy, Incorporating Lower-Length-Scale Effects, and Developing Parallel Active Learning Capabilities

The U.S. Department of Energy (DOE)’s Nuclear Energy Advanced Modeling and Simulation (NEAMS) program aims to develop predictive capabilities by applying computational methods to the analysis and design of advanced reactor and fuel-cycle systems. This program has been providing engineering-scale support for the continued development of BISON, a high-fidelity, high-resolution fuel performance tool. Fuel behavior in nuclear reactors is governed by a complex network of mechanisms that interact with various other physics aspects in the reactor system. Any model developed to represent fuel behavior will likely be idealized, resulting in uncertainties when comparing their predictions against the observed data. In Fiscal Year (FY)-23, we initiated the Uncertainty Quantification (UQ) work by using Bayesian methods to establish a level of model trustworthiness and further improve it, with a particular emphasis on TRI-Structural isOtropic (TRISO) nuclear fuel. This year, we further expanded on that UQ work by investigating an approach to quantifying model inadequacy and accounting for lower-length scale (LLS) effects in TRISO silver (Ag) release modeling. Furthermore, we are implementing parallel active learning capabilities to reduce the computational cost (i.e., required computational resources and elapsed time) of performing UQ. Specifically, we utilized The Kennedy O’Hagan framework for Bayesian uncertainty quantification (KOH) to account for model inadequacy in TRISO Ag release predictions made by BISON. The KOH framework represents an improvement over the standard Bayesian framework used in FY-23. Explicitly accounting for model inadequacy in the Bayesian framework helps establish the level of experimental noise uncertainty in the Advanced Gas Reactor (AGR) data. We compared the inverse UQ results obtained from both the standard Bayesian and KOH frameworks in light of the AGR-2/3/4 data, and also compared the predictive UQ results obtained from these two frameworks in light of the AGR-1 data. Next, we investigated the impact of considering LLS effects in the Ag release simulations. We developed an expanded database of LLS simulated effective diffusivities for Ag, covering a wide range of microstructures and temperatures. Using this database, we developed a framework for incorporating LLS effects into the engineering-scale Ag release UQ. We developed both parametric and non-parametric approaches for bridging the length scales. We then investigated the inverse UQ results in light of the AGR-2/3/4 data and the predictive UQ results in light of the AGR-1 data, and compared the LLS-informed approach and the Arrhenius equation, which does not include microstructure information. Finally, we discussed implementing parallel active learning capabilities in the Multiphysics Object Oriented Simulation Environment (MOOSE)/BISON to reduce the computational cost (i.e., computational resources and elapsed time) of Bayesian UQ. For verification purposes, we first tested these new capabil ities on a species interaction problem. We then demonstrated them on the TRISO Ag release application, showing that parallel active learning capabilities can enhance the accuracy of UQ while also substantially reducing the computational cost in comparison to the reference methods developed in FY-23.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Sufficient Stochastic Maximum Principle in a Regime-Switching Diffusion Model

We prove a sufficient stochastic maximum principle for the optimal control of a regime-switching diffusion model. We show the connection to dynamic programming and we apply the result to a quadratic loss minimization problem, which can be used to solve a mean-variance portfolio selection problem.

97 MATHEMATICS AND COMPUTING↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Scalable semidefinite programming approach to variational embedding for quantum many-body problems

In quantum embedding theories, a quantum many-body system is divided into localized clusters of sites which are treated with an accurate ‘high-level’ theory and glued together self-consistently by a less accurate ‘low-level’ theory at the global scale. The recently introduced variational embedding approach for quantum many-body problems combines the insights of semidefinite relaxation and quantum embedding theory to provide a lower bound on the ground-state energy that improves as the cluster size is increased. The variational embedding method is formulated as a semidefinite program (SDP), which can suffer from poor computational scaling when treated with black-box solvers. Here, we exploit the interpretation of this SDP as an embedding method to develop an algorithm which alternates parallelizable local updates of the high-level quantities with updates that enforce the low-level global constraints. Moreover, we show how translation invariance in lattice systems can be exploited to reduce the complexity of projecting a key matrix to the positive semidefinite cone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Programming Framework for Neuromorphic Systems with Emerging Technologies

Neuromorphic computing is a promising post-Moore's law era technology. A wide variety of neuromorphic computer (NC) architectures have emerged in recent years, ranging from traditional fully digital CMOS to nanoscale implementations with novel, beyond CMOS components. There are already major questions associated with how we are going to program and use NCs simply because of how radically different their architecture is as compared with the von Neumann architecture. When coupled with the implementations using emerging device technologies, which add additional issues associated with programming devices, it is clear that we must define a new way to program and develop for NC devices. In this work, we discuss a programming framework for NC devices implemented with emerging technologies. We discuss how we have applied this framework to program a NC system implemented with metal oxide memristors. We utilize the framework to develop two applications for the memristive NC device: a simple multiplexer and a simple control task (the cart-pole problem). Finally, we discuss how this framework can be extended to NC systems implemented with a variety of novel device components and materials.

Schuman, Catherine↗

Use of Neutron Flux Calculated by Shift in a Grizzly Reactor Pressure Vessel Fracture Simulation

The reactor pressure vessel (RPV) plays the critical role of containing the reactor and coolant in a light water reactor nuclear power plant, and must be able to safely perform this function under a variety of normal and off-normal transient loading conditions. The RPV is subjected to harsh environmental conditions (elevated temperature and high neutron flux) whenever the plant is operating, which leads to embrittlement of the steel over time. RPVs contain populations of flaws introduced during the manufacturing process, and the primary safety concern is that during a transient event, a fracture could initiate at the site of one of these flaws and lead to rupture of the RPV. RPVs are very rugged structures, and the probability of this occurring is very low, but as the RPV's steel becomes embrittled over time, its resistance to fracture decreases and this becomes more likely. Assessing the likelihood of RPV fracture during a transient event involves performing a probabilistic fracture mechanics analysis, in which random sampling procedures are used to assess the probability of fracture of a population of flaws. Grizzly offers unique capabilities for modeling the RPV using 1D, 2D, or 3D representations, taking advantage of parallel computing for this type of analysis. One of the important inputs to Grizzly is the spatial distribution of the neutron fluence, which has a large impact on the material embrittlement, and should thus be characterized as accurately as possible. The VERA core simulator developed by the CASL program takes advantage of high performance computing resources to perform high-fidelity multiphysics simulations of reactor physics, including the effects of neutron transport, fuel performance, and thermal hydraulics. Recently a capability was developed to also evaluate neutron fluxes away from the reactor core through the Shift code. This allows for a detailed 3D map of the spatial variation of the fluence in components such as the RPV to be computed, which is ideal for use with Grizzly. This report documents a procedure developed to use the fluences computed in Shift in a Grizzly simulation, which allows for improved realisim in the prediction of the effects of environmental exposure on propensity for reactor pressure vessel fracture. This capability demonstrated on RPVs with multiple types of configurations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

ATDM Data Management FY2015: Data Warehouse Progress Report

The Advanced Technology Development and Mitigation (ATDM) program at Sandia National Laboratories is a new effort to build next-generation simulation codes that will map well to upcoming exascale computing platforms. Rather than follow traditional single- program, multiple data (SPMD) programming techniques, ATDM is developing applications in an asynchronous many task (AMT) form that describes work as a graph of tasks that have data dependencies. The data management team is focused on developing a data warehouse for ATDM that will enable tasks to store and exchange data objects efficiently. This report summarizes the data management teams efforts during FY15, and documents: (1) an initial API and implementation for the data warehouses key/value store, (2) API requirements for use with ATDMs runtime, (3) initial requirements for storing ATDM-specific data, and (4) the current organization of software components that will be used by the data warehouse.

97 MATHEMATICS AND COMPUTING↗

EVOLUTION OF SPACE REACTOR QUALIFICATION METHODS AND A PATH FORWARD FOR NEW SPACE REACTORS UNDER CONSIDERATION

These slides outline the evolution of space reactor system qualifications and provide a potential framework for qualification of current space reactor concepts. Qualification approaches for SNAP 10A, SP-100, TOPAZ II, and Prometheus reactor systems will be discussed. Several qualification approaches from past reactors will be reviewed including: a component qualification approach demonstrated in the SNAP reactor program, a system level approach in the SP-100 program, adding additional features to an existing design in the TOPAZ program, and a combination of a computational and basic testing approach for the Prometheus reactor. Past and present test facilities will also be discussed and the impact of test facility availability (or existence) is discussed. A suggested approach that complies with the updated Presidential Directive (NSPM-20, August 2019) that is derived from previous program approaches will be discussed for qualification of future space reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Transportation Research and Analysis Computing Center (TRACC) Year 5 Quarter 4 Progress Report.

Argonne National Laboratory initiated a FY2006-FY2009 multi-year program with the US Department of Transportation (USDOT) on October 1, 2006, to establish the Transportation Research and Analysis Computing Center (TRACC). As part of the TRACC project, a national high performance computer user facility has been established, with full operations initiated in March 2008. The technical objectives of the TRACC project include the establishment of a high-performance computing center for use by USDOT research teams, including those from Argonne and their university partners, and the use of advanced computing and visualization facilities for the performance of focused computer research and development programs in areas of interest for USDOT. The project has been reauthorized for FY2010 and is now in its 5th year. The project will not receive additional funding through the SAFETEA-LU grant any longer but has been authorized to expend remaining FY2010 funds at Argonne to keep the TRACC facility operating at least until September 30, 2012.

Ley, H.↗