SEARCH · Search NASA

Results for “CONCURRENT”

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 NTRS1978

Comparison of concurrent strain gage- and pressure transducer-measured flight loads on a lifting reentry vehicle and correlation with wind tunnel predictions

Concurrent strain gage and pressure transducer measured flight loads on a lifting reentry vehicle are compared and correlated with wind tunnel-predicted loads. Subsonic, transonic, and supersonic aerodynamic loads are presented for the left fin and control surfaces of the X-24B lifting reentry vehicle. Typical left fin pressure distributions are shown. The effects of variations in angle of attack, angle of sideslip, and Mach number on the left fin loads and rudder hinge moments are presented in coefficient form. Also presented are the effects of variations in angle of attack and Mach number on the upper flap, lower flap, and aileron hinge-moment coefficients. The effects of variations in lower flap hinge moments due to changes in lower flap deflection and Mach number are presented in terms of coefficient slopes.

Tang, M. H.↗

NASA NTRS1979

Concurrent error detecting codes for arithmetic processors

A method of concurrent error detection for arithmetic processors is described. Low-cost residue codes with check-length l and checkbase m = 2 to the l power - 1 are described for checking arithmetic operations of addition, subtraction, multiplication, division complement, shift, and rotate. Of the three number representations, the signed-magnitude representation is preferred for residue checking. Two methods of residue generation are described: the standard method of using modulo m adders and the method of using a self-testing residue tree. A simple single-bit parity-check code is described for checking the logical operations of XOR, OR, and AND, and also the arithmetic operations of complement, shift, and rotate. For checking complement, shift, and rotate, the single-bit parity-check code is simpler to implement than the residue codes.

Lim, R. S.↗

NASA NTRS1979

TEACH - A concurrent robot control language

This paper describes the TEACH robot control language and its supporting operating system. It addresses concurrency, device independence, and other issues related to manipulator control, task specification, and system operation.

Ruoff, C. F.↗

NASA NTRS1980

The visual accommodation response during concurrent mental activity

The direction and magnitude of the human visual accommodation response during concurrent mental activity are investigated. Subject focusing responses to targets at distances of 0.0 D, 3.0 D and an indeterminate distance were monitored by means of an optometer during the performance of a backwards counting task and a visual imagery task (thinking near and thinking far). In both experiments a shift in accommodation towards the visual far point is observed particularly for the near target, which increases with the duration of the task. The results can be interpreted in terms of both the capacity model of Kahneman (1973) and the autonomic arousal model of Hess and Polt (1964), and are not inconsistent with the possibility of an intermediate resting position.

Malmstrom, F. V.↗

NASA NTRS1981

Concurrent radio, infrared, optical and X-ray observations of the nucleus of the Seyfert galaxy NGC 4151

The nucleus of the Seyfert galaxy NGC 4151 was observed during May and June 1977 at X-ray energies from 20 to 200 keV using the high-energy X-ray spectrometer on OSO 8 at radio frequencies of 2695 and 8085. Data were also taken in the visual, and at infrared wavelengths of 1 to 2 microns, and from 2 to 6 keV using the OSO 8 proportional counter. Optical data showed variability by a factor of 2 within the observing period, which is comparable to the variability in the 2 to 6 keV X-ray flux. No variability, however, was measured at infrared or radio frequencies. The composite spectrum from radio to gamma-ray is plotted, and it is found that the optical and X-ray fluxes varied during the observing period, although it is not known if they varied concurrently.

Beall, J. H.↗

NASA NTRS1984

Application of concurrent processing to structural dynamic response computations

Described are the experiences gained from solving for the dynamic response of two simple structures on an experimental Multiple Instruction Multiple Data (MIMD) computer called the finite element machine. Introduced are MIMD computing concepts, describing how the concurrent algorithmic techniques implemented and giving results for the two example problems. The results show computational speedups of up to 7.83 using eight of the finite element machine processors and indicate that significant computational speedups are possible for large order structural computations.

Ransom, J.↗

NASA NTRS1985

Methods for design and evaluation of integrated hardware-software systems for concurrent computation

Research activities and publications are briefly summarized. The major tasks reviewed are: (1) VAX implementation of the PISCES parallel programming environment; (2) Apollo workstation network implementation of the PISCES environment; (3) FLEX implementation of the PISCES environment; (4) sparse matrix iterative solver in PSICES Fortran; (5) image processing application of PISCES; and (6) a formal model of concurrent computation being developed.

Pratt, T. W.↗

NASA NTRS1985

Characterization of concurrent processing

Computer architectures designed for concurrent processing are characterized by the number of processing elements, ensemble speed, random access memory, input/output routes, and modes of operation. The important attributes of processing tasks are then identified, and some processing stratagems are examined. It is shown that the greater the complexity of a given task, the wider the range of possible stratagems which can accomplish the task. For relatively simple tasks, the optimum stratagem can be found by analytical reasoning. For more complex tasks, however, optimum scheduling techniques may have to be employed for the assignment of segments of the task to the available processing elements.

Utku, S.↗

NASA NTRS1986

Viterbi algorithm on a hypercube: Concurrent formulation

