Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Systems”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms

The simulation of large nonlinear dynamical systems, including systems generated by discretization of hyperbolic partial differential equations, can be computationally demanding. Such systems are important in both fluid and kinetic computational plasma physics. This motivates exploring whether a future error-corrected quantum computer could perform these simulations more efficiently than any classical computer. In this work, we describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) and detail three specific cases of this method that correspond to previously studied mappings. Then we explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation). Using a number of qubits only logarithmic in the number of variables of the nonlinear system, a quantum computer could simulate truncated systems to approximate output quantities if the nonlinearity is sufficiently weak. Other aspects of the computational efficiency of the three detailed embedding strategies are also discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Ultra-large-scale ab initio quantum chemical computation of bio-molecular systems: The case of spike protein of SARS-CoV-2 virus

The COVID-19 pandemic poses a severe threat to human health with an unprecedented social and economic disruption. Spike (S) glycoprotein of the SARS-CoV-2 virus is pivotal in understanding the virus anatomy, since it initiates the first contact with the ACE2 receptor in the human cell. We report results of ab initio computation of the spike protein, the largest ab initio quantum chemical computation to date on any bio-molecular system, using a divide and conquer strategy by focusing on individual structural domains. In this approach we divided the S-protein into seven structural domains: N-terminal domain (NTD), receptor binding domain (RBD), subdomain 1 (SD1), subdomain 2 (SD2), fusion peptide (FP), heptad repeat 1 with central helix (HR1-CH) and connector domain (CD). The entire Chain A has 14,488 atoms including the hydrogen atoms but excluding the amino acids with missing coordinates based on the PDB data (ID: 6VSB). The results include structural refinement, ab initio calculation of intramolecular bonding mechanism, 3- dimensional non-local inter-amino acid interaction with implications for the inter-domain interaction. Details of the electronic structure, interatomic bonding, partial charge distribution and the role played by hydrogen bond network are discussed. In the interaction among structural domains, we present new insights for crucial hinge-like movement and fusion process. Extension of such calculation to the interface between the S-protein binding domain and ACE2 receptor can provide a pathway for computational understanding of mutations and the design of therapeutic drugs to combat the COVID-19 pandemic.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Accelerating computational fluid dynamics simulation of post-combustion carbon capture modeling with MeshGraphNets

Packed columns are commonly used in post-combustion processes to capture CO 2 emissions by providing enhanced contact area between a CO 2 -laden gas and CO 2 -absorbing solvent. To study and optimize solvent-based post-combustion carbon capture systems (CCSs), computational fluid dynamics (CFD) can be used to model the liquid–gas countercurrent flow hydrodynamics in these columns and derive key determinants of CO 2 -capture efficiency. However, the large design space of these systems hinders the application of CFD for design optimization due to its high computational cost. In contrast, data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. We build our surrogates using MeshGraphNets (MGN), a graph neural network framework that efficiently learns and produces mesh-based simulations. We apply MGN to a random packed column modeled with over 160K graph nodes and a design space consisting of three key input parameters: solvent surface tension, inlet velocity, and contact angle. Our models can adapt to a wide range of these parameters and accurately predict the complex interactions within the system at rates over 1700 times faster than CFD, affirming its practicality in downstream design optimization tasks. This underscores the robustness and versatility of MGN in modeling complex fluid dynamics for large-scale CCS analyses.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Pressurized subsampling system for pressured gas-hydrate-bearing sediment: Microscale imaging using X-ray computed tomography

A pressurized subsampling system was developed for pressured gas hydrate (GH)-bearing sediments, which have been stored under pressure. The system subsamples small amounts of GH sediments from cores (approximately 50 mm in diameter and 300 mm in height) without pressure release to atmospheric conditions. The maximum size of the subsamples is 12.5 mm in diameter and 20 mm in height. Moreover, our system transfers the subsample into a pressure vessel, and seals the pressure vessel by screwing in a plug under hydraulic pressure conditions. In this study, we demonstrated pressurized subsampling from artificial xenon-hydrate sediments and nondestructive microscale imaging of the subsample, using a microfocus X-ray computed tomography (CT) system. In addition, we estimated porosity and hydrate saturation from two-dimensional X-ray CT images of the subsamples.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Recent advances in integrated hydrologic models: Integration of new domains

