Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 901 records · Page 50

A single-site multipole model for liquid water

Accurate and efficient empirical potential energy models that describe the atomistic interactions between water molecules in the liquid phase are essential for computer simulations of many problems in physics, chemistry, and biology, especially when long length or time scales are important. However, while models with non-polarizable partial charges at four or five sites in a water molecule give remarkably good values for certain properties, deficiencies have been noted in other properties and increasing the number of sites decreases computational efficiency. An alternate approach is to utilize a multipole expansion of the electrostatic potential due to the molecular charge distribution, which is exact outside the charge distribution in the limits of infinite distances or infinite orders of multipoles while partial charges are a qualitative representation of electron density as point charges. Here, a single-site multipole model of water is presented, which is as fast computationally as three-site models but is also more accurate than four- and five-site models. The dipole, quadrupole, and octupole moments are from quantum mechanical–molecular mechanical calculations so that they account for the average polarization in the liquid phase, and represent both the in-plane and out-of-plane electrostatic potentials of a water molecule in the liquid phase. This model gives accurate thermodynamic, dynamic, and dielectric properties at 298 K and 1 atm, as well as good temperature and pressure dependence of these properties.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Viability of S3 Object Storage for the ASC Program at Sandia

Recent efforts at Sandia such as DataSEA are creating search engines that enable analysts to query the institution’s massive archive of simulation and experiment data. The benefit of this work is that analysts will be able to retrieve all historical information about a system component that the institution has amassed over the years and make better-informed decisions in current work. As DataSEA gains momentum, it faces multiple technical challenges relating to capacity storage. From a raw capacity perspective, data producers will rapidly overwhelm the system with massive amounts of data. From an accessibility perspective, analysts will expect to be able to retrieve any portion of the bulk data, from any system on the enterprise network. Sandia’s Institutional Computing is mitigating storage problems at the enterprise level by procuring new capacity storage systems that can be accessed from anywhere on the enterprise network. These systems use the simple storage service, or S3, API for data transfers. While S3 uses objects instead of files, users can access it from their desktops or Sandia’s high-performance computing (HPC) platforms. S3 is particularly well suited for bulk storage in DataSEA, as datasets can be decomposed into object that can be referenced and retrieved individually, as needed by an analyst. In this report we describe our experiences working with S3 storage and provide information about how developers can leverage Sandia’s current systems. We present performance results from two sets of experiments. First, we measure S3 throughput when exchanging data between four different HPC platforms and two different enterprise S3 storage systems on the Sandia Restricted Network (SRN). Second, we measure the performance of S3 when communicating with a custom-built Ceph storage system that was constructed from HPC components. Overall, while S3 storage is significantly slower than traditional HPC storage, it provides significant accessibility benefits that will be valuable for archiving and exploiting historical data. There are multiple opportunities that arise from this work, including enhancing DataSEA to leverage S3 for bulk storage and adding native S3 support to Sandia’s IOSS library.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Breaking Down the Computational Barriers to Real-Time Urban Flood Forecasting

Flooding impacts are on the rise globally, and concentrated in urban areas. Currently, there are no operational systems to forecast flooding at spatial resolutions that can facilitate emergency preparedness and response actions mitigating flood impacts. We present a framework for real-time flood modeling and uncertainty quantification that combines the physics of fluid motion with advances in probabilistic methods. The framework overcomes the prohibitive computational demands of high-fidelity modeling in real-time by using a probabilistic learning method relying on surrogate models that are trained prior to a flood event. This shifts the overwhelming burden of computation to the trivial problem of data storage, and enables forecasting of both flood hazard and its uncertainty at scales that are vital for time-critical decision-making before and during extreme events. The framework has the potential to improve flood prediction and analysis and can be extended to other hazard assessments requiring intense high-fidelity computations in real-time.

54 ENVIRONMENTAL SCIENCES↗

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗

Target-specific optimization of four-dimensional cone beam computed tomography

