Search NASA⌕ Search

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.

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

At least 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Energy considerations in computational aeroacoustics

A finite-volume multistage time-stepping Euler code is used to investigate the use of CFD algorithms for the direct calculation of acoustics. The 2D compressible inviscid flow about an accelerating or decelerating circular cylinder is used as a model problem. The time evolution of the energy transfer from the cylinder to the fluid, as the cylinder is moved from rest to some nonnegligible velocity, is clearly seen. By examining the temporal and spatial characteristics of the numerical solution, a distinction can be made between the propagating acoustic energy, the convecting energy associated with the entropy change in the fluid, and the energy contained in the local aerodynamic field. Systematic variation of the cylinder acceleration shows that the radiated acoustic energy depends strongly upon the rate of acceleration or deceleration. The computational grid has a large effect on the ratio of acoustic energy to nonphysical entropy associated energy, while the role of the explicit artificial viscosity seems to be of second order. The entropy term was nearly negligible in all cases the cylinder was started slowly.

Brentner, Kenneth S.↗
NASA NTRS1993

A parallel adaptive mesh refinement algorithm

Over recent years, Adaptive Mesh Refinement (AMR) algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block-structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developer's viewpoint, this class of scheme is quite involved; these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirk's AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm.

Quirk, James J.↗
NASA NTRS1994

The organic surface of 5145 Pholus: Constraints set by scattering theory

No known body in the Solar System has a spectrum redder than that of object 5145 Pholus. We use Hapke scattering theory and optical constants measured in this laboratory to examine the ability of mixtures of a number of organic solids and ices to reproduce the observed spectrum and phase variation. The primary materials considered are poly-HCN, kerogen, Murchison organic extract, Titan tholin, ice tholin, and water ice. In a computer grid search of over 10 million models, we find an intraparticle mixture of 15% Titan tholin, 10% poly-HCN, and 75% water ice with 10-micrometers particles to provide an excellent fit. Replacing water ice with ammonia ice improves the fits significantly while using a pure hydrocarbon tholin, Tholin alpha, instead of Titan tholin makes only modest improvements. All acceptable fits require Titan tholin or some comparable material to provide the steep slope in the visible, and poly-HCN or some comparable material to provide strong absorption in the near-infrared. A pure Titan tholin surface with 16-micrometers particles, as well as all acceptable Pholus models, fit the present spectrophotometric data for the transplutonian object 1992 QB(sub 1). The feasibility of gas-phase chemistry to generate material like Titan tholin on such small objects is examined. An irradiated transient atmosphere arising from sublimating ices may generate at most a few centimeters of tholin over the lifetime of the Solar System, but this is insignificant compared to the expected lag deposit of primordial contaminants left behind by the sublimating ice. Irradiation of subsurface N2/CH4 or NH3/CH4 ice by cosmic rays may generate approximately 20 cm of tholin in the upper 10 m of regolith in the same time scale but the identity of this tholin to its gas-phase equivalent has not been demonstrated.

Wilson, Peter D.↗
NASA NTRS1994

The delayed-detonation model of a type Ia supernovae. 1: The deflagration phase

The nature of the 'delayed detonation' mechanism of Khokhlov for the explosion of Type Ia supernovae is investigated by using two-dimensional numerical hydrodynamics simulations. A new algorithm is used to treat the deflagration front. Assuming that it propagates locally at the laminar flame speed, the deflagration is insufficient to unbind the star. Expansion shuts of the flame; much of this small production of iron group nuclei occurs at lower densities, which reduces the electron-capture problem. The burning front does become wrinkled, but the wavelength of the instability is much larger than the computational grid size and is resolved; this is consistent with previous analysis. Because the degenerate star has an adiabatic exponent only slightly above 4/3, the energy released by deflagration drives a pulsation of large amplitude. During the first expansion phase, adiabatic cooling shuts off the burning, and a Rayleigh-Taylor instability then gives mixing of high-entropy ashes with low-entropy fuel. During the first contraction phase, compressional heating reignites the material. This paper deals with the deflagration phase, from the onset of burning, through expansion and quenching of the flame, to the first contraction.

Arnett, David↗
NASA NTRS1995

Computing supernova collapse to neutron stars and black holes

We present a new numerical code for spherical hydrodynamics in general relativity. The code can handle gravitational collapse to a neutron star or to a black hole without the appearance of singularities. Moreover, the variables and equations in the code are very similar to those appearing in traditional Lagrangian supernova codes. Any such existing code can thus be easily adapted to treat collapse where the final fate is uncertain and may be either a neutron star or a black hole. The code is based on the formulation of Hernandez & Misner, in which retarded time is used as coordinate. This prevents the computational grid from penetrating inside any black hole that may form. We present the equations and a complete finite difference scheme for the adiabatic evolution of a fluid that obeys a gamma-law equation of state. We summarize the results of several testbed calculations performed to check our code. We also give the transformation of the analytic Oppenheimer-Snyder solution for homogeneous dust collapse to our coordinate system.

