Search NASA⌕ Search

SEARCH · Search NASA

Results for “programming models”

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 451 records · Page 25

Static Footprint Local Forces, Areas, and Aspect Ratios for Three Type 7 Aircraft Tires

The National Tire Modeling Program (NTMP) is a joint NASA/industry effort to improve the understanding of tire mechanics and develop accurate analytical design tools. This effort includes fundamental analytical and experimental research on the structural mechanics of tires. Footprint local forces, areas, and aspect ratios were measured. Local footprint forces in the vertical, lateral, and drag directions were measured with a special footprint force transducer. Measurements of the local forces in the footprint were obtained by positioning the transducer at specified locations within the footprint and externally loading the tires. Three tires were tested: (1) one representative of those used on the main landing gear of B-737 and DC-9 commercial transport airplanes, (2) a nose landing gear tire for the Space Shuttle Orbiter, and (3) a main landing gear tire for the Space Shuttle Orbiter. Data obtained for various inflation pressures and vertical loads are presented for two aircraft tires. The results are presented in graphical and tabulated forms.

Howell, William E.↗

Determination and impact of surface radiative processes for TOGA COARE

Experiments using atmospheric general circulation models have shown that the atmospheric circulation is very sensitive to small changes in sea surface temperature in the tropical western Pacific Ocean warm pool region. The mutual sensitivity of the ocean and the atmosphere in the warm pool region places stringent requirements on models of the coupled ocean atmosphere system. At present, the situation is such that diagnostic studies using available data sets have been unable to balance the surface energy budget in the warm pool region to better than 50 to 80 W/sq m. The Tropical Ocean Global Atmosphere (TOGA) Coupled Ocean Atmosphere Response Experiment (COARE) is an observation and modelling program that aims specifically at the elucidation of the physical process which determine the mean and transient state of the warm pool region and the manner in which the warm pool interacts with the global ocean and atmosphere. This project focuses on one very important aspect of the ocean atmosphere interface component of TOGA COARE, namely the temporal and spatial variability of surface radiative fluxes in the warm pool region.

Curry, Judith A.↗

Highly parallel sparse Cholesky factorization

Several fine grained parallel algorithms were developed and compared to compute the Cholesky factorization of a sparse matrix. The experimental implementations are on the Connection Machine, a distributed memory SIMD machine whose programming model conceptually supplies one processor per data element. In contrast to special purpose algorithms in which the matrix structure conforms to the connection structure of the machine, the focus is on matrices with arbitrary sparsity structure. The most promising algorithm is one whose inner loop performs several dense factorizations simultaneously on a 2-D grid of processors. Virtually any massively parallel dense factorization algorithm can be used as the key subroutine. The sparse code attains execution rates comparable to those of the dense subroutine. Although at present architectural limitations prevent the dense factorization from realizing its potential efficiency, it is concluded that a regular data parallel architecture can be used efficiently to solve arbitrarily structured sparse problems. A performance model is also presented and it is used to analyze the algorithms.

Gilbert, John R.↗

Tire/runway friction interface

An overview is given of NASA Langley's tire/runway pavement interface studies. The National Tire Modeling Program, evaluation of new tire and landing gear designs, tire wear and friction tests, and tire hydroplaning studies are examined. The Aircraft Landing Dynamics Facility is described along with some ground friction measuring vehicles. The major goals and scope of several joint FAA/NASA programs are identified together with current status and plans.

Yager, Thomas J.↗

Filtered Rayleigh scattering measurements in supersonic/hypersonic facilities

Preliminary measurements are presented of flow field properties in Mach 3 and Mach 5 flows using filtered Rayleigh scattering. Filter properties have been characterized by high resolution spectroscopy in order to optimize the selection of laser frequency and filter operating conditions, as well as for the development of an accurate filter modeling program. An optimized filter is used the background suppression feature of this technique to image the boundary layer structure in a Mach 3 high Reynolds number facility and the shock structure in a Mach 5 overexpanded jet. This had been achieved using a visible laser source. By frequency scanning the laser, time-averaged velocity measurements in the Mach 3 and Mach 5 flows are made. Data acquisition at 10 torr and below indicates that this approach can be extrapolated for use in hypersonic flow facilities and is applicable as an in-flight optical air data device for hypersonic vehicles.

Miles, Richard B.↗

Diffraction analysis and evaluation of several focus- and track-error detection schemes for magneto-optical disk systems

A commonly used tracking method on pre-grooved magneto-optical (MO) media is the push-pull technique, and the astigmatic method is a popular focus-error detection approach. These two methods are analyzed using DIFFRACT, a general-purpose scalar diffraction modeling program, to observe the effects on the error signals due to focusing lens misalignment, Seidel aberrations, and optical crosstalk (feedthrough) between the focusing and tracking servos. Using the results of the astigmatic/push-pull system as a basis for comparison, a novel focus/track-error detection technique that utilizes a ring toric lens is evaluated as well as the obscuration method (focus error detection only).

Bernacki, Bruce E.↗

A new era in magnetospheric research

