Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Massive Computation”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

Archive Management of NASA Earth Observation Data to Support Cloud Analysis

NASA collects, processes and distributes petabytes of Earth Observation (EO) data from satellites, aircraft, in situ instruments and model output, with an order of magnitude increase expected by 2024. Cloud-based web object storage (WOS) of these data can simplify the execution of such an increase. More importantly, it can also facilitate user analysis of those volumes by making the data available to the massively parallel computing power in the cloud. However, storing EO data in cloud WOS has a ripple effect throughout the NASA archive system with unexpected challenges and opportunities. One challenge is modifying data servicing software (such as Web Coverage Service servers) to access and subset data that are no longer on a directly accessible file system, but rather in cloud WOS. Opportunities include refactoring of the archive software to a cloud-native architecture; virtualizing data products by computing on demand; and reorganizing data to be more analysis-friendly. Reviewed by Mark McInerney ESDIS Deputy Project Manager.

Lynnes, Christopher↗
NASA NTRS2019

Overview of NASA QuAIL Team Research

NASA is constantly confronting massively challenging computational problems. These problems have the potential to limit mission scope and aim. NASA's Quantum Artificial Intelligence Laboratory (QuAIL) Group was formed to determine the potential for quantum computation to enable more ambitious NASA missions in the future. This presentation highlights recent work by the QuAIL team that is focused on physics insights and applications associated with the D-Wave 2000Q quantum annealing hardware that is located at NASA Ames Research Center.

Shon Grabbe↗
NASA NTRS2022

Validation of a High-Fidelity Supersonic Parachute Inflation Dynamics Model and Best Practice

The parachute inflation dynamics (PID) of a Disk-Gap-Band (DGB) parachute system travelling at supersonic velocities in the high-altitude Earth atmosphere is simulated using a high-fidelity, multiphysics, massively-parallel computational framework. The sensitivity of the simulation results with respect to critical modelling and simulation parameters, including the fluid mechanical governing equations (Euler vs Navier-Stokes with RANS turbulence closure vs Navier-Stokes with LES turbulence closer), the interaction between the flow and the suspension lines (accounted for vs not accounted for), the dynamics of the payload (restrained vs free), and the material model of the heterogeneous fabric canopy (Saint-Venant Kirchoff vs mechanics-informed multiscale neural network), is extensively investigated. The parameter investigation is enabled by advancements to the state-of-the-art in the modelling and simulation of the supersonic parachute inflation process, which are presented as part of the computational framework. The predictive quality of the computational framework in the context of supersonic PID is validated by comparison of the simulation results with the experimental results from NASA’s Advanced Supersonic Parachute Research (ASPIRE) project. Through the validation, best practices for the modelling and simulation of supersonic PID are developed and proposed.

Rabinovitch, Jason↗
NASA NTRSDate not supplied

Radiative Heat Transfer Capability Implemented in OpenNCC for Conjugate Heat Transfer Applications

Thermal efficiency of gas turbine engine increases as the temperature and pressure at the combustor increases. Consequently, the materials used inside a combustor must survive an increasingly challenging environment. For this reason, accurate assessment of heat transfer is crucial for combustor design. While all three modes of heat transfer are present inside a combustor, the focus of this paper is the thermal radiation. Radiative heat transfer in a gas turbine combustors are particularly interesting from three reasons. Firstly, the radiative heat loss from the combustion region may affect the emission performance. Secondly, the cooling air will protect the liner from convection but not necessary from radiation. Finally, it is less frequently incorporated in CFD analysis than other forms of heat transfer. In this work, radiative heat transfer using discrete ordinate method has been incorporated in OpenNCC (a publicly releasable version of the National Combustion Code) developed at NASA Glenn Research Center. Aside from massively parallel computation capability using MPI and the ability to utilize unstructured mesh, the current implementation includes two types of spectral models, namely, the weighted some of gray gas model and the full spectrum correlated k-distribution model. After presenting the theory and the strategy of implementation, results of validation cases for gray gas and spectral models will be presented. While the implementation of the radiation solver is intended for gas turbine application, the radiation solver can run independently from the convection/combustion solver and the same theory can be applied to other application.

OpenNCC↗
NASA NTRSDate not supplied

Radiative Heat Transfer Capability Implemented in OpenNCC for Conjugate Heat Transfer Applications

Thermal efficiency of gas turbine engine increases as the temperature and pressure at the combustor increases. Consequently, the materials used inside a combustor must survive an increasingly challenging environment. For this reason, accurate assessment of heat transfer is crucial for combustor design. While all three modes of heat transfer are present inside a combustor, the focus of this paper is the thermal radiation. Radiative heat transfer in a gas turbine combustors are particularly interesting from three reasons. Firstly, the radiative heat loss from the combustion region may affect the emission performance. Secondly, the cooling air will protect the liner from convection but not necessary from radiation. Finally, it is less frequently incorporated in CFD analysis than other forms of heat transfer. In this work, radiative heat transfer using discrete ordinate method has been incorporated in OpenNCC (a publicly releasable version of the National Combustion Code) developed at NASA Glenn Research Center. Aside from massively parallel computation capability using MPI and the ability to utilize unstructured mesh, the current implementation includes two types of spectral models, namely, the weighted some of gray gas model and the full spectrum correlated k-distribution model. After presenting the theory and the strategy of implementation, results of validation cases for gray gas and spectral models will be presented. While the implementation of the radiation solver is intended for gas turbine application, the radiation solver can run independently from the convection/combustion solver and the same theory can be applied to other application.

