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,063 records · Page 59

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗

NASA NTRS1993

Rapid exploration of curvilinear grids using direct volume rendering

Fast techniques for direct volume rendering over curvilinear grids of hexahedral cells are developed. This type of 3D grid is common in computational fluid dynamics and finite element analysis. Four new projection methods are presented and compared with each other and with previous methods for tetrahedral grids and rectilinear grids. All four methods use polygon-rendering hardware for speed. A simplified algorithm for visibility ordering, which is based on a combination of breadth-first and depth-first searches, is described. A new multi-pass blending method is described that reduces visual artifacts that are introduced by linear interpolation in hardware where exponential interpolation is needed. Multi-pass blending is of equal interest to hardware-oriented projection methods used on rectilinear grids. Visualization tools that permit rapid data banding and cycling through transfer functions, as well as region restrictions, are described.

Vangelder, Allen↗

NASA NTRS2006

PEGASUS 5: An Automated Pre-Processor for Overset-Grid CFD

This viewgraph presentation reviews the use and requirements of Pegasus 5. PEGASUS 5 is a code which performs a pre-processing step for the Overset CFD method. The code prepares the overset volume grids for the flow solver by computing the domain connectivity database, and blanking out grid points which are contained inside a solid body. PEGASUS 5 successfully automates most of the overset process. It leads to dramatic reduction in user input over previous generations of overset software. It also can lead to an order of magnitude reduction in both turn-around time and user expertise requirements. It is also however not a "black-box" procedure; care must be taken to examine the resulting grid system.

Rogers, Stuart E.↗

NASA NTRS2008

Transient Three-Dimensional Startup Side Load Analysis of a Regeneratively Cooled Nozzle

The objective of this effort is to develop a computational methodology to capture the startup side load physics and to anchor the computed aerodynamic side loads with the available data from a regeneratively cooled, high-aspect-ratio nozzle, hot-fired at sea level. The computational methodology is based on an unstructured-grid, pressure-based, reacting flow computational fluid dynamics and heat transfer formulation, a transient 5 s inlet history based on an engine system simulation, and a wall temperature distribution to reflect the effect of regenerative cooling. To understand the effect of regenerative wall cooling, two transient computations were performed using the boundary conditions of adiabatic and cooled walls, respectively. The results show that three types of shock evolution are responsible for side loads: generation of combustion wave; transitions among free-shock separation, restricted-shock separation, and simultaneous free-shock and restricted shock separations; along with the pulsation of shocks across the lip, although the combustion wave is commonly eliminated with the sparklers during actual test. The test measured two side load events: a secondary and lower side load, followed by a primary and peak side load. Results from both wall boundary conditions captured the free-shock separation to restricted-shock separation transition with computed side loads matching the measured secondary side load. For the primary side load, the cooled wall transient produced restricted-shock pulsation across the nozzle lip with peak side load matching that of the test, while the adiabatic wall transient captured shock transitions and free-shock pulsation across the lip with computed peak side load 50% lower than that of the measurement. The computed dominant pulsation frequency of the cooled wall nozzle agrees with that of a separate test, while that of the adiabatic wall nozzle is more than 50% lower than that of the measurement. The computed teepee-like formation and the tangential motion of the shocks during lip pulsation also qualitatively agree with those of test observations. Moreover, a third transient computation was performed with a proportionately shortened 1 s sequence, and lower side loads were obtained with the higher ramp rate.

Wang, Ten-See↗

NASA NTRS2017

Ionospheric Slant Total Electron Content Analysis Using Global Positioning System Based Estimation

A method, system, apparatus, and computer program product provide the ability to analyze ionospheric slant total electron content (TEC) using global navigation satellite systems (GNSS)-based estimation. Slant TEC is estimated for a given set of raypath geometries by fitting historical GNSS data to a specified delay model. The accuracy of the specified delay model is estimated by computing delay estimate residuals and plotting a behavior of the delay estimate residuals. An ionospheric threat model is computed based on the specified delay model. Ionospheric grid delays (IGDs) and grid ionospheric vertical errors (GIVEs) are computed based on the ionospheric threat model.

Sparks, Lawrence C.↗

NASA NTRS1995

An Improved Ionospheric Correction Method for Wide-Area Augmentation Systems