Accounts are given of the development status and prospective efficacy of the Geoscience Environmental Data Display, the Space Environment Laboratory Data Acquisition and Display System, and the Geospace Environment Modeling program, which are all concerned with the 3D definition of the earth's magnetosphere. Attention is given to current and prospective improvements in the integration of all these data-gathering systems.

Akasofu, S.-I.↗

Parallel decomposition methods for the solution of electromagnetic scattering problems

This paper contains a overview of the methods used in decomposing solutions to scattering problems onto coarse-grained parallel processors. Initially, a short summary of relevant computer architecture is presented as background to the subsequent discussion. After the introduction of a programming model for problem decomposition, specific decompositions of finite difference time domain, finite element, and integral equation solutions to Maxwell's equations are presented. The paper concludes with an outline of possible software-assisted decomposition methods and a summary.

Cwik, Tom↗

Computing Incompressible Flows With Free Surfaces

RIPPLE computer program models transient, two-dimensional flows of incompressible fluids with surface tension on free surfaces of general shape. Surface tension modeled as volume force derived from continuum-surface-force model, giving RIPPLE both robustness and accuracy in modeling surface-tension effects at free surface. Also models wall adhesion effects. Written in FORTRAN 77.

Kothe, D.↗

Discrete sensitivity derivatives of the Navier-Stokes equations with a parallel Krylov solver

This paper solves an 'incremental' form of the sensitivity equations derived by differentiating the discretized thin-layer Navier Stokes equations with respect to certain design variables of interest. The equations are solved with a parallel, preconditioned Generalized Minimal RESidual (GMRES) solver on a distributed-memory architecture. The 'serial' sensitivity analysis code is parallelized by using the Single Program Multiple Data (SPMD) programming model, domain decomposition techniques, and message-passing tools. Sensitivity derivatives are computed for low and high Reynolds number flows over a NACA 1406 airfoil on a 32-processor Intel Hypercube, and found to be identical to those computed on a single-processor Cray Y-MP. It is estimated that the parallel sensitivity analysis code has to be run on 40-50 processors of the Intel Hypercube in order to match the single-processor processing time of a Cray Y-MP.

Ajmani, Kumud↗

Parallel grid generation algorithm for distributed memory computers

A parallel grid-generation algorithm and its implementation on the Intel iPSC/860 computer are described. The grid-generation scheme is based on an algebraic formulation of homotopic relations. Methods for utilizing the inherent parallelism of the grid-generation scheme are described, and implementation of multiple levELs of parallelism on multiple instruction multiple data machines are indicated. The algorithm is capable of providing near orthogonality and spacing control at solid boundaries while requiring minimal interprocessor communications. Results obtained on the Intel hypercube for a blended wing-body configuration are used to demonstrate the effectiveness of the algorithm. Fortran implementations bAsed on the native programming model of the iPSC/860 computer and the Express system of software tools are reported. Computational gains in execution time speed-up ratios are given.

Moitra, Stuti↗

A high-speed linear algebra library with automatic parallelism

Parallel or distributed processing is key to getting highest performance workstations. However, designing and implementing efficient parallel algorithms is difficult and error-prone. It is even more difficult to write code that is both portable to and efficient on many different computers. Finally, it is harder still to satisfy the above requirements and include the reliability and ease of use required of commercial software intended for use in a production environment. As a result, the application of parallel processing technology to commercial software has been extremely small even though there are numerous computationally demanding programs that would significantly benefit from application of parallel processing. This paper describes DSSLIB, which is a library of subroutines that perform many of the time-consuming computations in engineering and scientific software. DSSLIB combines the high efficiency and speed of parallel computation with a serial programming model that eliminates many undesirable side-effects of typical parallel code. The result is a simple way to incorporate the power of parallel processing into commercial software without compromising maintainability, reliability, or ease of use. This gives significant advantages over less powerful non-parallel entries in the market.

Boucher, Michael L.↗

Preconditioned implicit solvers for the Navier-Stokes equations on distributed-memory machines

The GMRES method is parallelized, and combined with local preconditioning to construct an implicit parallel solver to obtain steady-state solutions for the Navier-Stokes equations of fluid flow on distributed-memory machines. The new implicit parallel solver is designed to preserve the convergence rate of the equivalent 'serial' solver. A static domain-decomposition is used to partition the computational domain amongst the available processing nodes of the parallel machine. The SPMD (Single-Program Multiple-Data) programming model is combined with message-passing tools to develop the parallel code on a 32-node Intel Hypercube and a 512-node Intel Delta machine. The implicit parallel solver is validated for internal and external flow problems, and is found to compare identically with flow solutions obtained on a Cray Y-MP/8. A peak computational speed of 2300 MFlops/sec has been achieved on 512 nodes of the Intel Delta machine,k for a problem size of 1024 K equations (256 K grid points).

Ajmani, Kumud↗

Method for optimizing resource allocation in a government organization

