SEARCH · Search NASA

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 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS2004

Grist : grid-based data mining for astronomy

The Grist project is developing a grid-technology based system as a research environment for astronomy with massive and complex datasets. This knowledge extraction system will consist of a library of distributed grid services controlled by a workflow system, compliant with standards emerging from the grid computing, web services, and virtual observatory communities. This new technology is being used to find high redshift quasars, study peculiar variable objects, search for transients in real time, and fit SDSS QSO spectra to measure black hole masses. Grist services are also a component of the 'hyperatlas' project to serve high-resolution multi-wavelength imagery over the Internet. In support of these science and outreach objectives, the Grist framework will provide the enabling fabric to tie together distributed grid services in the areas of data access, federation, mining, subsetting, source extraction, image mosaicking, statistics, and visualization.

grid computing↗

NASA NTRSDate not supplied

A Wall-Distance Method for Turbulence Modeling

The distance from a grid point to the closest wall surface, wall distance, is a funda- mental quantity in turbulence modeling. Efficiency of wall-distance calculations has become more critical as the size of computational grids has significantly increased in recent years. This paper reports on an initial implementation of a new search-based wall-distance method that is suitable for general unstructured computational fluid dynamics (CFD) grids and tailored for requirements specific for turbulence modeling. The method represents a two-step approach to calculate the wall distance. In the first step, the wall distance is approximated for each grid point as the minimum distance from this point to a vertex of a triangular face at the wall. The point-to-vertex distance calculation is relatively inexpensive but may lead to a significant error in the wall-distance ap- proximation, especially for grid points near the wall. In the second step, for grid points located within a predefined distance ( threshold ) from the wall, the wall distance is computed as the minimum distance to wall faces. As a result, the wall distance is exact for all grid points within the threshold. This two-step approach reduces the computational cost yet achieves high and controllable accuracy in the evaluation of the wall distance. Algorithmic enhancements are presented to improve efficiency of wall-distance computations. Comprehensive assessment of the new method is reported for large-scale unstructured CFD grids generated for the Fifth AIAA CFD High-Lift Prediction Workshop. The performance of the new wall-distance method compares favorably with performance of two established methods implemented in high-performance CFD codes.

Wall Distance↗

NASA NTRS1991

Generating Three-Dimensional Grids About Anything

Three-Dimensional Grids About Anything by Poisson's Equation (3DGRAPE) computer program designed to make computational grids in or about almost any shape. Generated by solution of Poisson's differential equations in three dimensions. Program automatically finds its own values for inhomogeneous terms giving near-orthogonality and controlled grid-cell height at boundaries. Grids generated applied to both viscous and inviscid aerodynamic problems, and to problems in other areas of fluid dynamics. Written in 100 percent FORTRAN 77.

Sorenson, Reese L.↗

NASA NTRS1991

Gridding strategies and associated results for winged entry vehicles

Two volume grid strategies based on similar software are presented for a geometrically complex entry vehicle. It is shown that quick relatively simple grid generation techniques can be used to construct computational grids about entry vehicles with nontrivial geometric complexity. Particular attention is given to both single- and dual-block grid topologies for a lifting body and solution generated on each grid. Results indicate that the grid topology can have an effect on the nature of the solution.

Weilmuenster, K. J.↗

NASA NTRS1999

The Future of Electronic Device Design: Device and Process Simulation Find Intelligence on the World Wide Web

We are on the path to meet the major challenges ahead for TCAD (technology computer aided design). The emerging computational grid will ultimately solve the challenge of limited computational power. The Modular TCAD Framework will solve the TCAD software challenge once TCAD software developers realize that there is no other way to meet industry's needs. The modular TCAD framework (MTF) also provides the ideal platform for solving the TCAD model challenge by rapid implementation of models in a partial differential solver.

Biegel, Bryan A.↗

NASA NTRS2006

Fibonacci Grids

Recent years have seen a resurgence of interest in a variety of non-standard computational grids for global numerical prediction. The motivation has been to reduce problems associated with the converging meridians and the polar singularities of conventional regular latitude-longitude grids. A further impetus has come from the adoption of massively parallel computers, for which it is necessary to distribute work equitably across the processors; this is more practicable for some non-standard grids. Desirable attributes of a grid for high-order spatial finite differencing are: (i) geometrical regularity; (ii) a homogeneous and approximately isotropic spatial resolution; (iii) a low proportion of the grid points where the numerical procedures require special customization (such as near coordinate singularities or grid edges). One family of grid arrangements which, to our knowledge, has never before been applied to numerical weather prediction, but which appears to offer several technical advantages, are what we shall refer to as "Fibonacci grids". They can be thought of as mathematically ideal generalizations of the patterns occurring naturally in the spiral arrangements of seeds and fruit found in sunflower heads and pineapples (to give two of the many botanical examples). These grids possess virtually uniform and highly isotropic resolution, with an equal area for each grid point. There are only two compact singular regions on a sphere that require customized numerics. We demonstrate the practicality of these grids in shallow water simulations, and discuss the prospects for efficiently using these frameworks in three-dimensional semi-implicit and semi-Lagrangian weather prediction or climate models.