A powerful approach for generating ionospheric corrections in wide area differential GPS applications has been developed, that can be applied to the Federal Aviation Administration's Wide Area Augmentation System (WAAS). This approach has been used to support ionospheric calibration for NASA's Deep Space Network and will be supporting real-time operations for global ionospheric specification and, possibly, single-frequency satellite altimeter calibration. It is a real-time, grid-based technique relying on a computationally efficient Kalman-type filter to produce accurate, smoothly varying ionospheric correction maps over the coverage area. Formal error maps are also computed, providing vertical delay errors over the WAAS grid, which are useful in integrity monitoring. This solution to the ionospheric correction problem is self-calibrating, since GPS transmitter inter-frequency biases are obtained as a by-product of the mapping procedure. This contrasts with other techniques in which bias values must be provided from some additional source.

Wide-Area↗

NASA NTRS2009

Simulation of an Isolated Tiltrotor in Hover with an Unstructured Overset-Grid RANS Solver

An unstructured overset-grid Reynolds Averaged Navier-Stokes (RANS) solver, FUN3D, is used to simulate an isolated tiltrotor in hover. An overview of the computational method is presented as well as the details of the overset-grid systems. Steady-state computations within a noninertial reference frame define the performance trends of the rotor across a range of the experimental collective settings. Results are presented to show the effects of off-body grid refinement and blade grid refinement. The computed performance and blade loading trends show good agreement with experimental results and previously published structured overset-grid computations. Off-body flow features indicate a significant improvement in the resolution of the first perpendicular blade vortex interaction with background grid refinement across the collective range. Considering experimental data uncertainty and effects of transition, the prediction of figure of merit on the baseline and refined grid is reasonable at the higher collective range- within 3 percent of the measured values. At the lower collective settings, the computed figure of merit is approximately 6 percent lower than the experimental data. A comparison of steady and unsteady results show that with temporal refinement, the dynamic results closely match the steady-state noninertial results which gives confidence in the accuracy of the dynamic overset-grid approach.

Lee-Rausch, Elizabeth M.↗

NASA NTRS1989

A Simple Algebraic Grid Adaptation Scheme with Applications to Two- and Three-dimensional Flow Problems

An algebraic adaptive grid scheme based on the concept of arc equidistribution is presented. The scheme locally adjusts the grid density based on gradients of selected flow variables from either finite difference or finite volume calculations. A user-prescribed grid stretching can be specified such that control of the grid spacing can be maintained in areas of known flowfield behavior. For example, the grid can be clustered near a wall for boundary layer resolution and made coarse near the outer boundary of an external flow. A grid smoothing technique is incorporated into the adaptive grid routine, which is found to be more robust and efficient than the weight function filtering technique employed by other researchers. Since the present algebraic scheme requires no iteration or solution of differential equations, the computer time needed for grid adaptation is trivial, making the scheme useful for three-dimensional flow problems. Applications to two- and three-dimensional flow problems show that a considerable improvement in flowfield resolution can be achieved by using the proposed adaptive grid scheme. Although the scheme was developed with steady flow in mind, it is a good candidate for unsteady flow computations because of its efficiency.

Hsu, Andrew T.↗

NASA NTRS1981

Trends and pacing items in computational aerodynamics

A perspective is presented of trends in computational aerodynamics, and of important technology development items that pace future advanced applications. From a survey of AIAA Journal papers published during the past two decades, the growth trends and the progressively increasing emphasis on code development for viscous, compressible, turbulent flow are illustrated. These trends are reflected in the chronology of introduction by the aerospace industry of new computational methods in aircraft design. Key pacing items outlined are: automatic grid generation for nonlinear inviscid computations; advanced computers, improved efficiency of numerical methods, and improved turbulence models for Reynolds-averaged Navier-Stokes computations; advanced computers, time-dependent three-dimensional law-of-the-wall, code development, improved efficiency of numerical methods, and improved subgrid-scale turbulence modeling for large eddy simulations.

Chapman, D. R.↗

NASA NTRS1998

Dynamic Load Balancing for Adaptive Meshes using Symmetric Broadcast Networks

Many scientific applications involve grids that lack a uniform underlying structure. These applications are often dynamic in the sense that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing inter-processor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view across processors. In this paper, we compare a novel load balancer that utilizes symmetric broadcast networks (SBN) to a successful global load balancing environment (PLUM) created to handle adaptive unstructured applications. Our experimental results on the IBM SP2 demonstrate that performance of the proposed SBN load balancer is comparable to results achieved under PLUM.

Das, Sajal K.↗

NASA NTRS2004

Complexity Computational Environment: Data Assimilation SERVOGrid

