SEARCH · Search NASA

Results for “parallel computation”

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 757 records · Page 42

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Evaluation of the Intel iWarp parallel processor for space flight applications

The potential of a DARPA-sponsored advanced processor, the Intel iWarp, for use in future SSF Data Management Systems (DMS) upgrades is evaluated through integration into the Ames DMS testbed and applications testing. The iWarp is a distributed, parallel computing system well suited for high performance computing applications such as matrix operations and image processing. The system architecture is modular, supports systolic and message-based computation, and is capable of providing massive computational power in a low-cost, low-power package. As a consequence, the iWarp offers significant potential for advanced space-based computing. This research seeks to determine the iWarp's suitability as a processing device for space missions. In particular, the project focuses on evaluating the ease of integrating the iWarp into the SSF DMS baseline architecture and the iWarp's ability to support computationally stressing applications representative of SSF tasks.

Hine, Butler P., III↗

NASA NTRS1992

Enhancing images with Intensity-Dependent Spread functions

The theory of Intensity-Dependent Spread functions (IDS), a model of the human visual system proposed by Cornsweet (1985), is applied to image enhancement. An artificial image is examined which illustrates the characteristics of IDS processing and shows how the theoretical results translate into visual effects. Examples of realistic scenes that have been enhanced by IDS are presented. The system is shown to be particularly useful for bringing out detail in regions of low-contrast images. IDS can be readily implemented on a parallel computer.

Reese, Greg↗

NASA NTRS1993

Implementation of a mesh adaptive scheme based on an element-level error indicator

We investigate the formulation and application of element-level error indicators based on parametrized variational principles. The qualifier 'element-level' means that no information from adjacent elements is used for error estimation. This property is ideally suited to drive adaptive mesh refinement on parallel computers where access to neighboring elements resident on different processors may incur significant computational overhead. Furthermore, such indicators are not affected by physical jumps at junctures or interfaces. An element-level indicator has been derived from the higher-order element energy and applied to r and h mesh adaptation of meshes in plates and shell structures. We report on our initial experiments with a cylindrical shell that intersects with fist plates forming a simplified 'wing-body intersection' benchmark problem.

Keating, Scott↗

NASA NTRS1993

Conjugate gradient based projection - A new explicit methodology for frictional contact

With special attention towards the applicability to parallel computation or vectorization, a new and effective explicit approach for linear complementary formulations involving a conjugate gradient based projection methodology is proposed in this study for contact problems with Coulomb friction. The overall objectives are focussed towards providing an explicit methodology of computation for the complete contact problem with friction. In this regard, the primary idea for solving the linear complementary formulations stems from an established search direction which is projected to a feasible region determined by the non-negative constraint condition; this direction is then applied to the Fletcher-Reeves conjugate gradient method resulting in a powerful explicit methodology which possesses high accuracy, excellent convergence characteristics, fast computational speed and is relatively simple to implement for contact problems involving Coulomb friction.

Tamma, Kumar K.↗

NASA NTRS1993

The ParaScope parallel programming environment

The ParaScope parallel programming environment, developed to support scientific programming of shared-memory multiprocessors, includes a collection of tools that use global program analysis to help users develop and debug parallel programs. This paper focuses on ParaScope's compilation system, its parallel program editor, and its parallel debugging system. The compilation system extends the traditional single-procedure compiler by providing a mechanism for managing the compilation of complete programs. Thus, ParaScope can support both traditional single-procedure optimization and optimization across procedure boundaries. The ParaScope editor brings both compiler analysis and user expertise to bear on program parallelization. It assists the knowledgeable user by displaying and managing analysis and by providing a variety of interactive program transformations that are effective in exposing parallelism. The debugging system detects and reports timing-dependent errors, called data races, in execution of parallel programs. The system combines static analysis, program instrumentation, and run-time reporting to provide a mechanical system for isolating errors in parallel program executions. Finally, we describe a new project to extend ParaScope to support programming in FORTRAN D, a machine-independent parallel programming language intended for use with both distributed-memory and shared-memory parallel computers.

Cooper, Keith D.↗

NASA NTRS1993

A parallel implementation of a multisensor feature-based range-estimation method

