SEARCH · Engineering Papers

Results for “Grid computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,315 records · Page 73

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Assessment of Edge-Based Viscous Method for Corner-Flow Solutions on Graphics Processing Units

A highly efficient, edge-based viscous (EBV) discretization method has been recently implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver and evaluated for Reynolds-averaged Navier-Stokes (RANS) formulations. In comparison to a well-established cell-based viscous (CBV) method, the EBV method has demonstrated multifold acceleration of all viscous-kernel computations on general unstructured mixed-element grids. The viscous kernels include evaluation of viscous fluxes, diffusion terms in turbulence models, and the corresponding Jacobian terms. In this paper, an EBV implementation of a nonlinear extension of the Spalart-Allmaras turbulence model, SA-neg-QCR2000, is presented and verified. The SA-neg-QCR2000 model is used for simulating turbulent corner flows. Previously reported EBV computations have been conducted on traditional computing architectures based on central processing units (CPU). This paper assesses benefits of the EBV method on modern high-performance computing architectures based on graphics processing units (GPU). The GPU implementations of the CBV and EBV methods are verified by comparing solutions and iterative convergence with those observed in CPU computations on the same grids. A comprehensive assessment of the EBV speedup on CPU and GPU architectures is presented for established benchmark corner flows, namely, a supersonic flow through a long square duct and a subsonic flow around a NASA juncture flow model.

CFD↗

NASA NTRSDate not supplied

Assessment of Edge-Based Viscous Method for Corner-Flow Solutions on Graphics Processing Units

CFD↗

DOE OSTI2024

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

Multidimensional Unstructured-Grid Liquid Rocket Engine Nozzle Performance and Heat Transfer Analysis

The objective of this study is to conduct a unified computational analysis for computing design parameters such as axial thrust, convective and radiative wall heat fluxes for regeneratively cooled liquid rocket engine nozzles, so as to develop a computational strategy for computing those parameters through parametric investigations. The computational methodology is based on a multidimensional, finite-volume, turbulent, chemically reacting, radiating, unstructured-grid, and pressure-based formulation, with grid refinement capabilities. Systematic parametric studies on effects of wall boundary conditions, combustion chemistry, radiation coupling, computational cell shape, and grid refinement were performed and assessed. Under the computational framework of this study, it is found that the computed axial thrust performance, flow features, and wall heat fluxes compared well with those of available data and calculations, using a strategy of structured-grid dominated mesh, finite-rate chemistry, and cooled wall boundary condition.

Wang, Ten-See↗

NASA NTRS1991

Collar grids for intersecting geometric components within the Chimera overlapped grid scheme

A method for overcoming problems with using the Chimera overset grid scheme in the region of intersecting geometry components is presented. A 'collar grid' resolves the intersection region and provides communication between the component grids. This approach is validated by comparing computed and experimental data for a flow about a wing/body configuration. Application of the collar grid scheme to the Orbiter fuselage and vertical tail intersection in a computation of the full Space Shuttle launch vehicle demonstrates its usefulness for simulation of flow about complex aerospace vehicles.

Parks, Steven J.↗

NASA NTRS2000

A Tool for Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D has shown that HPF provides an efficient, concise way to express parallelism and to organize data traffic. The use of HPF, as noted in the papers, requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement, and data granularity. To simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and implemented ADAPT (Automatic Data Alignment and Placement Tool). ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT, and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level, or on the application interface level. ADAPT annotates an existing CFD FORTRAN application, performing computations on single or multiple grids. On each grid the application is considered as a sequence of operators, each applied to a set of variables defined in a particular grid domain. ADAPT automatically detects implicit operators (i.e., having data dependences) and explicit operators (without data dependences). For parallelization of an explicit operator ADAPT creates a template for the operator domain, aligns arrays used in the operator with the template, distributes the template, and declares the loops over the distributed dimensions as INDEPENDENT. For parallelization of an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if the compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator, then the loop which implements the operator can be declared as INDEPENDENT. ADAPT starts with an analysis of array index expressions of the loop nests. For each pair of arrays referenced in an assignment statement, it generates an arc in the alignment graph and annotates it with an affinity relation. The template, alignment, and distribution directives for a particular loop nest are then derived from a transitive closure of the affinity relation. A compromise of data distributions in different nests and subroutines is achieved by merging annotated alignment graphs for adjacent nests/stibroutine calls in the nest/call graph of the application in the process called distribution lifting. ADAPT has been implemented as a C++ program running in conjunction with a parallelization tool called CAPTools. ADAPT uses the parse tree, interprocedural analysis and application database generated by CAPTools. It also uses the Directed Graph class, initially implemented in p2d2 (parallel debugger oi distributed programs), and some other classes supporting symbolic computations. ADAPT uses data distribution techniques described. ADAPT was tested with ARC3D and the FT benchmark and has demonstrated a code performance within a factor of 1.5 of handwritten versions.