We are using Web (Grid) service technology to demonstrate the assimilation of multiple distributed data sources (a typical data grid problem) into a major parallel high-performance computing earthquake forecasting code. Such a linkage of Geoinformatics with Geocomplexity demonstrates the value of the Solid Earth Research Virtual Observatory (SERVO) Grid concept, and advance Grid technology by building the first real-time large-scale data assimilation grid Here we develop the next steps for both the SERVO concept and the identified need for a Solid Earth problem-solving environment. We use a challenging motivating problem of importance to NASA namely integrating NASA space geodetic observations with numerical simulations of a changing earth.

data assimiliation↗

NASA NTRS2011

Summary of the Tandem Cylinder Solutions from the Benchmark Problems for Airframe Noise Computations-I Workshop

Fifteen submissions in the tandem cylinders category of the First Workshop on Benchmark problems for Airframe Noise Computations are summarized. Although the geometry is relatively simple, the problem involves complex physics. Researchers employed various block-structured, overset, unstructured and embedded Cartesian grid techniques and considerable computational resources to simulate the flow. The solutions are compared against each other and experimental data from 2 facilities. Overall, the simulations captured the gross features of the flow, but resolving all the details which would be necessary to compute the noise remains challenging. In particular, how to best simulate the effects of the experimental transition strip, and the associated high Reynolds number effects, was unclear. Furthermore, capturing the spanwise variation proved difficult.

Lockard, David P.↗

NASA NTRS2006

Distributed Computing Framework for Synthetic Radar Application

We are developing an extensible software framework, in response to Air Force and NASA needs for distributed computing facilities for a variety of radar applications. The objective of this work is to develop a Python based software framework, that is the framework elements of the middleware that allows developers to control processing flow on a grid in a distributed computing environment. Framework architectures to date allow developers to connect processing functions together as interchangeable objects, thereby allowing a data flow graph to be devised for a specific problem to be solved. The Pyre framework, developed at the California Institute of Technology (Caltech), and now being used as the basis for next-generation radar processing at JPL, is a Python-based software framework. We have extended the Pyre framework to include new facilities to deploy processing components as services, including components that monitor and assess the state of the distributed network for eventual real-time control of grid resources.

synthetic aperture radar (SAR)↗

DOE OSTI2021

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Abstract A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to ( N ‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned ( N‐ ) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSB). The LSB algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSB algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1991

Algebraic grid generation for complex geometries

An efficient computer program called GRID2D/3D has been developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2D and 3D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation. The distribution of grid points within the spatial domain is controlled by stretching functions and grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For 2D spatial domains the boundary curves are constructed by using either cubic or tension spline interpolation. For 3D spatial domains the boundary surfaces are constructed by using a new technique, developed in this study, referred to as 3D bidirectional Hermite interpolation.

Shih, T. I.-P.↗

NASA NTRS1985

A consistent spatial differencing scheme for the transonic full-potential equation in three dimensions

A full-potential steady transonic wing flow solver has been modified so that freestream density and residual are captured in regions of constant velocity. This numerically precise freestream consistency is obtained by slightly altering the differencing scheme without affecting the implicit solution algorithm. The changes chiefly affect the fifteen metrics per grid point, which are computed once and stored. With this new method, the outer boundary condition is captured accurately, and the smoothness of the solution is especially improved near regions of grid discontinuity.

Thomas, S. D.↗

DOE OSTI2022

Cyber Infrastructure for the Smart Electric Grid

As electric power systems undergo a transformative upgrade with the integration of advanced technologies to enable the smarter electric grid, professionals who work in the area require a new understanding of the evolving complexity of the grid. Cyber Infrastructure for the Smart Electric Grid delivers a comprehensive overview of the fundamental principles of smart grid operation and control, smart grid technologies, including sensors, communication networks, computation, data management, and cyber security, and the interdependencies between the component technologies on which a smart grid's security depends. The book offers readers the opportunity to critically analyze the smart grid infrastructure needed to sense, communicate, compute, and control in a secure way.

communication networks↗

NASA NTRS1991

Grid-refinement study of hypersonic laminar flow over a 2-D ramp

Computations were made for those test cases of Problem 3 which were designated as laminar flows, viz., test cases 3.1, 3.2, 3.4, and 3.5. These test cases corresponded to flows over a flat plate and a compression ramp at high Mach number and at high Reynolds number. The computations over the compression ramps indicate a substantial streamwise extent of separation. Based on previous experience with separated laminar flows at high Mach numbers which indicated a substantial effect with spatial grid refinement, a series of computations with different grid sizes were performed. Also, for the flat plate, comparisons of the results for two different algorithms were made.

Thomas, James L.↗