There are many proposed vision based methods to perform obstacle detection and avoidance for autonomous or semi-autonomous vehicles. All methods, however, will require very high processing rates to achieve real time performance. A system capable of supporting autonomous helicopter navigation will need to extract obstacle information from imagery at rates varying from ten frames per second to thirty or more frames per second depending on the vehicle speed. Such a system will need to sustain billions of operations per second. To reach such high processing rates using current technology, a parallel implementation of the obstacle detection/ranging method is required. This paper describes an efficient and flexible parallel implementation of a multisensor feature-based range-estimation algorithm, targeted for helicopter flight, realized on both a distributed-memory and shared-memory parallel computer.

Suorsa, Raymond E.↗

NASA NTRS1993

Self-organization in neural networks - Applications in structural optimization

The present paper discusses the applicability of ART (Adaptive Resonance Theory) networks, and the Hopfield and Elastic networks, in problems of structural analysis and design. A characteristic of these network architectures is the ability to classify patterns presented as inputs into specific categories. The categories may themselves represent distinct procedural solution strategies. The paper shows how this property can be adapted in the structural analysis and design problem. A second application is the use of Hopfield and Elastic networks in optimization problems. Of particular interest are problems characterized by the presence of discrete and integer design variables. The parallel computing architecture that is typical of neural networks is shown to be effective in such problems. Results of preliminary implementations in structural design problems are also included in the paper.

Hajela, Prabhat↗

NASA NTRS1994

Graph-Based Dynamic Assignment Of Multiple Processors

Algorithm-to-architecture mapping model (ATAMM) is strategy minimizing time needed to periodically execute graphically described, data-driven application algorithm on multiple data processors. Implemented as operating system managing flow of data and dynamically assigns nodes of graph to processors. Predicts throughput versus number of processors available to execute given application algorithm. Includes rules ensuring application algorithm represented by graph executed periodically without deadlock and in shortest possible repetition time. ATAMM proves useful in maximizing effectiveness of parallel computing systems.

Hayes, Paul J.↗

NASA NTRS1994

Shared virtual memory and generalized speedup

Generalized speedup is defined as parallel speed over sequential speed. The generalized speedup and its relation with other existing performance metrics, such as traditional speedup, efficiency, scalability, etc., are carefully studied. In terms of the introduced asymptotic speed, it was shown that the difference between the generalized speedup and the traditional speedup lies in the definition of the efficiency of uniprocessor processing, which is a very important issue in shared virtual memory machines. A scientific application was implemented on a KSR-1 parallel computer. Experimental and theoretical results show that the generalized speedup is distinct from the traditional speedup and provides a more reasonable measurement. In the study of different speedups, various causes of superlinear speedup are also presented.

Sun, Xian-He↗

NASA NTRS1994

Stereo imaging based particle velocimeter

Three dimensional coordinates of an object are determined from it's two dimensional images for a class of points on the object. Two dimensional images are first filtered by a Laplacian of Gaussian (LOG) filter in order to detect a set of feature points on the object. The feature points on the left and the right images are then matched using a Hopfield type optimization network. The performance index of the Hopfield network contains both local and global properties of the images. Parallel computing in stereo matching can be achieved by the proposed methodology.

Batur, Celal↗

NASA NTRS1992

Unsteady flow past an airfoil pitched at constant rate

The unsteady flow past a NACA 0012 airfoil that is undertaking a constant-rate pitching up motion is investigated experimentally by the PIDV technique in a water towing tank. The Reynolds number is 5000, based upon the airfoil's chord and the free-stream velocity. The airfoil is pitching impulsively from 0 to 30 deg. with a dimensionless pitch rate alpha of 0.131. Instantaneous velocity and associated vorticity data have been acquired over the entire flow field. The primary vortex dominates the flow behavior after it separates from the leading edge of the airfoil. Complete stall emerges after this vortex detaches from the airfoil and triggers the shedding of a counter-rotating vortex near the trailing edge. A parallel computational study using the discrete vortex, random walk approximation has also been conducted. In general, the computational results agree very well with the experiment.

Lourenco, L.↗

NASA NTRS1994

A parallel strategy for implementing real-time expert systems using CLIPS

As evidenced by current literature, there appears to be a continued interest in the study of real-time expert systems. It is generally recognized that speed of execution is only one consideration when designing an effective real-time expert system. Some other features one must consider are the expert system's ability to perform temporal reasoning, handle interrupts, prioritize data, contend with data uncertainty, and perform context focusing as dictated by the incoming data to the expert system. This paper presents a strategy for implementing a real time expert system on the iPSC/860 hypercube parallel computer using CLIPS. The strategy takes into consideration not only the execution time of the software, but also those features which define a true real-time expert system. The methodology is then demonstrated using a practical implementation of an expert system which performs diagnostics on the Space Shuttle Main Engine (SSME). This particular implementation uses an eight node hypercube to process ten sensor measurements in order to simultaneously diagnose five different failure modes within the SSME. The main program is written in ANSI C and embeds CLIPS to better facilitate and debug the rule based expert system.