The similarity between the Fast Fourier Transform and the Viterbi algorithm is exploited to develop a Concurrent Viterbi Algorithm suitable for a multiprocessor system interconnected as a hypercube. The proposed algorithm can efficiently decode large constraint length convolutional codes, using different degrees of parallelism, and is attractive for VLSI implementation.

Pllara, F.↗

NASA NTRS1985

Hesitations in continuous tracking induced by a concurrent discrete task

Subjects performed a continuous visually-guided pursuit tracking task with the right hand. From time to time (intervals averaging 30 sec) an auditory tone appeared signaling the subjects to perform a discrete response with the left hand. The presence of this tone was frequently associated with a hesitation in right-hand tracking which lasted 1/3 sec or longer. The rate of occurrence of these hesitations was about the same when the left-hand response involved a choice between competing responses as when the left hand responded in a predetermined direction. Hesitations occurred for three different mechanical tracking manipulanda using different controlling muscles, and appeared to be due to freezing rather than to relaxation of muscular action. The rate of occurrence of hesitations declined with practice, and this improvement in right-hand performance was accompanied by an improvement in performance of the concurrent left-hand response. The presence of hesitations, and their reduction with practice, can be interpreted within several viewpoints.

Klapp, S. T.↗

NASA NTRS1986

Multiple grid problems on concurrent-processing computers

Three computer codes were studied which make use of concurrent processing computer architectures in computational fluid dynamics (CFD). The three parallel codes were tested on a two processor multiple-instruction/multiple-data (MIMD) facility at NASA Ames Research Center, and are suggested for efficient parallel computations. The first code is a well-known program which makes use of the Beam and Warming, implicit, approximate factored algorithm. This study demonstrates the parallelism found in a well-known scheme and it achieved speedups exceeding 1.9 on the two processor MIMD test facility. The second code studied made use of an embedded grid scheme which is used to solve problems having complex geometries. The particular application for this study considered an airfoil/flap geometry in an incompressible flow. The scheme eliminates some of the inherent difficulties found in adapting approximate factorization techniques onto MIMD machines and allows the use of chaotic relaxation and asynchronous iteration techniques. The third code studied is an application of overset grids to a supersonic blunt body problem. The code addresses the difficulties encountered when using embedded grids on a compressible, and therefore nonlinear, problem. The complex numerical boundary system associated with overset grids is discussed and several boundary schemes are suggested. A boundary scheme based on the method of characteristics achieved the best results.

Eberhardt, D. S.↗

NASA NTRS1986

On the structure of parallelism in a highly concurrent PDE solver

A parallel multigrid algorithm for solving elliptic partial differential equations is developed and evaluated. A V-cycle multigrid method is altered to increase the degree of parallelism. A numerical analysis of the resulting concurrent-iteration multigrid algorithm is performed; its architectural implications are considered; highly parallel systems without shared memory are examined (including mesh-connected arrays, mesh-shuffle-connected systems, permutation networks, and direct VLSI embeddings); and the results of numerical experiments are presented in tables and graphs.

Gannon, D.↗

NASA NTRS1986

Numerical algorithms for finite element computations on concurrent processors

The work of several graduate students which relate to the NASA grant is briefly summarized. One student has worked on a detailed analysis of the so-called ijk forms of Gaussian elemination and Cholesky factorization on concurrent processors. Another student has worked on the vectorization of the incomplete Cholesky conjugate method on the CYBER 205. Two more students implemented various versions of Gaussian elimination and Cholesky factorization on the FLEX/32.

Ortega, J. M.↗

NASA NTRS1986

Concurrent Cholesky factorization of positive definite banded Hermitian matrices

First, the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then, two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression q = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost mu of interelement transmission relative to computation. It is shown that the efficiency factor e is inversely proportional to mu/s, and that e is almost independent of N when N is large and mu/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2 Ns.

Utku, S.↗

NASA NTRS1986

Petri net model for analysis of concurrently processed complex algorithms

This paper presents a Petri-net model suitable for analyzing the concurrent processing of computationally complex algorithms. The decomposed operations are to be processed in a multiple processor, data driven architecture. Of particular interest is the application of the model to both the description of the data/control flow of a particular algorithm, and to the general specification of the data driven architecture. A candidate architecture is also presented.

Stoughton, John W.↗

NASA NTRS1987

Hesitations in continuous tracking induced by a concurrent discrete task

Klapp, Stuart T.↗

NASA NTRS1987

Strategies for concurrent processing of complex algorithms in data driven architectures

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Stoughton, John W.↗

NASA NTRS1987

Methods for design and evaluation of integrated hardware/software systems for concurrent computation

Two testbed programming environments to support the evaluation of a large range of parallel architectures have been implemented under the program Parallel Implementation of Scientific Computing Environments (PISCES). The PISCES 1 environment was applied to two areas of aerospace interest: a sparse matrix iterative equation solver and a dynamic scene analysis system. Currently, the NICE/SPAR testbed system for structural analysis is being modified for parallel operation under PISCES 2; the PISCES 1 applications are also being adapted for PISCES 2. A new formal model of concurrent computation has been developed, based on the mathematical system known as H graph semantics together with a timed Petri net model of the parallel aspects of a system.

Pratt, Terrence W.↗