Frumkin, Michael↗

NASA NTRS1999

Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D showed that HPF has potential to be a high level language for parallelization of CFD applications. The use of HPF requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement and data granularity. Since HPF hides data movement from the user even with this knowledge it is easy to overlook pieces of the code causing low performance of the application. In order to simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and partially implemented ADAPT (Automatic Data Distribution and Placement Tool). The ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level or inter application level. ADAPT is designed to annotate existing CFD FORTRAN application performing computations on single or multiple grids. On each grid the application can considered as a sequence of operators each applied to a set of variables defined in a particular grid domain. The operators can be classified as implicit, having data dependences, and explicit, without data dependences. In order to parallelize an explicit operator it is sufficient to create a template for the domain of the operator, align arrays used in the operator with the template, distribute the template, and declare the loops over the distributed dimensions as INDEPENDENT. In order to parallelize an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator then the loop which implements the operator can be declared as INDEPENDENT.

Frumkin, Michael↗

DOE OSTI2024

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗

DOE OSTI2024

Grid Optimization Competition Challenge 3 Problem Formulation

This report contains the problem formulation for the Grid Optimization (GO) Competition Challenge 3. The Grid Optimization Competition is run by a team of researchers from a number of organizations, including the sponsor Advanced Research Projects Agency - Energy (ARPA-E), lead organization Pacific Northwest National Laboratory (PNNL), and technical contributors from Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), Georgia Institute of Technology (GT), University of Wisconsin (UW), and others. The GO Competition poses challenge problems in the field of power grid management, invites entrants to develop solvers for these problems, invokes the solvers on a set of problem instances using common hardware, ranks the solvers according to their performance, and awards prizes according to the rankings. The overall goal of the GO Competition is to spur innovative research on high impact and computationally challenging problems in power grid management from initial development through commercial deployment. Complete information about the GO Competition can be found online at [2]. The webpage covers previous Challenges, rules, timeline, registration information, data formats, scoring methods, computational platform information, information on supported solvers and languages, sponsor information, frequently asked questions, administrator contact information, publicly available problem instances, computer code for reading and evaluating problem and solution data, a sandbox for testing solvers, and a solver submission interface, results, and publications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1991

CFD in the 1980's from one point of view

The present interpretive treatment of the development history of CFD in the 1980s gives attention to advancements in such algorithmic techniques as flux Jacobian-based upwind differencing, total variation-diminishing and essentially nonoscillatory schemes, multigrid methods, unstructured grids, and nonrectangular structured grids. At the same time, computational turbulence research gave attention to turbulence modeling on the bases of increasingly powerful supercomputers and meticulously constructed databases. The major future developments in CFD will encompass such capabilities as structured and unstructured three-dimensional grids.

Lomax, Harvard↗

NASA NTRS1993

Two-dimensional radiative transfer in cloudy atmospheres - The spherical harmonic spatial grid method

A new two-dimensional monochromatic method that computes the transfer of solar or thermal radiation through atmospheres with arbitrary optical properties is described. The model discretizes the radiative transfer equation by expanding the angular part of the radiance field in a spherical harmonic series and representing the spatial part with a discrete grid. The resulting sparse coupled system of equations is solved iteratively with the conjugate gradient method. A Monte Carlo model is used for extensive verification of outgoing flux and radiance values from both smooth and highly variable (multifractal) media. The spherical harmonic expansion naturally allows for different levels of approximation, but tests show that the 2D equivalent of the two-stream approximation is poor at approximating variations in the outgoing flux. The model developed here is shown to be highly efficient so that media with tens of thousands of grid points can be computed in minutes. The large improvement in efficiency will permit quick, accurate radiative transfer calculations of realistic cloud fields and improve our understanding of the effect of inhomogeneity on radiative transfer in cloudy atmospheres.