OpenNCC↗
DOE OSTI2022

Extension of the high-resolution thermal-hydraulics code ESCOT to hexagonal core geometries for multi-physics calculations

The extension of the capabilities of the pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT to analyze hexagonal fueled cores and its performance are presented. ESCOT is an accurate yet fast core thermal-hydraulics solution aiming at high-fidelity and high-resolution multi-physics core analysis in the framework of massively parallel computing platforms. Its algorithm solution is based on the four-equation drift-flux model for two-phase calculations, these are numerically solved by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models such as turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analysis. ESCOT is parallelized by a double (radial and axial) domain decomposition that enables its highly parallelized execution. The coupling of the code with the neutronics whole core solver for hexagonal geometries nTRACER is described. The newly implemented ESCOT features are validated by comparing single assembly and full core steady state nTRACER-ESCOT solutions with nTRACER standalone internal one-dimensional T/H solver results. The validation problems are based on the VVER 440 and VVER 1000 cores. ESCOT results show differences within an acceptable range with respect to the simple 1D nTRACER built-in solver. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
NASA NTRS1994

Relativistic tidal interaction of a white dwarf with a massive black hole

We compute encounters of a realistic white dwarf model with a massive black hole in the regime where relativistic effects are important, using a three-dimensional, finite-difference, Eulerian, piecewise parabolic method (PPM) hydrodynamical code. Both disruptive and nondisruptive encounters are considered. We identify and discuss relativistic effects important for the problem: relativistic shift of the pericenter distance, time delay, relativistic precession, and the tensorial structure of the tidal forces. In the nondisruptive case, stripping of matter takes place. In the surface layers of the surviving core, complicated hydrodynamical phenomena are revealed. In both disruptive and nondispruptive encounters, material flows out in the form of two thin, S-shaped, supersonic jets. Our results provide realistic initial conditions for the subsequent investigation of the dynamics of the debris in the field of the black hole. We evaluate the critical conditions for complete disruption of the white dwarf, and compare our results with the corresponding results for nonrelativistic encounters.

Frolov, V. P.↗
NASA NTRS1994

High Performance Distributed Computing in a Supercomputer Environment: Computational Services and Applications Issues

This tutorial proposes to be a practical guide for the uninitiated to the main topics and themes of high-performance computing (HPC), with particular emphasis to distributed computing. The intent is first to provide some guidance and directions in the rapidly increasing field of scientific computing using both massively parallel and traditional supercomputers. Because of their considerable potential computational power, loosely or tightly coupled clusters of workstations are increasingly considered as a third alternative to both the more conventional supercomputers based on a small number of powerful vector processors, as well as high massively parallel processors. Even though many research issues concerning the effective use of workstation clusters and their integration into a large scale production facility are still unresolved, such clusters are already used for production computing. In this tutorial we will utilize the unique experience made at the NAS facility at NASA Ames Research Center. Over the last five years at NAS massively parallel supercomputers such as the Connection Machines CM-2 and CM-5 from Thinking Machines Corporation and the iPSC/860 (Touchstone Gamma Machine) and Paragon Machines from Intel were used in a production supercomputer center alongside with traditional vector supercomputers such as the Cray Y-MP and C90.

Kramer, Williams T. C.↗
DOE OSTI2022

Quantum computation of phase transition in the massive Schwinger model

Abstract As pointed out by Coleman, physical quantities in the Schwinger model depend on a parameter θ that determines the background electric field. There is a phase transition for θ = π only. We develop a momentum space formalism on a lattice and use it to perform a quantum computation of the critical point of this phase transition on the NISQ device IMB Q Lima. After error mitigation, our results give strong indication of the existence of a critical point at m / e ≃ 0.32, where m is the bare fermion mass and e is the coupling strength, in good agreement with the classical numerical result m / e ≃ 0.3335.

Physics↗
NASA NTRS1980

Axial rotation, tangled magnetic fields, and theoretical models of very massive stars

A simple method of computing theoretical models of very massive stars endowed with fast axial rotation and tangled magnetic fields is described and used in the present paper. Both of the two perturbing (nongravitational) forces induce changes in the luminosity and radius that are studied as functions of zero-age chemical composition, opacity, and evolutionary state of the interior. The central condensation of the star is found to have a significant influence on shifts of the upper main-sequence band in the H-R diagram if the perturbing force is concentrated in the stellar envelope (but not if the perturbing force is distributed so as to be approximately proportional to gravity everywhere); the layers of the envelope that contribute most heavily to the central condensation lie approximately at a radius fraction of r/R = 0.5. It is shown that fast uniform rotation and intense envelope magnetic fields lead to probably the largest possible shifts of the main-sequence band in the H-R diagram that rotation and magnetic fields can induce. These displacements are, however, too small to account for the total width of the observed main-sequence band at luminosities brighter than log (L/solar luminosity) = 4.5.