Baumgarte, Thomas W.↗
NASA NTRS1996

Load Balancing Unstructured Adaptive Grids for CFD Problems

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that balances the workload across all processors with a global view. After each parallel tetrahedral mesh adaption, the method first determines if the new mesh is sufficiently unbalanced to warrant a repartitioning. If so, the adapted mesh is repartitioned, with new partitions assigned to processors so that the redistribution cost is minimized. The new partitions are accepted only if the remapping cost is compensated by the improved load balance. Results indicate that this strategy is effective for large-scale scientific computations on distributed-memory multiprocessors.

Biswas, Rupak↗
NASA NTRS2001

A Framework for Control and Observation in Distributed Environments

As organizations begin to deploy large computational grids, it has become apparent that systems for observation and control of the resources, services, and applications that make up such grids are needed. Administrators must observe the operation of resources and services to ensure that they are operating correctly and they must control the resources and services to ensure that their operation meets the needs of users. Further, users need to observe the performance of their applications so that this performance can be improved and control how their applications execute in a dynamic grid environment. In this paper we describe our software framework for control and observation of resources, services, and applications that supports such uses and we provide examples of how our framework can be used.

Smith, Warren↗
NASA NTRS2001

An XML-Based Protocol for Distributed Event Services

A recent trend in distributed computing is the construction of high-performance distributed systems called computational grids. One difficulty we have encountered is that there is no standard format for the representation of performance information and no standard protocol for transmitting this information. This limits the types of performance analysis that can be undertaken in complex distributed systems. To address this problem, we present an XML-based protocol for transmitting performance events in distributed systems and evaluate the performance of this protocol.

Smith, Warren↗
NASA NTRS2001

Simple LDAP Schemas for Grid Monitoring

The purpose of this document is to provide an initial definition of the data we need in a directory service or database so that we can implement a performance monitoring testbed. To begin with, this document describes how to represent producers of events and event schemes. The representation of producers is simple and does not contain information such as who has access to the events and what protocols can be used to access the events. In the future, we will define how to describe consumers of events and add details to our representations. A popular choice for a directory service or database for grid computing is a distributed directory service that is accessed using the Lightweight Directory Access Protocol (LDAP). This document uses LDAP terminology, schemes, and formats to represent the directory service schemes.

Smith, Warren↗
NASA NTRS2001

An XML-Based Protocol for Distributed Event Services

This viewgraph presentation provides information on the application of an XML (extensible mark-up language)-based protocol to the developing field of distributed processing by way of a computational grid which resembles an electric power grid. XML tags would be used to transmit events between the participants of a transaction, namely, the consumer and the producer of the grid scheme.

Smith, Warren↗
NASA NTRS1998

Parallel Load Balancing for Adaptive Unstructured Meshes

Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. We describe a novel method to dynamically balance the processor workloads with a global view. Mesh question, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. A data redistribution model will also be presented that predicts the remapping cost. This model is required to determine whether the gain from a balanced workload distribution offsets the cost of data movement. Results presented will demonstrate that this is an effective dynamic load balancing strategy which remains viable on a large number of processors.

Biswas, Rupak↗
NASA NTRS2002

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

An all new, automated version of the PEGASUS software has been developed and tested. PEGASUS provides the hole-cutting and connectivity information between overlapping grids, and is used as the final part of the grid generation process for overset-grid computational fluid dynamics approaches. The new PEGASUS code (Version 5) has many new features: automated hole cutting; a projection scheme for fixing gaps in overset surfaces; more efficient interpolation search methods using an alternating digital tree; hole-size optimization based on adding additional layers of fringe points; and an automatic restart capability. The new code has also been parallelized using the Message Passing Interface standard. The parallelization performance provides efficient speed-up of the execution time by an order of magnitude, and up to a factor of 30 for very large problems. The results of three example cases are presented: a three-element high-lift airfoil, a generic business jet configuration, and a complete Boeing 777-200 aircraft in a high-lift landing configuration. Comparisons of the computed flow fields for the airfoil and 777 test cases between the old and new versions of the PEGASUS codes show excellent agreement with each other and with experimental results.

Suhs, Norman E.↗
NASA NTRS2002

Simulation of Etching in Chlorine Discharges Using an Integrated Feature Evolution-Plasma Model