Purpose: Under-sampling artifacts are a major problem in four-dimensional cone-beam computed tomography (4D-CBCT) and may compromise evaluation of target motion. Several studies have addressed scan parameter selection for minimizing under-sampling artifacts; however, the role of the target characteristics in scan parameter selection has not been investigated. In this work, the authors evaluated 4D-CBCT performance by assessing the accuracy of target motion measurements for various target sizes and motions. The results may serve as patient-specific guidelines for scan parameters selection in 4D-CBCT. Methods: The authors acquired 4D-CBCT scans of a moving phantom consisting of six water-filled sphere targets of sizes 10-37 mm, using various scan times ranging from 30 s to 3 min., setting the motion to 3-s and 6-s periods. The authors used automatic image registration to extract the target motion trajectories and evaluated these measurements for various target sizes and motions over various combinations of scan parameters including scan time, detector configuration, number of respiration phases, and reconstruction filters. Results: The most important object parameter to 4D-CBCT performance was the period of motion. Measurements for the 6-s motion were always systematically less accurate than measurements for the 3-s motion for 34 of 36 objects of various sizes and periods of motion. The 6-s motion required a greater scan time than the 3-s motion for equivalent measurement accuracy. The second most influential parameter was the target size. For the 3-s period of motion, objects larger than 13 mm were tracked with sub-millimeter accuracy with a 1-min scan time. For the 6-s period of motion, objects larger than 22-mm were tracked with sub-millimeter accuracy with a 1.5-min scan time. For all sizes and motions, temporal blurring was observed when the number of phases was fewer than 8. Offset detector configuration provided the same performance as centered detector except for small targets (20 mm.) at short scan times ({<=}1 min). Finally, reconstruction filtering and number of respiratory phases did not affect performance. Conclusions: Scan time should be set according to target size and motion. The authors have provided figures that provide the minimum scan time needed to achieve the particular motion measurement accuracy for a particular size and motion period.

60 APPLIED LIFE SCIENCES↗

VERA Integration in the NEAMS Workbench

The Virtual Environment for Reactor Applications (VERA) is a cutting edge simulation code suite used to solve complex multiphysics problems for nuclear reactors. VERA makes use of high performance computing (HPC) systems to solve large problems that were not historically tractable. While extensive work has been put into the usability of VERA, it still takes significant effort to build reactor models, ensure their correctness, properly execute the calculations, and conduct the necessary analysis of the results. This difficulty is common for many complex codes such as VERA. As part of the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the NEAMS Workbench has been developed and maintained. The goal of the NEAMS Workbench is to provide a single interface with which to execute a wide variety of physics codes, from building the input models to analyzing the results. This document serves as a manual detailing the current integration of VERA with the NEAMS Workbench and a guide for configuring Workbench to allow remote execution of VERA.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Poster — Thur Eve — 44: Linearization of Compartmental Models for More Robust Estimates of Regional Hemodynamic, Metabolic and Functional Parameters using DCE-CT/PET Imaging

Quantitative analysis of dynamic positron emission tomography (PET) data usually involves minimizing a cost function with nonlinear regression, wherein the choice of starting parameter values and the presence of local minima affect the bias and variability of the estimated kinetic parameters. These nonlinear methods can also require lengthy computation time, making them unsuitable for use in clinical settings. Kinetic modeling of PET aims to estimate the rate parameter k{sub 3}, which is the binding affinity of the tracer to a biological process of interest and is highly susceptible to noise inherent in PET image acquisition. We have developed linearized kinetic models for kinetic analysis of dynamic contrast enhanced computed tomography (DCE-CT)/PET imaging, including a 2-compartment model for DCE-CT and a 3-compartment model for PET. Use of kinetic parameters estimated from DCE-CT can stabilize the kinetic analysis of dynamic PET data, allowing for more robust estimation of k{sub 3}. Furthermore, these linearized models are solved with a non-negative least squares algorithm and together they provide other advantages including: 1) only one possible solution and they do not require a choice of starting parameter values, 2) parameter estimates are comparable in accuracy to those from nonlinear models, 3) significantly reduced computational time. Our simulated data show that when blood volume and permeability are estimated with DCE-CT, the bias of k{sub 3} estimation with our linearized model is 1.97 ± 38.5% for 1,000 runs with a signal-to-noise ratio of 10. In summary, we have developed a computationally efficient technique for accurate estimation of k{sub 3} from noisy dynamic PET data.

60 APPLIED LIFE SCIENCES↗

Application of subgroup decomposition in diffusion theory to gas cooled thermal reactor problem

In this paper, the accuracy and computational efficiency of the subgroup decomposition (SGD) method in diffusion theory is assessed in a ID benchmark problem characteristic of gas cooled thermal systems. This method can be viewed as a significant improvement in accuracy of standard coarse-group calculations used for VHTR whole core analysis in which core environmental effect and energy angle coupling are pronounced. It is shown that a 2-group SGD calculation reproduces fine-group (47) results with 1.5 to 6 times faster computational speed depending on the stabilizing schemes while it is as efficient as single standard 6-group diffusion calculation. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

On the utility of GPU accelerated high-order methods for unsteady flow simulations: A comparison with industry-standard tools