Evans, K. F.↗

NASA NTRS2002

A Three-Dimensional Parallel Time-Accurate Turbopump Simulation Procedure Using Overset Grid System

The objective of the current effort is to provide a computational framework for design and analysis of the entire fuel supply system of a liquid rocket engine, including high-fidelity unsteady turbopump flow analysis. This capability is needed to support the design of pump sub-systems for advanced space transportation vehicles that are likely to involve liquid propulsion systems. To date, computational tools for design/analysis of turbopump flows are based on relatively lower fidelity methods. An unsteady, three-dimensional viscous flow analysis tool involving stationary and rotational components for the entire turbopump assembly has not been available for real-world engineering applications. The present effort provides developers with information such as transient flow phenomena at start up, and nonuniform inflows, and will eventually impact on system vibration and structures. In the proposed paper, the progress toward the capability of complete simulation of the turbo-pump for a liquid rocket engine is reported. The Space Shuttle Main Engine (SSME) turbo-pump is used as a test case for evaluation of the hybrid MPI/Open-MP and MLP versions of the INS3D code. CAD to solution auto-scripting capability is being developed for turbopump applications. The relative motion of the grid systems for the rotor-stator interaction was obtained using overset grid techniques. Unsteady computations for the SSME turbo-pump, which contains 114 zones with 34.5 million grid points, are carried out on Origin 3000 systems at NASA Ames Research Center. Results from these time-accurate simulations with moving boundary capability are presented along with the performance of parallel versions of the code.

Kiris, Cetin↗

NASA NTRS2001

A Three Dimensional Parallel Time Accurate Turbopump Simulation Procedure Using Overset Grid Systems

The objective of the current effort is to provide a computational framework for design and analysis of the entire fuel supply system of a liquid rocket engine, including high-fidelity unsteady turbopump flow analysis. This capability is needed to support the design of pump sub-systems for advanced space transportation vehicles that are likely to involve liquid propulsion systems. To date, computational tools for design/analysis of turbopump flows are based on relatively lower fidelity methods. An unsteady, three-dimensional viscous flow analysis tool involving stationary and rotational components for the entire turbopump assembly has not been available for real-world engineering applications. The present effort provides developers with information such as transient flow phenomena at start up, and non-uniform inflows, and will eventually impact on system vibration and structures. In the proposed paper, the progress toward the capability of complete simulation of the turbo-pump for a liquid rocket engine is reported. The Space Shuttle Main Engine (SSME) turbo-pump is used as a test case for evaluation of the hybrid MPI/Open-MP and MLP versions of the INS3D code. CAD to solution auto-scripting capability is being developed for turbopump applications. The relative motion of the grid systems for the rotor-stator interaction was obtained using overset grid techniques. Unsteady computations for the SSME turbo-pump, which contains 114 zones with 34.5 million grid points, are carried out on Origin 3000 systems at NASA Ames Research Center. Results from these time-accurate simulations with moving boundary capability will be presented along with the performance of parallel versions of the code.

Kiris, Cetin↗

NASA NTRS1988

Parametric study of grid size, time step and turbulence modeling on Navier-Stokes computations over airfoils

An upwind-biased implicit approximate factorization algorithm is applied to several steady and unsteady turbulent flows. The thin layer form of the compressible Navier-Stokes equation is used. Both the flux vector splitting and flux difference splitting methods are used to determine fluxes, and the results are compared. Flux difference splitting predicts results more accurately than flux vector splitting on a given mesh size, but, in its present implementation, is more severely limited by the maximum CFL number for unsteady time accurate flows. Physical aspects of the computations are also examined. An equilibrium turbulent boundary layer model computes generally better steady and unsteady results than a nonequilibrium model when there is little to no boundary layer separation. Conversely, when a significant region of separation exists, the nonequilibrium model performs in better agreement with experiment.

Rumsey, Christopher L.↗

NASA NTRS1989

Algebraic turbulence models for the computation of two-dimensional high-speed flows using unstructured grids

The incorporation of algebraic turbulence models in a solver for the 2-D compressible Navier-Stokes equations using triangular grids is described. A practial way to use the Cebeci Smith model, and to modify it in separated regions is proposed. The ability of the model to predict high speed, perfect gas boundary layers is investigated from a numerical point of view.