To better utilize its vast collection of heterogeneous resources that are geographically distributed across the United States, NASA is constructing a computational grid called the Information Power Grid (IPG). This paper describes various tools and techniques that we are developing to measure and improve the performance of a broad class of NASA applications when run on the IPG. In particular, we are investigating the areas of grid benchmarking, grid monitoring, user-level application scheduling, and decentralized system-level scheduling.

Hwang, Helen H.↗
NASA NTRS2002

Discontinuous Galerkin Methods for Turbulence Simulation

A discontinuous Galerkin (DG) method is formulated, implemented, and tested for simulation of compressible turbulent flows. The method is applied to turbulent channel flow at low Reynolds number, where it is found to successfully predict low-order statistics with fewer degrees of freedom than traditional numerical methods. This reduction is achieved by utilizing local hp-refinement such that the computational grid is refined simultaneously in all three spatial coordinates with decreasing distance from the wall. Another advantage of DG is that Dirichlet boundary conditions can be enforced weakly through integrals of the numerical fluxes. Both for a model advection-diffusion problem and for turbulent channel flow, weak enforcement of wall boundaries is found to improve results at low resolution. Such weak boundary conditions may play a pivotal role in wall modeling for large-eddy simulation.

Collis, S. Scott↗
NASA NTRS2003

Arithmetic Data Cube as a Data Intensive Benchmark

Data movement across computational grids and across memory hierarchy of individual grid machines is known to be a limiting factor for application involving large data sets. In this paper we introduce the Data Cube Operator on an Arithmetic Data Set which we call Arithmetic Data Cube (ADC). We propose to use the ADC to benchmark grid capabilities to handle large distributed data sets. The ADC stresses all levels of grid memory by producing 2d views of an Arithmetic Data Set of d-tuples described by a small number of parameters. We control data intensity of the ADC by controlling the sizes of the views through choice of the tuple parameters.

Frumkin, Michael A.↗
NASA NTRS2003

Development Status of the Phantom Code for Turbomachinery

Contents include the following: Motivation. Code details. Test cases: aardvark (2D), phantom (3D). Algorithm basics. New feature I, II, and III. UTRC LSRR 1 - 1/2 stage turbine. Supersonic turbine. UTRC LSRR single-stage turbine. LOX elbow duct. Computational grid. High-pressure fuel pump inducer. Development plan. Summary. Appendix - Background.

Dorney, D. J.↗
NASA NTRS2003

Performance Trades Study for Robust Airfoil Shape Optimization

From time to time, existing aircraft need to be redesigned for new missions with modified operating conditions such as required lift or cruise speed. This research is motivated by the needs of conceptual and preliminary design teams for smooth airfoil shapes that are similar to the baseline design but have improved drag performance over a range of flight conditions. The proposed modified profile optimization method (MPOM) modifies a large number of design variables to search for nonintuitive performance improvements, while avoiding off-design performance degradation. Given a good initial design, the MPOM generates fairly smooth airfoils that are better than the baseline without making drastic shape changes. Moreover, the MPOM allows users to gain valuable information by exploring performance trades over various design conditions. Four simulation cases of airfoil optimization in transonic viscous ow are included to demonstrate the usefulness of the MPOM as a performance trades study tool. Simulation results are obtained by solving fully turbulent Navier-Stokes equations and the corresponding discrete adjoint equations using an unstructured grid computational fluid dynamics code FUN2D.

Li, Wu↗
NASA NTRS1999

Numerical Solution of Incompressible Navier-Stokes Equations Using a Fractional-Step Approach

A fractional step method for the solution of steady and unsteady incompressible Navier-Stokes equations is outlined. The method is based on a finite volume formulation and uses the pressure in the cell center and the mass fluxes across the faces of each cell as dependent variables. Implicit treatment of convective and viscous terms in the momentum equations enables the numerical stability restrictions to be relaxed. The linearization error in the implicit solution of momentum equations is reduced by using three subiterations in order to achieve second order temporal accuracy for time-accurate calculations. In spatial discretizations of the momentum equations, a high-order (3rd and 5th) flux-difference splitting for the convective terms and a second-order central difference for the viscous terms are used. The resulting algebraic equations are solved with a line-relaxation scheme which allows the use of large time step. A four color ZEBRA scheme is employed after the line-relaxation procedure in the solution of the Poisson equation for pressure. This procedure is applied to a Couette flow problem using a distorted computational grid to show that the method minimizes grid effects. Additional benchmark cases include the unsteady laminar flow over a circular cylinder for Reynolds Numbers of 200, and a 3-D, steady, turbulent wingtip vortex wake propagation study. The solution algorithm does a very good job in resolving the vortex core when 5th-order upwind differencing and a modified production term in the Baldwin-Barth one-equation turbulence model are used with adequate grid resolution.

Kiris, Cetin↗