The managers in Federal agencies are challenged to control the extensive activities in government and still provide high-quality products and services to the American taxpayers. Considering today's complex social and economic environment and the $3.8 billion daily cost of operating the Federal Government, it is evident that there is a need to develop decision-making tools for accurate resource allocation and total quality management. The goal of this thesis is to provide a methodical process that will aid managers in Federal Government to make budgetary decisions based on the cost of services, the agency's objectives, and the customers' perception of the agency's product. A general resource allocation procedure was developed in this study that can be applied to any government organization. A government organization, hereafter the 'organization,' is assumed to be a multidivision enterprise. This procedure was applied to a small organization for the proof of the concept. This organization is the Technical Services Directorate (TSD) at the NASA Lewis Research Center in Cleveland, Ohio. As part of the procedure, a nonlinear programming model was developed to account for the resources of the organization, the outputs produced by the organization, the decision-maker's views, and the customers' satisfaction with the organization. The information on the resources of the organization was acquired from current budget levels of the organization and the human resources assigned to the divisions. The outputs of the organization were defined and measured by identifying metrics that assess the outputs, the most challenging task in this study. The decision-maker's views are represented in the model as weights assigned to the various outputs and were quantified by using the analytic hierarchy process. The customer's opinions regarding the outputs of the organization were collected through questionnaires that were designed for each division individually. Following the philosophy of total quality management, information on customers' satisfaction is presented in the model as the quality of output. The model is a nonlinear one whose objective is to maximize customers' satisfaction such that the total cost of operation does not exceed the organization's budget. This model represents a structured approach or policy mechanism, at the agency level, to make capital investment decisions based on the priorities of the agency and the quality of outputs. This procedure applied to TSD resulted in a resources allocation scheme that was reasonable and acceptable to the decision-makers and, as expected, dependent on the assumptions and accuracy of the data used in the model.

Afarin, James↗

High Performance FORTRAN

High performance FORTRAN is a set of extensions for FORTRAN 90 designed to allow specification of data parallel algorithms. The programmer annotates the program with distribution directives to specify the desired layout of data. The underlying programming model provides a global name space and a single thread of control. Explicitly parallel constructs allow the expression of fairly controlled forms of parallelism in particular data parallelism. Thus the code is specified in a high level portable manner with no explicit tasking or communication statements. The goal is to allow architecture specific compilers to generate efficient code for a wide variety of architectures including SIMD, MIMD shared and distributed memory machines.

Mehrotra, Piyush↗

Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers

The PARADIGM compiler project provides an automated means to parallelize programs, written in a serial programming model, for efficient execution on distributed-memory multicomputers. .A previous implementation of the compiler based on the PTD representation allowed symbolic array sizes, affine loop bounds and array subscripts, and variable number of processors, provided that arrays were single or multi-dimensionally block distributed. The techniques presented here extend the compiler to also accept multidimensional cyclic and block-cyclic distributions within a uniform symbolic framework. These extensions demand more sophisticated symbolic manipulation capabilities. A novel aspect of our approach is to meet this demand by interfacing PARADIGM with a powerful off-the-shelf symbolic package, Mathematica. This paper describes some of the Mathematica routines that performs various transformations, shows how they are invoked and used by the compiler to overcome the new challenges, and presents experimental results for code involving cyclic and block-cyclic arrays as evidence of the feasibility of the approach.

Su, Ernesto↗

Automatic selection of dynamic data partitioning schemes for distributed memory multicomputers

For distributed memory multicomputers such as the Intel Paragon, the IBM SP-2, the NCUBE/2, and the Thinking Machines CM-5, the quality of the data partitioning for a given application is crucial to obtaining high performance. This task has traditionally been the user's responsibility, but in recent years much effort has been directed to automating the selection of data partitioning schemes. Several researchers have proposed systems that are able to produce data distributions that remain in effect for the entire execution of an application. For complex programs, however, such static data distributions may be insufficient to obtain acceptable performance. The selection of distributions that dynamically change over the course of a program's execution adds another dimension to the data partitioning problem. In this paper, we present a technique that can be used to automatically determine which partitionings are most beneficial over specific sections of a program while taking into account the added overhead of performing redistribution. This system is being built as part of the PARADIGM (PARAllelizing compiler for DIstributed memory General-purpose Multicomputers) project at the University of Illinois. The complete system will provide a fully automated means to parallelize programs written in a serial programming model obtaining high performance on a wide range of distributed-memory multicomputers.

Palermo, Daniel J.↗

Object-Oriented Implementation of the NAS Parallel Benchmarks using Charm++

This report describes experiences with implementing the NAS Computational Fluid Dynamics benchmarks using a parallel object-oriented language, Charm++. Our main objective in implementing the NAS CFD kernel benchmarks was to develop a code that could be used to easily experiment with different domain decomposition strategies and dynamic load balancing. We also wished to leverage the object-orientation provided by the Charm++ parallel object-oriented language, to develop reusable abstractions that would simplify the process of developing parallel applications. We first describe the Charm++ parallel programming model and the parallel object array abstraction, then go into detail about each of the Scalar Pentadiagonal (SP) and Lower/Upper Triangular (LU) benchmarks, along with performance results. Finally we conclude with an evaluation of the methodology used.

Krishnan, Sanjeev↗