Over the past several decades, hydrologic models have advanced from independent models of the surface and subsurface to integrated models that can capture the terrestrial hydrologic cycle within one framework. In recent years, these coupled frameworks have seen the inclusion of biogeochemical processes, ecohydrology, sedimentation and erosion, cold region hydrology, anthropogenic activities, and atmospheric processes. This expansion is the result of increased computational, data, and modeling capabilities and capacities, as well as improved understanding of the processes that drive these integrated systems. Here, in this study, we review these recent advances to integrate new processes and systems into existing terrestrial hydrologic models and highlight the significant challenges and opportunities that remain. We identify that with so many models currently available and in development, selecting the most appropriate model is difficult, and we suggest a path for new or novice modelers to find the most appropriate code based on their needs. In addition, data required to parameterize and calibrate these models can often constrain their applicability and usefulness. However, advances in environmental sensors and measurement technology, in addition to data assimilation of non-traditional data (e.g. remote sensing, qualitative data) are providing new ways of addressing this issue. As we expand hydrologic models to integrate more processes and systems, our computational demands also increase. Recent and emerging advances in computational platforms, including cloud and quantum computing, in addition to the use of machine learning to capture some processes, will continue to support the use of increasingly larger and more complex, process-based models. Finally, we highlight that it is critical to develop state-of-the-science models that are accessible to all model users, not just those applied for research and development. We encourage continued development of diverse modeling platforms, considering the user needs, data availability, and computational resources.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2013

Opcode counting for performance measurement

Methods, systems and computer program products are disclosed for measuring a performance of a program running on a processing unit of a processing system. In one embodiment, the method comprises informing a logic unit of each instruction in the program that is executed by the processing unit, assigning a weight to each instruction, assigning the instructions to a plurality of groups, and analyzing the plurality of groups to measure one or more metrics. In one embodiment, each instruction includes an operating code portion, and the assigning includes assigning the instructions to the groups based on the operating code portions of the instructions. In an embodiment, each type of instruction is assigned to a respective one of the plurality of groups. These groups may be combined into a plurality of sets of the groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Opcode counting for performance measurement

Methods, systems and computer program products are disclosed for measuring a performance of a program running on a processing unit of a processing system. In one embodiment, the method comprises informing a logic unit of each instruction in the program that is executed by the processing unit, assigning a weight to each instruction, assigning the instructions to a plurality of groups, and analyzing the plurality of groups to measure one or more metrics. In one embodiment, each instruction includes an operating code portion, and the assigning includes assigning the instructions to the groups based on the operating code portions of the instructions. In an embodiment, each type of instruction is assigned to a respective one of the plurality of groups. These groups may be combined into a plurality of sets of the groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Opcode counting for performance measurement

Methods, systems and computer program products are disclosed for measuring a performance of a program running on a processing unit of a processing system. In one embodiment, the method comprises informing a logic unit of each instruction in the program that is executed by the processing unit, assigning a weight to each instruction, assigning the instructions to a plurality of groups, and analyzing the plurality of groups to measure one or more metrics. In one embodiment, each instruction includes an operating code portion, and the assigning includes assigning the instructions to the groups based on the operating code portions of the instructions. In an embodiment, each type of instruction is assigned to a respective one of the plurality of groups. These groups may be combined into a plurality of sets of the groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Opcode counting for performance measurement

Methods, systems and computer program products are disclosed for measuring a performance of a program running on a processing unit of a processing system. In one embodiment, the method comprises informing a logic unit of each instruction in the program that is executed by the processing unit, assigning a weight to each instruction, assigning the instructions to a plurality of groups, and analyzing the plurality of groups to measure one or more metrics. In one embodiment, each instruction includes an operating code portion, and the assigning includes assigning the instructions to the groups based on the operating code portions of the instructions. In an embodiment, each type of instruction is assigned to a respective one of the plurality of groups. These groups may be combined into a plurality of sets of the groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Opcode counting for performance measurement

Methods, systems and computer program products are disclosed for measuring a performance of a program running on a processing unit of a processing system. In one embodiment, the method comprises informing a logic unit of each instruction in the program that is executed by the processing unit, assigning a weight to each instruction, assigning the instructions to a plurality of groups, and analyzing the plurality of groups to measure one or more metrics. In one embodiment, each instruction includes an operating code portion, and the assigning includes assigning the instructions to the groups based on the operating code portions of the instructions. In an embodiment, each type of instruction is assigned to a respective one of the plurality of groups. These groups may be combined into a plurality of sets of the groups.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Holistic Approaches to HPC Power and Workflow Management