Ilyes, Laszlo A.↗

NASA NTRS1995

A perspective on unstructured grid flow solvers

This survey paper assesses the status of compressible Euler and Navier-Stokes solvers on unstructured grids. Different spatial and temporal discretization options for steady and unsteady flows are discussed. The integration of these components into an overall framework to solve practical problems is addressed. Issues such as grid adaptation, higher order methods, hybrid discretizations and parallel computing are briefly discussed. Finally, some outstanding issues and future research directions are presented.

Venkatakrishnan, V.↗

NASA NTRS1993

High performance compression of science data

In the future, NASA expects to gather over a tera-byte per day of data requiring space for levels of archival storage. Data compression will be a key component in systems that store this data (e.g., optical disk and tape) as well as in communications systems (both between space and Earth and between scientific locations on Earth). We propose to develop algorithms that can be a basis for software and hardware systems that compress a wide variety of scientific data with different criteria for fidelity/bandwidth tradeoffs. The algorithmic approaches we consider are specially targeted for parallel computation where data rates of over 1 billion bits per second are achievable with current technology.

Storer, James A.↗

NASA NTRS1992

A MIMD implementation of a parallel Euler solver for unstructured grids

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a MIMD (multiple instruction/multiple data stream) parallel computer. Three partitioning strategies for distributing the work load onto the processors are discussed. Issues pertaining to the communication costs are also addressed. We find that the spectral bisection strategy yields the best performance. The performance of this unstructured computation on the Intel iPSC/860 compares very favorably with that on a one-processor CRAY Y-MP/1 and an earlier implementation on the Connection Machine.

Venkatakrishnan, V.↗

NASA NTRS1995

Constraint-Based Scheduling System

Report describes continuing development of software for constraint-based scheduling system implemented eventually on massively parallel computer. Based on machine learning as means of improving scheduling. Designed to learn when to change search strategy by analyzing search progress and learning general conditions under which resource bottleneck occurs.

Zweben, Monte↗

NASA NTRS1995

CCD/CID Processors Would Offer Greater Precision

Charge-coupled-device/charge-injection-device (CCD/CID) data processors of proposed type offer advantages of massively parallel computational architecture and high computational speed typical of older CCD/CID data processors, but with increased precision. Useful in performing matrix vector multiplications in variety of applications, including solving partial differential equations, processing signal and image data, control computations, and neural-network simulations. Greater precision of proposed devices help to ensure accuracy in CCD/CID implementations of pseudospectral neural networks - particular class of artificial neural networks especially suited to solving nonlinear differential equations.

Barhen, Jacob↗

NASA NTRS1995

Efficient implementation of weighted ENO schemes

In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially non-oscillatory) finite difference schemes of Liu, Osher and Chan. It was shown by Liu et al. that WENO schemes constructed from the r-th order (in L1 norm) ENO schemes are (r+1)-th order accurate. We propose a new way of measuring the smoothness of a numerical solution, emulating the idea of minimizing the total variation of the approximation, which results in a 5-th order WENO scheme for the case r = 3, instead of the 4-th order with the original smoothness measurement by Liu et al. This 5-th order WENO scheme is as fast as the 4-th order WENO scheme of Liu et al., and both schemes are about twice as fast as the 4-th order ENO schemes on vector supercomputers and as fast on serial and parallel computers. For Euler systems of gas dynamics, we suggest computing the weights from pressure and entropy instead of the characteristic values to simplify the costly characteristic procedure. The resulting WENO schemes are about twice as fast as the WENO schemes using the characteristic decompositions to compute weights, and work well for problems which do not contain strong shocks or strong reflected waves. We also prove that, for conservation laws with smooth solutions, all WENO schemes are convergent. Many numerical tests, including the 1D steady state nozzle flow problem and 2D shock entropy wave interaction problem, are presented to demonstrate the remarkable capability of the WENO schemes, especially the WENO scheme using the new smoothness measurement, in resolving complicated shock and flow structures. We have also applied Yang's artificial compression method to the WENO schemes to sharpen contact discontinuities.

Jiang, Guang-Shan↗