Swinbank, Richard↗

NASA NTRS2001

NAS Grid Benchmarks: A Tool for Grid Space Exploration

We present an approach for benchmarking services provided by computational Grids. It is based on the NAS Parallel Benchmarks (NPB) and is called NAS Grid Benchmark (NGB) in this paper. We present NGB as a data flow graph encapsulating an instance of an NPB code in each graph node, which communicates with other nodes by sending/receiving initialization data. These nodes may be mapped to the same or different Grid machines. Like NPB, NGB will specify several different classes (problem sizes). NGB also specifies the generic Grid services sufficient for running the bench-mark. The implementor has the freedom to choose any specific Grid environment. However, we describe a reference implementation in Java, and present some scenarios for using NGB.

Frumkin, Michael↗

NASA NTRS1987

Turbulence statistics in fully developed channel flow at low Reynolds number

A direct numerical simulation of a turbulent channel flow is performed. The unsteady Navier-Stokes equations are solved numerically at a Reynolds number of 3300, based on the mean centerline velocity and channel half-width, with about 4 million grid points. All essential turbulence scales are resolved on the computational grid and no subgrid model is used. A large number of turbulence statistics are computed and compared with the existing experimental data at comparable Reynolds numbers. Agreements as well as discrepancies are discussed in detail. Particular attention is given to the behavior of turbulence correlations near the wall. A number of statistical correlations which are complementary to the existing experimental data are reported for the first time.

Kim, John↗

NASA NTRS2019

Kestrel Results at Liftoff Conditions for a Space Launch System Configuration in Proximity to the Launch Tower

Aerodynamic data books for Space Launch System vehicles require databases for the integrated forces and moments and section loads during liftoff and transition to the ascent phase of flight. While the force and moment database can be generated from wind tunnel results, computational analyses are necessary to provide the extensive surface information required to generate proper lineloads. Of the two flight regimes, the liftoff problem is the more costly and complex situation to simulate, as it requires modeling of the vehicle in proximity to the launch tower. The effects of massive separation on the leeward pressure fields of both the tower and vehicle are not well captured with RANS methods, necessitating the use of more advanced methods, such as Delayed Detached Eddy Simulation, in conjunction with computational grids sufficiently refined to resolve the wakes. Details on the computational setup for employing the Kestrel flow solver to address the liftoff problem are presented. The methodology involves the use of independent unstructured near-body grids for the vehicle and the tower, overset by a solution adaptive Cartesian off-body grid. Results from the simulations are compared to experimental results from a test in the NASA Langley Research Center 14- by 22-Foot Subsonic Tunnel.

Computational fluid dynamics↗

NASA NTRS2001

Using Computing and Data Grids for Large-Scale Science and Engineering

We use the term "Grid" to refer to a software system that provides uniform and location independent access to geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. These emerging data and computing Grids promise to provide a highly capable and scalable environment for addressing large-scale science problems. We describe the requirements for science Grids, the resulting services and architecture of NASA's Information Power Grid (IPG) and DOE's Science Grid, and some of the scaling issues that have come up in their implementation.

Johnston, William E.↗

NASA NTRS1991

Navier-Stokes Computations On Zonal Grids

Report describes numerical simulations of transonic flow of air about isolated wing and about wing and fuselage (not tail assembly) of F-16A aircraft. Fast, diagonalized Beam-Warming numerical-integration algorithm for solution of Euler and Navier-Stokes equations applied via Transonic Navier-Stokes computer program, using computational grids divided into zones of coarse and finer meshes.

Flores, Jolen↗

NASA NTRS1976

Development of a computer code for calculating the steady super/hypersonic inviscid flow around real configurations. Volume 1: Computational technique

A numerical procedure has been developed to compute the inviscid super/hypersonic flow field about complex vehicle geometries accurately and efficiently. A second order accurate finite difference scheme is used to integrate the three dimensional Euler equations in regions of continuous flow, while all shock waves are computed as discontinuities via the Rankine Hugoniot jump conditions. Conformal mappings are used to develop a computational grid. The effects of blunt nose entropy layers are computed in detail. Real gas effects for equilibrium air are included using curve fits of Mollier charts. Typical calculated results for shuttle orbiter, hypersonic transport, and supersonic aircraft configurations are included to demonstrate the usefulness of this tool.

Marconi, F.↗

NASA NTRS1976

Development of a computer code for calculating the steady super/hypersonic inviscid flow around real configurations. Volume 2: Code description

