SEARCH · Engineering Papers

Results for “concurrent 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 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1985

Feasibility study for convertible engine torque converter

The feasibility study has shown that a dump/fill type torque converter has excellent potential for the convertible fan/shaft engine. The torque converter space requirement permits internal housing within the normal flow path of a turbofan engine at acceptable engine weight. The unit permits operating the engine in the turboshaft mode by decoupling the fan. To convert to turbofan mode, the torque converter overdrive capability bring the fan speed up to the power turbine speed to permit engagement of a mechanical lockup device when the shaft speed are synchronized. The conversion to turbofan mode can be made without drop of power turbine speed in less than 10 sec. Total thrust delivered to the aircraft by the proprotor, fan, and engine during tansient can be controlled to prevent loss of air speed or altitude. Heat rejection to the oil is low, and additional oil cooling capacity is not required. The turbofan engine aerodynamic design is basically uncompromised by convertibility and allows proper fan design for quiet and efficient cruise operation. Although the results of the feasibility study are exceedingly encouraging, it must be noted that they are based on extrapolation of limited existing data on torque converters. A component test program with three trial torque converter designs and concurrent computer modeling for fluid flow, stress, and dynamics, updated with test results from each unit, is recommended.

Source record↗

NASA NTRS1987

Comparing barrier algorithms

A barrier is a method for synchronizing a large number of concurrent computer processes. After considering some basic synchronization mechanisms, a collection of barrier algorithms with either linear or logarithmic depth are presented. A graphical model is described that profiles the execution of the barriers and other parallel programming constructs. This model shows how the interaction between the barrier algorithms and the work that they synchronize can impact their performance. One result is that logarithmic tree structured barriers show good performance when synchronizing fixed length work, while linear self-scheduled barriers show better performance when synchronizing fixed length work with an imbedded critical section. The linear barriers are better able to exploit the process skew associated with critical sections. Timing experiments, performed on an eighteen processor Flex/32 shared memory multiprocessor, that support these conclusions are detailed.

Arenstorf, Norbert S.↗

NASA NTRS1990

Concurrent Image Processing Executive (CIPE). Volume 1: Design overview

The design and implementation of a Concurrent Image Processing Executive (CIPE), which is intended to become the support system software for a prototype high performance science analysis workstation are described. The target machine for this software is a JPL/Caltech Mark 3fp Hypercube hosted by either a MASSCOMP 5600 or a Sun-3, Sun-4 workstation; however, the design will accommodate other concurrent machines of similar architecture, i.e., local memory, multiple-instruction-multiple-data (MIMD) machines. The CIPE system provides both a multimode user interface and an applications programmer interface, and has been designed around four loosely coupled modules: user interface, host-resident executive, hypercube-resident executive, and application functions. The loose coupling between modules allows modification of a particular module without significantly affecting the other modules in the system. In order to enhance hypercube memory utilization and to allow expansion of image processing capabilities, a specialized program management method, incremental loading, was devised. To minimize data transfer between host and hypercube, a data management method which distributes, redistributes, and tracks data set information was implemented. The data management also allows data sharing among application programs. The CIPE software architecture provides a flexible environment for scientific analysis of complex remote sensing image data, such as planetary data and imaging spectrometry, utilizing state-of-the-art concurrent computation capabilities.

Lee, Meemong↗

NASA NTRS1989

Proceedings of the NASA Conference on Space Telerobotics, volume 2

These proceedings contain papers presented at the NASA Conference on Space Telerobotics held in Pasadena, January 31 to February 2, 1989. The theme of the Conference was man-machine collaboration in space. The Conference provided a forum for researchers and engineers to exchange ideas on the research and development required for application of telerobotics technology to the space systems planned for the 1990s and beyond. The Conference: (1) provided a view of current NASA telerobotic research and development; (2) stimulated technical exchange on man-machine systems, manipulator control, machine sensing, machine intelligence, concurrent computation, and system architectures; and (3) identified important unsolved problems of current interest which can be dealt with by future research.