Constraints on power consumption are having pervasive effects on high-performance computing (HPC) systems, the facilities in which they are housed, and the application codes themselves. Whether these constraints are driven by physical limits on available power within a facility, are due to utility demand response, result from opportunities to reduce utility costs, or are imposed by sponsoring agencies, power management must now be added to the traditional goals of application and algorithm correctness, scalability, and performance. The specifics of these power constraints are likely to vary from site to site, and optimal strategies for managing power will vary. In this paper, we present the results of implementing several strategies for managing HPC system power and quantify the impact of these power reductions on application performance. These can be added to the suite of extant options that can be used to manage power and workflow on HPC systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Holistic Approaches to HPC Power & Workflow Management: Preprint

Constraints on power consumption are having pervasive effects on high-performance computing (HPC) systems, the facilities in which they are housed, and the application codes themselves. Whether these constraints are driven by physical limits on available power within a facility, are due to utility demand response, result from opportunities to reduce utility costs, or are imposed by sponsoring agencies, power management must now be added to the traditional goals of application and algorithm correctness, scalability, and performance. The specifics of these power constraints are likely to vary from site to site, and optimal strategies for managing power will vary. In this paper, we present the results of implementing several strategies for managing HPC system power and quantify the impact of these power reductions on application performance. These can be added to the suite of extant options that can be used to manage power and workflow on HPC systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Iterative methods in GPU-resident linear solvers for nonlinear constrained optimization

Linear solvers are major computational bottlenecks in a wide range of decision support and optimization computations. The challenges become even more pronounced on heterogeneous hardware, where traditional sparse numerical linear algebra methods are often inefficient. For example, methods for solving ill-conditioned linear systems have relied on conditional branching, which degrades performance on hardware accelerators such as graphical processing units (GPUs). To improve the efficiency of solving ill-conditioned systems, our computational strategy separates computations that are efficient on GPUs from those that need to run on traditional central processing units (CPUs). Our strategy maximizes the reuse of expensive CPU computations. Iterative methods, which thus far have not been broadly used for ill-conditioned linear systems, play an important role in our approach. In particular, we extend ideas from Arioli et al., (2007) to implement iterative refinement using inexact LU factors and flexible generalized minimal residual (FGMRES), with the aim of efficient performance on GPUs. In conclusion, we focus on solutions that are effective within broader application contexts, and discuss how early performance tests could be improved to be more predictive of the performance in a realistic environment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Analysis of Shutdown Dose Rate in Fusion Energy Systems Using Hybrid Monte Carlo/Deterministic Techniques - Paper 138

Accurate assessments of shutdown dose rate (SDDR) are critical to support operation, maintenance, and waste disposal planning and to guide possible design changes of critical components in fusion energy systems. An SDDR calculation involves three steps: 1. a neutron transport calculation to determine the space and energy neutron flux distributions, 2. an activation calculation for computing the photon source distribution, and 3. a photon transport calculation for the estimation of the final SDDR. A companion paper describes the challenges of SDDR computations in fusion energy systems and the status of the techniques that are currently being used in SDDR analysis. Of these techniques, the rigorous 2-step (R2S) computational system entails Monte Carlo (MC) neutron and photon transport calculations coupled with a comprehensive activation step using a dedicated inventory code and library. The use of global MC variance reduction techniques was suggested for accelerating the SDDR MC neutron transport calculation. These techniques, which attempt to calculate MC tallies with nearly uniform relative uncertainties in both the low-flux space-energy regions and the high-flux space-energy regions, do not preferentially focus the MC computational efforts toward space-energy regions of high importance to the final decay dose. The ability of these approaches to accurately predict SDDR is inhibited by their prohibitive computational costs, which will be on the order of thousands of processor-years for full-scale modeling of an entire fusion plant. The companion paper describes the theoretical background of the Multi-Step Consistent Adjoint Driven Importance Sampling (MS-CADIS) method, which has been proposed to speed up SDDR MC neutron calculations. The MS-CADIS method uses the CADIS method, which has been successfully used for more than a decade in shielding calculations, but focuses on multistep shielding calculations such as SDDR analyses. The companion paper also describes a new method for calculating the uncertainties in SDDR due to uncertainties in the MC neutron calculation. This new method of uncertainty propagation uses the MS-CADIS neutron adjoint source to propagate the uncertainties in the neutron fluxes to the SDDR. This paper describes the application of the MS-CADIS method for speeding up the SDDR MC calculations and for calculating the SDDR uncertainty due to the neutron flux uncertainties. A new metric for assessing the reliability of SDDR calculations was also suggested and used in this analysis. The ITER benchmark problem was used in this analysis. The problem resembles the configuration and geometrical arrangement of an upper port plug in ITER. The analysis compared the efficiency of the MS-CADIS method to the traditional approach of using global MC variance reduction techniques for speeding up SDDR MC neutron calculation. The application of the MS-CADIS method to SDDR calculations in fusion energy systems was tested using the ITER benchmark problem. Compared to the standard FW-CADIS method, the increase in the efficiency of the SDDR neutron MC calculation due to the use of the MS-CADIS method was between 18% and 69%. The MS-CADIS method also increases the fraction of non-zero-scoring mesh tally elements in the space-energy regions of high importance to the final SDDR. Implementation of the MS-CADIS method in the SCALE and the ADVANTG code systems is currently under way. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2017