Stothers, R.↗
DOE OSTI2022

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current stateof-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Efficient star formation in the spiral arms of M51

The molecular, neutral, and ionized hydrogen distributions in the Sbc galaxy M51 (NGC 5194) are compared. To estimate H2 surface densities observations of the CO (J = 1 - 0) transition were made in 60 positions out to a radius of 155 arcsec. Extinction-corrected H-alpha intensities were used to compute the detailed massive star formation rates (MSFRs) in the disk. Estimates of the gas surface density, the MSFR, and the ratio of these quantities, MSFR/sigma(p), were then examined. The spiral arms were found to exhibit an excess gas density, measuring between 1.4 and 1.6 times the interarm values at 45 arcsec resolution. The total (arm and interarm) gas content and massive star formation rates in concentric annuli in the disk of M51 were computed. The two quantities fall off together with radius, yielding a relatively constant MSFR/sigma(p) with radius. This behavior is not explained by current models of star formation in galactic disks.

Lord, Steven D.↗
DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗
NASA NTRS2009

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio↗
DOE OSTI2021

Sparse Binary Matrix-Vector Multiplication on Neuromorphic Computers

Neuromorphic computers offer the opportunity for low-power, efficient computation. Though they have been primarily applied to neural network tasks, there is also the opportunity to leverage the inherent characteristics of neuromorphic computers (low power, massive parallelism, collocated processing and memory) to perform non-neural network tasks. Here, we demonstrate how an approach for performing sparse binary matrix-vector multiplication on neuromorphic computers. We describe the approach, which relies on the connection between binary matrix-vector multiplication and breadth first search, and we introduce the algorithm for performing this calculation in a neuromorphic way. We validate the approach in simulation. Finally, we provide a discussion of the runtime of this algorithm and discuss where neuromorphic computers in the future may have a computational advantage when performing this computation.

Schuman, Catherine↗
DOE OSTI2022

Transitioning from File-Based HPC Workflows to Streaming Data Pipelines with openPMD and ADIOS2

This paper aims to create a transition path from file-based IO to streaming-based workflows for scientific applications in an HPC environment. By using the openPMP-api, traditional workflows limited by filesystem bottlenecks can be overcome and flexibly extended for in situ analysis. The openPMD-api is a library for the description of scientific data according to the Open Standard for Particle-Mesh Data (openPMD). Its approach towards recent challenges posed by hardware heterogeneity lies in the decoupling of data description in domain sciences, such as plasma physics simulations, from concrete implementations in hardware and IO. The streaming backend is provided by the ADIOS2 framework, developed at Oak Ridge National Laboratory. This paper surveys two openPMD-based loosely-coupled setups to demonstrate flexible applicability and to evaluate performance. In loose coupling, as opposed to tight coupling, two (or more) applications are executed separately, e.g. in individual MPI contexts, yet cooperate by exchanging data. This way, a streaming-based workflow allows for standalone codes instead of tightly-coupled plugins, using a unified streaming-aware API and leveraging high-speed communication infrastructure available in modern compute clusters for massive data exchange. We determine new challenges in resource allocation and in the need of strategies for a flexible data distribution, demonstrating their influence on efficiency and scaling on the Summit compute system. The presented setups show the potential for a more flexible use of compute resources brought by streaming IO as well as the ability to increase throughput by avoiding filesystem bottlenecks.

Poeschel, Franz↗
DOE OSTI2020

Locality-Aware Scheduling for Scalable Heterogeneous Environments

Heterogeneous computing promise boost performance of scientific applications by allowing massively parallel execution of computational tasks. However, manually managing extremely heterogeneous, multi-device systems is complicated and may result in sub-optimal performance. Specifically, data management is an extremely challenging problem on multi-device systems. In this work, we introduce two locality-aware schedulers for the Minos Computing Library (MCL), an asynchronous, task-based programming model and runtime for extremely heterogeneous systems. The first scheduler implements a pure locality-aware algorithm to maximize data reuse, though it might incur in ”hot-spots” that limit system utilization. The second scheduler mitigates this drawback by dynamically targeting between locality-awareness and system utilization based on the current workload and available computing devices. Our results show that locality-awareness greatly benefit applications that exhibit data reuse, providing up to 6.9x and 7.9x over the original MCL scheduler and equivalent OpenCL implementations, respectively. Moreover, our schedulers introduce negligible overhead compared with the original MCL scheduler and achieve similar performance for applications that don’t benefit from data locality.

Architecture, co-design, Task-based programming mo↗
DOE OSTI2021

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