Rodriguez, Guillermo↗

NASA NTRS1989

Proceedings of the NASA Conference on Space Telerobotics, volume 3

The theme of the Conference was man-machine collaboration in space. The Conference provided a forum for researchers and engineers to exchange ideas on the research and development required for application of telerobotics technology to the space systems planned for the 1990s and beyond. The Conference: (1) provided a view of current NASA telerobotic research and development; (2) stimulated technical exchange on man-machine systems, manipulator control, machine sensing, machine intelligence, concurrent computation, and system architectures; and (3) identified important unsolved problems of current interest which can be dealt with by future research.

Rodriguez, Guillermo↗

NASA NTRS1989

Comparing barrier algorithms

Arenstorf, Norbert S.↗

NASA NTRS1989

Efficiency of group implicit concurrent algorithms for transient finite element analysis

The performance of group implicit algorithms is assessed on actual concurrent computers. It is shown that, as the number of subdomains is increased, performance enhancements are derived from two sources: the increased parallelism in the computations; and a reduction in equation solving effort. Moreover, these two performance enhancements are synergistic, in the sense that the corresponding speed-ups are multiplied, rather than merely added. Simulations on a 32-node hypercube are presented for which the interprocessor communications efficiencies obtained are consistently in excess of 90 percent.

Ortiz, M.↗

NASA NTRS1991

Numerical studies of electron dynamics in oblique quasi-perpendicular collisionless shock waves

Linear and nonlinear electron damping of the whistler precursor wave train to low Mach number quasi-perpendicular oblique shocks is studied using a one-dimensional electromagnetic plasma simulation code with particle electrons and ions. In some parameter regimes, electrons are observed to trap along the magnetic field lines in the potential of the whistler precursor wave train. This trapping can lead to significant electron heating in front of the shock for low beta(e). Use of a 64-processor hypercube concurrent computer has enabled long runs using realistic mass ratios in the full particle in-cell code and thus simulate shock parameter regimes and phenomena not previously studied numerically.

Liewer, P. C.↗

NASA NTRS2005

Task Description Language

Task Description Language (TDL) is an extension of the C++ programming language that enables programmers to quickly and easily write complex, concurrent computer programs for controlling real-time autonomous systems, including robots and spacecraft. TDL is based on earlier work (circa 1984 through 1989) on the Task Control Architecture (TCA). TDL provides syntactic support for hierarchical task-level control functions, including task decomposition, synchronization, execution monitoring, and exception handling. A Java-language-based compiler transforms TDL programs into pure C++ code that includes calls to a platform-independent task-control-management (TCM) library. TDL has been used to control and coordinate multiple heterogeneous robots in projects sponsored by NASA and the Defense Advanced Research Projects Agency (DARPA). It has also been used in Brazil to control an autonomous airship and in Canada to control a robotic manipulator.

Simmons, Reid↗

NASA NTRSDate not supplied

Instabilities in the Wake of Roughness on a Flat Plate in a Quiet Supersonic Tunnel

Roughness-induced transition is an unavoidable reality in practical high-speed vehicles. Typical prediction of transition due to roughness include algebraic correlations and, more recently, semi-empirical methods. In the NASA Langley Research Center Supersonic Low Disturbance Tunnel, a Mach 3.5 quiet tunnel, several transition experiments have been performed in the past decade to better understand the mechanisms by which small roughness causes transition in a supersonic boundary layer. The study started first with isolated roughness elements of different planforms and shapes and progressed to increasingly more complicated geometries before arriving at a pseudorandom roughness, defined by an analytic function. Concurrent computational efforts progressed with these studies as well, starting with the use of linear stability theory and progressing to the use of harmonic linearized Navier-Stokes to predict the growth of boundary layer stabilities.

Amanda Chou↗

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

Report on the feasibility of hypercube concurrent processing systems in computational fluid dynamics