First- and second-order accurate numerical methods, implemented for CPUs, underpin the majority of industrial CFD solvers. Whilst this technology has proven very successful at solving steady-state problems via a Reynolds Averaged Navier–Stokes approach, its utility for undertaking scale-resolving simulations of unsteady flows is less clear. High-order methods for unstructured grids and GPU accelerators have been proposed as an enabling technology for unsteady scale-resolving simulations of flow over complex geometries. In this study we systematically compare accuracy and cost of the high-order Flux Reconstruction solver PyFR running on GPUs and the industry-standard solver STAR-CCM+ running on CPUs when applied to a range of unsteady flow problems. Specifically, we perform comparisons of accuracy and cost for isentropic vortex advection (EV), decay of the Taylor–Green vortex (TGV), turbulent flow over a circular cylinder, and turbulent flow over an SD7003 aerofoil. We consider two configurations of STAR-CCM+: a second-order configuration, and a third-order configuration, where the latter was recommended by CD-adapco for more effective computation of unsteady flow problems. Results from both PyFR and STAR-CCM+ demonstrate that third-order schemes can be more accurate than second-order schemes for a given cost e.g. going from second- to third-order, the PyFR simulations of the EV and TGV achieve 75× and 3× error reduction respectively for the same or reduced cost, and STAR-CCM+ simulations of the cylinder recovered wake statistics significantly more accurately for only twice the cost. Moreover, advancing to higher-order schemes on GPUs with PyFR was found to offer even further accuracy vs. cost benefits relative to industry-standard tools.

97 MATHEMATICS AND COMPUTING↗

Computational Fluid Dynamic Analysis of the VHTR Lower Plenum Standard Problem

The United States Department of Energy is promoting the resurgence of nuclear power in the U. S. for both electrical power generation and production of process heat required for industrial processes such as the manufacture of hydrogen for use as a fuel in automobiles. The DOE project is called the next generation nuclear plant (NGNP) and is based on a Generation IV reactor concept called the very high temperature reactor (VHTR), which will use helium as the coolant at temperatures ranging from 450 ºC to perhaps 1000 ºC. While computational fluid dynamics (CFD) has not been used for past safety analysis for nuclear reactors in the U. S., it is being considered for safety analysis for existing and future reactors. It is fully recognized that CFD simulation codes will have to be validated for flow physics reasonably close to actual fluid dynamic conditions expected in normal and accident operational situations. To this end, experimental data have been obtained in a scaled model of a narrow slice of the lower plenum of a prismatic VHTR. The present report presents results of CFD examinations of these data to explore potential issues with the geometry, the initial conditions, the flow dynamics and the data needed to fully specify the inlet and boundary conditions; results for several turbulence models are examined. Issues are addressed and recommendations about the data are made.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Modular supply chain optimization considering demand uncertainty to manage risk

Supply chain under demand uncertainty has been a challenging problem due to increased competition and market volatility in modern markets. Flexibility in planning decisions makes modular manufacturing a promising way to address this problem. We report the problem of multiperiod process and supply chain network design is considered under demand uncertainty. A mixed integer two-stage stochastic programming problem is formulated with integer variables indicating the process design and continuous variables to represent the material flow in the supply chain. The problem is solved using a rolling horizon approach. Benders decomposition is used to reduce the computational complexity of the optimization problem. To promote risk-averse decisions, a downside risk measure is incorporated in the model. The results demonstrate the several advantages of modular designs in meeting product demands. A pareto-optimal curve for minimizing the objectives of expected cost and downside risk is obtained.

42 ENGINEERING↗

Reproducibility of fixed-node diffusion Monte Carlo across diverse community codes: The case of water–methane dimer

Fixed-node diffusion quantum Monte Carlo (FN-DMC) is a widely trusted many-body method for solving the Schrödinger equation, known for its reliable predictions of material and molecular properties. Furthermore, its excellent scalability with system complexity and near-perfect utilization of computational power make FN-DMC ideally positioned to leverage new advances in computing to address increasingly complex scientific problems. Even though the method is widely used as a computational gold standard, reproducibility across the numerous FN-DMC code implementations has yet to be demonstrated. This difficulty stems from the diverse array of DMC algorithms and trial wave functions, compounded by the method’s inherent stochastic nature. Here, this study represents a community-wide effort to assess the reproducibility of the method, affirming that yes, FN-DMC is reproducible (when handled with care). Using the water–methane dimer as the canonical test case, we compare results from eleven different FN-DMC codes and show that the approximations to treat the non-locality of pseudopotentials are the primary source of the discrepancies between them. In particular, we demonstrate that, for the same choice of determinantal component in the trial wave function, reliable and reproducible predictions can be achieved by employing the T-move, the determinant locality approximation, or the determinant T-move schemes, while the older locality approximation leads to considerable variability in results. These findings demonstrate that, with appropriate choices of algorithmic details, fixed-node DMC is reproducible across diverse community codes—highlighting the maturity and robustness of the method as a tool for open and reliable computational science.