Rostand, Philippe↗

DOE OSTI2024

A Review of Edge Computing Technology and Its Applications in Power Systems

Recent advancements in network-connected devices have led to a rapid increase in the deployment of smart devices and enhanced grid connectivity, resulting in a surge in data generation and expanded deployment to the edge of systems. Classic cloud computing infrastructures are increasingly challenged by the demands for large bandwidth, low latency, fast response speed, and strong security. Therefore, edge computing has emerged as a critical technology to address these challenges, gaining widespread adoption across various sectors. This paper introduces the advent and capabilities of edge computing, reviews its state-of-the-art architectural advancements, and explores its communication techniques. A comprehensive analysis of edge computing technologies is also presented. Furthermore, this paper highlights the transformative role of edge computing in various areas, particularly emphasizing its role in power systems. It summarizes edge computing applications in power systems that are oriented from the architectures, such as power system monitoring, smart meter management, data collection and analysis, resource management, etc. Additionally, the paper discusses the future opportunities of edge computing in enhancing power system applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

H-AMR: A New GPU-accelerated GRMHD Code for Exascale Computing with 3D Adaptive Mesh Refinement and Local Adaptive Time Stepping

General relativistic magnetohydrodynamic (GRMHD) simulations have revolutionized our understanding of black hole accretion. Here, we present a GPU-accelerated GRMHD code H-AMR with multifaceted optimizations that, collectively, accelerate computation by 2–5 orders of magnitude for a wide range of applications. First, it introduces a spherical grid with 3D adaptive mesh refinement that operates in each of the three dimensions independently. This allows us to circumvent the Courant condition near the polar singularity, which otherwise cripples high-resolution computational performance. Second, we demonstrate that local adaptive time stepping on a logarithmic spherical-polar grid accelerates computation by a factor of ≲10 compared to traditional hierarchical time-stepping approaches. Jointly, these unique features lead to an effective speed of ~10 9 zone cycles per second per node on 5400 NVIDIA V100 GPUs (i.e., 900 nodes of the OLCF Summit supercomputer). We illustrate H-AMR's computational performance by presenting the first GRMHD simulation of a tilted thin accretion disk threaded by a toroidal magnetic field around a rapidly spinning black hole. With an effective resolution of 13,440 × 4608 × 8092 cells and a total of ≲22 billion cells and ~0.65 × 10 8 time steps, it is among the largest astrophysical simulations ever performed. We find that frame dragging by the black hole tears up the disk into two independently precessing subdisks. The innermost subdisk rotation axis intermittently aligns with the black hole spin, demonstrating for the first time that such long-sought alignment is possible in the absence of large-scale poloidal magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1993

IGES transformer and NURBS in grid generation

In the field of Grid Generation and the CAD/CAM, there are numerous geometry output formats which require the designer to spend a great deal of time manipulating geometrical entities in order to achieve a useful sculptured geometrical description for grid generation. Also in this process, there is a danger of losing fidelity of the geometry under consideration. This stresses the importance of a standard geometry definition for the communication link between varying CAD/CAM and grid system. The IGES (Initial Graphics Exchange Specification) file is a widely used communication between CAD/CAM and the analysis tools. The scientists at NASA Research Centers - including NASA Ames, NASA Langley, NASA Lewis, NASA Marshall - have recognized this importance and, therefore, in 1992 they formed the committee of the 'NASA-IGES' which is the subset of the standard IGES. This committee stresses the importance and encourages the CFD community to use the standard IGES file for the interface between the CAD/CAM and CFD analysis. Also, two of the IGES entities -- the NURBS Curve (Entity 126) and NURBS Surface (Entity 128) -- which have many useful geometric properties -- like the convex hull property, local control property and affine invariance, also widely utilized analytical geometries can be accurately represented using NURBS. This is important in today grid generation tools because of the emphasis of the interactive design. To satisfy the geometry transformation between the CAD/CAM system and Grid Generation field, the CAGI (Computer Aided Geometry Design) developed, which include the Geometry Transformation, Geometry Manipulation and Geometry Generation as well as the user interface. This paper will present the successful development IGES file transformer and application of NURBS definition in the grid generation.

Yu, Tzu-Yi↗