A numerical procedure was developed to compute the inviscid super/hypersonic flow field about complex vehicle geometries accurately and efficiently. A second-order accurate finite difference scheme is used to integrate the three-dimensional Euler equations in regions of continuous flow, while all shock waves are computed as discontinuities via the Rankine-Hugoniot jump conditions. Conformal mappings are used to develop a computational grid. The effects of blunt nose entropy layers are computed in detail. Real gas effects for equilibrium air are included using curve fits of Mollier charts. Typical calculated results for shuttle orbiter, hypersonic transport, and supersonic aircraft configurations are included to demonstrate the usefulness of this tool.

Marconi, F.↗

NASA NTRS1985

Evaluation of an aerodynamic-load prediction method on a STOL fighter configuration

A three-dimensional panel method was used to compute the aerodynamic loads on a large-scale, powered wind tunnel model. The size of the computation grid was selected such that turnaround times, on present computers remained satisfactory. With this constraint, the STOL aircraft configuration was modeled and the capabilities and limitations of the prediction method were investigated. After this study, a similar numerical model was established for a forward-swept-wing aircraft configuration which is planned for large-scale, low-speed testing. The resulting aerodynamic-load predictions are discussed and will be utilized, together with the future experimental results, to obtain a broader validation of this method as well as to reduce the necessary size of the matrix of the test parameters.

Katz, J.↗

NASA NTRS1986

Evaluation of an aerodynamic-load prediction method on a STOL fighter configuration

Katz, J.↗

NASA NTRS2001

Generic Divide and Conquer Internet-Based Computing

The rapid growth of internet-based applications and the proliferation of networking technologies have been transforming traditional commercial application areas as well as computer and computational sciences and engineering. This growth stimulates the exploration of new, internet-oriented software technologies that can open new research and application opportunities not only for the commercial world, but also for the scientific and high -performance computing applications community. The general goal of this research project is to contribute to better understanding of the transition to internet-based high -performance computing and to develop solutions for some of the difficulties of this transition. More specifically, our goal is to design an architecture for generic divide and conquer internet-based computing, to develop a portable implementation of this architecture, to create an example library of high-performance divide-and-conquer computing agents that run on top of this architecture, and to evaluate the performance of these agents. We have been designing an architecture that incorporates a master task-pool server and utilizes satellite computational servers that operate on the Internet in a dynamically changing large configuration of lower-end nodes provided by volunteer contributors. Our designed architecture is intended to be complementary to and accessible from computational grids such as Globus, Legion, and Condor. Grids provide remote access to existing high-end computing resources; in contrast, our goal is to utilize idle processor time of lower-end internet nodes. Our project is focused on a generic divide-and-conquer paradigm and its applications that operate on a loose and ever changing pool of lower-end internet nodes.

Radenski, Atanas↗

NASA NTRS2002

Progress in Unsteady Turbopump Flow Simulations

This viewgraph presentation discusses unsteady flow simulations for a turbopump intended for a reusable launch vehicle (RLV). The simulation process makes use of computational grids and parallel processing. The architecture of the parallel computers used is discussed, as is the scripting of turbopump simulations.

Kiris, Cetin C.↗

NASA NTRS2003

Generic Divide and Conquer Internet-Based Computing

The growth of Internet-based applications and the proliferation of networking technologies have been transforming traditional commercial application areas as well as computer and computational sciences and engineering. This growth stimulates the exploration of Peer to Peer (P2P) software technologies that can open new research and application opportunities not only for the commercial world, but also for the scientific and high-performance computing applications community. The general goal of this project is to achieve better understanding of the transition to Internet-based high-performance computing and to develop solutions for some of the technical challenges of this transition. In particular, we are interested in creating long-term motivation for end users to provide their idle processor time to support computationally intensive tasks. We believe that a practical P2P architecture should provide useful service to both clients with high-performance computing needs and contributors of lower-end computing resources. To achieve this, we are designing dual -service architecture for P2P high-performance divide-and conquer computing; we are also experimenting with a prototype implementation. Our proposed architecture incorporates a master server, utilizes dual satellite servers, and operates on the Internet in a dynamically changing large configuration of lower-end nodes provided by volunteer contributors. A dual satellite server comprises a high-performance computing engine and a lower-end contributor service engine. The computing engine provides generic support for divide and conquer computations. The service engine is intended to provide free useful HTTP-based services to contributors of lower-end computing resources. Our proposed architecture is complementary to and accessible from computational grids, such as Globus, Legion, and Condor. Grids provide remote access to existing higher-end computing resources; in contrast, our goal is to utilize idle processor time of lower-end Internet nodes. Our project is focused on a generic divide and conquer paradigm and on mobile applications of this paradigm that can operate on a loose and ever changing pool of lower-end Internet nodes.

Follen, Gregory J.↗