Della Pia, Flaviano [Univ. of Cambridge (United Ki↗

Asynchronous In Situ Connected-Components Analysis for Complex Fluid flows, In: ISAV '16 Proceedings of the 2nd Workshop on In Situ Infrastructures for Enabling Extreme-scale Analysis and Visualization

The simulation of multiscale physics is an important challenge for scientific computing. For this class of problem, large three-dimensional simulations are performed to advance scientific inquiry. On massively parallel computing systems, the volume of data generated by such approaches can become a productivity bottleneck if the raw data generated from the simulation is analyzed in a post-processing step. To address this, we present a physics-based framework for in situ data reduction that is theoretically grounded in multiscale averaging theory. We show how task parallelism can be exploited to concurrently perform a variety of analysis tasks with data-dependent costs, including the generation of iso-surfaces, morphological analyses, and connected components analysis. All analyses are performed in parallel using distributed memory and use the same domain decomposition as the simulation. A task management framework is constructed to leverage available parallelism within a node for analysis. The capabilities of the framework are to launch asynchronous analysis threads, manage dependencies between different tasks, promote data locality and minimize the impact of data transfers. The framework is applied to analyze GPU-based simulations of two-fluid-phase flow in porous media, generating a set of averaged measures that represents the overall system behavior. We demonstrate how the approach can be applied to perform physically-consistent analysis over fluid sub-regions determined from connected components analysis. Simulations performed on Oak Ridge National Lab's Titan supercomputer are profiled to demonstrate the performance of the associated multi-threaded in situ analysis approach for typical production simulation of two-fluid-phase flow.

Computer Science↗

Integrating Quantum Computing with High-Performance Computing: A Streamlined Approach

In recent years, quantum computing has demon-strated the potential to revolutionize specific algorithms and applications by solving problems exponentially faster than classical computers. However, its widespread adoption for general computing remains a future prospect. This paper discusses the integration of quantum computing within High-Performance Computing (HPC) environments, focusing on a resource management framework designed to streamline quantum simulators' use and enhance runtime performance and efficiency. The proposed framework facilitates hybrid applications' transition from simulation backends to real quantum hardware, optimizing resource utilization and providing a flexible infrastructure for developing and testing quantum algorithms.

Shehata, Amir↗

Streaming Data in HPC Workflows Using ADIOS

The “IO Wall” problem, in which the gap between computation rate and data access rate grows continuously, poses significant problems to scientific workflows which have traditionally relied upon using the filesystem for intermediate storage between workflow stages. One way to avoid this problem in scientific workflows is to stream data directly from producers to consumers and avoiding storage entirely. However, the manner in which this is accomplished is key to both performance and usability. This paper presents the Sustainable Staging Transport, an approach which allows direct streaming between traditional file writers and readers with few application changes. SST is an ADIOS “engine”, accessible via standard ADIOS APIs, and because ADIOS allows engines to be chosen at run-time, many existing file-oriented ADIOS workflows can utilize SST for direct application-to-application communication without any source code changes. This paper describes the design of SST and presents performance results from various applications that use SST, for feeding model training with simulation data with substantially higher bandwidth than the theoretical limits of Frontier’s file system, for strong coupling of separately developed applications for multiphysics multiscale simulation, or for in situ analysis and visualization of data to complete all data processing shortly after the simulation finishes.

Podhorszki, Norbert [ORNL] (ORCID:000000019647542X↗

Monotonicity conditions in the nodal mimetic finite difference method for diffusion problems on quadrilateral meshes

A set of sufficient and necessary conditions for the local stiffness matrix of the nodal mimetic finite difference method on quadrilaterals is derived under which such matrix is a singular M-matrix. These conditions are directly related to the shape of the quadrilaterals and to the value of the off-diagonal elements and they are illustrated by the new concept, here introduced, of monotonicity region. When such conditions are satisfied, the global matrix for the Poisson problem with Dirichlet boundary conditions is a singular M-matrix. After setting the boundary condition, yields a monotone matrix operator and we prove that the final discretization possesses a Discrete Maximum Principle.

97 MATHEMATICS AND COMPUTING↗