The feasibility of using hypercube-connected concurrent processor systems for problems in computational fluid dynamics is studied. Both explicit and implicit numerical methods are considered and several alternative implementations of these methods are evaluated on concurrent processor systems. A Lax-Wendroff explicit method was designed and implemented for the Navier-Stokes equations. The code runs on the Intel iPSC concurrent processor system. Tests of this code show that it is reasonably efficient. The Beam and Warming implicit factored method was designed and implemented for Berger's equation. Preliminary tests show that the efficiency of code is poor.

Bruno, J.↗

NASA NTRS1985

Reliability models for dataflow computer systems

The demands for concurrent operation within a computer system and the representation of parallelism in programming languages have yielded a new form of program representation known as data flow (DENN 74, DENN 75, TREL 82a). A new model based on data flow principles for parallel computations and parallel computer systems is presented. Necessary conditions for liveness and deadlock freeness in data flow graphs are derived. The data flow graph is used as a model to represent asynchronous concurrent computer architectures including data flow computers.

Kavi, K. M.↗

NASA NTRS1989

Explicit modeling and computational load distribution for concurrent processing simulation of the space station

Two important aspects of concurrent processing under development at TRW are discussed. These are: (1) the derivation of explicit mathematical models of multibody dynamic systems, and (2) a balanced computational load distribution (BCLD) among loosely coupled computational units (processors) of a concurrent processing system. The developed methodologies are demonstrated by way of an application to the Phase 1 of the Space Station - a task being performed by TRW under NASA/JSC contract NAS9-17778. The mathematical model of the Space Station consists of three interconnected flexible bodies capable of undergoing large, rigid-body motion with respect to each other. Body 1 is the main central body and contains the pressurized modules inboard of the two Alpha gimbals. Bodies 2 and 3 are the starboard and port bodies connected to Body 1 at the Alpha gimbals and include all components on the transverse booms outboard of the Alpha gimbals (including the solar arrays). The control systems in the model maintain Body 1 in a prescribed 3-axis attitude control mode, while producing large-angle rotations of the flexible solar arrays to position them normal to the sun-line.

Gluck, R.↗

NASA NTRS1992

Distributed Visualization for Computational Fluid Dynamics

Distributed concurrent visualization and computation in computational fluid dynamics (CFD) is not a new concept. Specialized applications such as Realtime Interactive Particle-tracer (RIP) and vendor specific tools like Distributed Graphics Language (DGL) have been in use for some time. This paper describes a current project underway at NASA Lewis Research Center to provide the CFD researcher with an easy method for incorporating distributed processing concepts into program development. Details on the FORTRAN capable interface to a set of network and visualization functions are presented along with some results from initial CFD case studies that employ these techniques.

Don J Sosoka↗

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 NTRS1990

A tool for modeling concurrent real-time computation

Real-time computation is a significant area of research in general, and in AI in particular. The complexity of practical real-time problems demands use of knowledge-based problem solving techniques while satisfying real-time performance constraints. Since the demands of a complex real-time problem cannot be predicted (owing to the dynamic nature of the environment) powerful dynamic resource control techniques are needed to monitor and control the performance. A real-time computation model for a real-time tool, an implementation of the QP-Net simulator on a Symbolics machine, and an implementation on a Butterfly multiprocessor machine are briefly described.

Sharma, D. D.↗

NASA NTRS1987

Performance prediction of concurrent systems

Concurrent systems are computers that use multiple processors to solve a single problem. A means to predict the application performance on these systems is a useful tool in many areas of concurrent system research. A computationally efficient and accurate method to predict performance for a class of parallel computations on concurrent systems is described. A parallel computation is modeled as a task system with precedence relationships expressed as a series parallel directed acyclic graph. Resources in concurrent systems are modeled as service centers in queueing network models. Using these two models as inputs, the method outputs predictions of both the time to complete the computation and the concurrent system utilization. The algorithm used is based on the approximate Mean Value Analysis in queueing network modeling with extensions to model concurrency in the computation. The new algorithm was validated against both detailed simulation and actual execution on a commercial multiprocessor.

Mak, Victor W. K.↗