Divide and Conquer (DC) BLAST: fast and easy BLAST execution within HPC environments

Bioinformatics is currently faced with very large-scale data sets that lead to computational jobs, especially sequence similarity searches, that can take absurdly long times to run. For example, the National Center for Biotechnology Information (NCBI) Basic Local Alignment Search Tool (BLAST and BLAST+) suite, which is by far the most widely used tool for rapid similarity searching among nucleic acid or amino acid sequences, is highly central processing unit (CPU) intensive. While the BLAST suite of programs perform searches very rapidly, they have the potential to be accelerated. In recent years, distributed computing environments have become more widely accessible and used due to the increasing availability of high-performance computing (HPC) systems. Therefore, simple solutions for data parallelization are needed to expedite BLAST and other sequence analysis tools. However, existing software for parallel sequence similarity searches often requires extensive computational experience and skill on the part of the user. In order to accelerate BLAST and other sequence analysis tools, Divide and Conquer BLAST (DCBLAST) was developed to perform NCBI BLAST searches within a cluster, grid, or HPC environment by using a query sequence distribution approach. Scaling from one (1) to 256 CPU cores resulted in significant improvements in processing speed. Thus, DCBLAST dramatically accelerates the execution of BLAST searches using a simple, accessible, robust, and parallel approach. DCBLAST works across multiple nodes automatically and it overcomes the speed limitation of single-node BLAST programs. DCBLAST can be used on any HPC system, can take advantage of hundreds of nodes, and has no output limitations. Thus, this freely available tool simplifies distributed computation pipelines to facilitate the rapid discovery of sequence similarities between very large data sets.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Dynamics of Charge Transfer and Multiple Exciton Generation in the Doped Silicon Quantum Dot–Carbon Nanotube System: Density Functional Theory-Based Computation

In this study, we use the Boltzmann transport equation (BE) to study time evolution of a photoexcited state, including phonon-mediated exciton relaxation, multiple exciton generation (MEG), and energy-transfer processes. BE collision integrals are derived using Kadanoff–Baym–Keldysh many-body perturbation theory (MBPT) based on density functional theory (DFT) simulations, including exciton effects. We apply the method to a nanostructured p–n junction composed of a 1 nm hydrogen-terminated Si quantum dot (QD) doped with two phosphorus atoms (Si 36 P 2 H 42 ) adjacent to the (6, 2) single-wall carbon nanotube (CNT) with two chlorine atoms per two unit cells adsorbed to the surface. We find that an initial excitation localized on either the QD or CNT evolves into a transient charge-transfer (CT) state where either electron or hole transfer has taken place. The CT state lifetime is about 40 fs. Also, we study MEG in this system by computing internal quantum efficiency (QE), which is the number of excitons generated from an absorbed photon during relaxation. We predict efficient MEG starting at 3E g ≃ 1.5 eV and with QE reaching QE = 1.65 at about 5E g , where E g ≃ 0.5 eV is the lowest exciton energy, i.e., the gap. However, we find that including energy transfer and MEG effects suppresses CT state generation.

36 MATERIALS SCIENCE↗
DOE OSTI2016

Design of virtual SCADA simulation system for pressurized water reactor

The Virtual SCADA system is a software-based Human-Machine Interface that can visualize the process of a plant. This paper described the results of the virtual SCADA system design that aims to recognize the principle of the Nuclear Power Plant type Pressurized Water Reactor. This simulation uses technical data of the Nuclear Power Plant Unit Olkiluoto 3 in Finland. This device was developed using Wonderware Intouch, which is equipped with manual books for each component, animation links, alarm systems, real time and historical trending, and security system. The results showed that in general this device can demonstrate clearly the principles of energy flow and energy conversion processes in Pressurized Water Reactors. This virtual SCADA simulation system can be used as instructional media to recognize the principle of Pressurized Water Reactor.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