Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel machines”

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 469 records · Page 26

Shared versus distributed memory multiprocessors

The question of whether multiprocessors should have shared or distributed memory has attracted a great deal of attention. Some researchers argue strongly for building distributed memory machines, while others argue just as strongly for programming shared memory multiprocessors. A great deal of research is underway on both types of parallel systems. Special emphasis is placed on systems with a very large number of processors for computation intensive tasks and considers research and implementation trends. It appears that the two types of systems will likely converge to a common form for large scale multiprocessors.

Jordan, Harry F.↗

Adaptive pattern recognition by mini-max neural networks as a part of an intelligent processor

In this decade and progressing into 21st Century, NASA will have missions including Space Station and the Earth related Planet Sciences. To support these missions, a high degree of sophistication in machine automation and an increasing amount of data processing throughput rate are necessary. Meeting these challenges requires intelligent machines, designed to support the necessary automations in a remote space and hazardous environment. There are two approaches to designing these intelligent machines. One of these is the knowledge-based expert system approach, namely AI. The other is a non-rule approach based on parallel and distributed computing for adaptive fault-tolerances, namely Neural or Natural Intelligence (NI). The union of AI and NI is the solution to the problem stated above. The NI segment of this unit extracts features automatically by applying Cauchy simulated annealing to a mini-max cost energy function. The feature discovered by NI can then be passed to the AI system for future processing, and vice versa. This passing increases reliability, for AI can follow the NI formulated algorithm exactly, and can provide the context knowledge base as the constraints of neurocomputing. The mini-max cost function that solves the unknown feature can furthermore give us a top-down architectural design of neural networks by means of Taylor series expansion of the cost function. A typical mini-max cost function consists of the sample variance of each class in the numerator, and separation of the center of each class in the denominator. Thus, when the total cost energy is minimized, the conflicting goals of intraclass clustering and interclass segregation are achieved simultaneously.

Szu, Harold H.↗

Two-dimensional high temperature strain measurement system

Two-dimensional optical strain measurements on high temperature test specimens are presented. This two-dimensional capability is implemented through a rotatable sensitive strain axis. Three components of surface strain can be measured automatically, from which the first and second principal strains are calculated. One- and two-dimensional strain measurements at temperatures beyond 750 C with a resolution of 15 microstrain are demonstrated. The system is based on a one-dimensional speckle shift technique. The speckle shift technique makes use of the linear relationship between surface strain and the differential shift of laser speckle patterns in the diffraction plane. Laser speckle is a phase effect that occurs when spatially coherent light interacts with an optically rough surface. Since speckle is generated by any diffusely reflecting surface, no specimen preparation is needed to obtain a good signal. Testing was done at room temperature on a flat specimen of Inconel 600 mounted in a fatigue testing machine. A load cell measured the stress on the specimen before and after acquiring the speckle data. Strain components were measured at 0 C (parallel to the load axis) and at plus or minus 45 C, and plots indicate the calculated values of the first and second principal strains. The measured values of Young's modulus and Poisson's ratio are in good agreement with handbook values. Good linearity of the principal strain moduli at high temperatures indicate precision and stability of the system. However, a systematic error in the high-temperature test setup introduced a scale factor in the slopes of the two-dimensional stress-strain curves. No high temperature effects, however, have been observed to degrade speckle correlation.

Lant, Christian T.↗

Three-Point Gear/Lead Screw Positioning

Triple-ganged-lead-screw positioning mechanism drives movable plate toward or away from fixed plate and keeps plates parallel to each other. Designed for use in tuning microwave resonant cavity. Other potential applications include adjustable bed plates and cantilever tail stocks in machine tools, adjustable platforms for optical equipment, and lifting platforms.

Calco, Frank S.↗

Performance Comparison of a Matrix Solver on a Heterogeneous Network Using Two Implementations of MPI: MPICH and LAM

Two of the current and most popular implementations of the Message-Passing Standard, Message Passing Interface (MPI), were contrasted: MPICH by Argonne National Laboratory, and LAM by the Ohio Supercomputer Center at Ohio State University. A parallel skyline matrix solver was adapted to be run in a heterogeneous environment using MPI. The Message-Passing Interface Forum was held in May 1994 which lead to a specification of library functions that implement the message-passing model of parallel communication. LAM, which creates it's own environment, is more robust in a highly heterogeneous network. MPICH uses the environment native to the machine architecture. While neither of these free-ware implementations provides the performance of native message-passing or vendor's implementations, MPICH begins to approach that performance on the SP-2. The machines used in this study were: IBM RS6000, 3 Sun4, SGI, and the IBM SP-2. Each machine is unique and a few machines required specific modifications during the installation. When installed correctly, both implementations worked well with only minor problems.

Phillips, Jennifer K.↗

Numerical Methodology for Coupled Time-Accurate Simulations of Primary and Secondary Flowpaths in Gas Turbines

Detailed information of the flow-fields in the secondary flowpaths and their interaction with the primary flows in gas turbine engines is necessary for successful designs with optimized secondary flow streams. Present work is focused on the development of a simulation methodology for coupled time-accurate solutions of the two flowpaths. The secondary flowstream is treated using SCISEAL, an unstructured adaptive Cartesian grid code developed for secondary flows and seals, while the mainpath flow is solved using TURBO, a density based code with capability of resolving rotor-stator interaction in multi-stage machines. An interface is being tested that links the two codes at the rim seal to allow data exchange between the two codes for parallel, coupled execution. A description of the coupling methodology and the current status of the interface development is presented. Representative steady-state solutions of the secondary flow in the UTRC HP Rig disc cavity are also presented.

Przekwas, A. J.↗

Thermal Pyrolytic Graphite Enhanced Components

A thermally conductive composite material, a thermal transfer device made of the material, and a method for making the material are disclosed. Apertures or depressions are formed in aluminum or aluminum alloy. Plugs are formed of thermal pyrolytic graphite. An amount of silicon sufficient for liquid interface diffusion bonding is applied, for example by vapor deposition or use of aluminum silicon alloy foil. The plugs are inserted in the apertures or depressions. Bonding energy is applied, for example by applying pressure and heat using a hot isostatic press. The thermal pyrolytic graphite, aluminum or aluminum alloy and silicon form a eutectic alloy. As a result, the plugs are bonded into the apertures or depressions. The composite material can be machined to produce finished devices such as the thermal transfer device. Thermally conductive planes of the thermal pyrolytic graphite plugs may be aligned in parallel to present a thermal conduction path.

Hardesty, Robert E.↗

Optoelectronic analogs of self-programming neural nets - Architecture and methodologies for implementing fast stochastic learning by simulated annealing

Self-organization and learning is a distinctive feature of neural nets and processors that sets them apart from conventional approaches to signal processing. It leads to self-programmability which alleviates the problem of programming complexity in artificial neural nets. In this paper architectures for partitioning an optoelectronic analog of a neural net into distinct layers with prescribed interconnectivity pattern to enable stochastic learning by simulated annealing in the context of a Boltzmann machine are presented. Stochastic learning is of interest because of its relevance to the role of noise in biological neural nets. Practical considerations and methodologies for appreciably accelerating stochastic learning in such a multilayered net are described. These include the use of parallel optical computing of the global energy of the net, the use of fast nonvolatile programmable spatial light modulators to realize fast plasticity, optical generation of random number arrays, and an adaptive noisy thresholding scheme that also makes stochastic learning more biologically plausible. The findings reported predict optoelectronic chips that can be used in the realization of optical learning machines.

Farhat, Nabil H.↗

Near-Net-Shape Processing of Sintered Fibrous Ceramics Achieved

A variety of sintered fibrous ceramic (SFC) materials have been developed over the last 50 years as thermal barrier materials for reentry applications. SFC materials typically exhibit very low thermal conductivities combined with low densities and good thermal stability up to 2500 F. These materials have flown successfully on the space shuttle orbiters since the 1960's. More recently, the McDonnell Douglas Corporation successfully used SFC tiles as a heat shield on the underside of its DC X test vehicle. For both of these applications, tiles are machined from blocks of a specific type of SFC called an alumina-enhanced thermal barrier (AETB). The sizes of these blocks have been limited by the manufacturing process. In addition, as much as 80 to 90 percent of the material can be lost during the machining of tiles with significant amounts of curvature. To address these problems, the NASA Glenn Research Center at Lewis Field entered a cooperative contract with the Boeing Company to develop a vacuum-assisted forming process that can produce large (approximately 4 square feet), severely contoured panels of AETB while saving costs in comparison to the conventional cast-and-machine billet process. For shuttle use, AETB is slurry cast, drained, and fired to form square billets conforming to the shape of the filtration box. The billets are then cut into tiles of the appropriate size for thermally protecting the space shuttle. Processing techniques have limited the maximum size of AETB billets to 21.5 square inches by 6.5-in. thick, but the space shuttles use discrete heat shield tiles no more than 8 to 12 square inches. However, in other applications, large, complex shapes are needed, and the tiling approach is undesirable. For such applications, vacuum-assisted forming can produce large parts with complex shapes while reducing machining waste and eliminating cemented joints between bonded billets. Because it allows contoured shapes to be formed, material utilization is inherently high. Initial estimates show that the amount of material lost during machining can be reduced by 50 percent or more. In addition, a fiber alignment favorable for minimum heat transfer is maintained for all panel shapes since the fibers are aligned parallel to the contoured surface of the forming tool or mold. The vacuum-assisted forming process can complete the entire forming operation in a matter of minutes and can produce multiple parts whose size is limited only by the size of the forming tool. To date, panels as large as 2 square feet have been demonstrated The vacuum-assisted forming process starts with the fabrication of a permeable forming tool, or mold, with the proper part contour. This reusable tool is mounted over an internal rib support structure, as depicted in the diagram, such that a vacuum can be pulled on the bottom portion of the tool. AETB slurry is then poured over and around the tool, liquid is drawn from the slurry, and the part forms over the tool surface. The part is then dried, fired, and finished machined. Future plans include an evaluation of the need for additional coatings and surface-toughness treatments to extend the durability and performance of this material.

Angel, Paul W.↗

Particle simulation on heterogeneous distributed supercomputers

We describe the implementation and performance of a three dimensional particle simulation distributed between a Thinking Machines CM-2 and a Cray Y-MP. These are connected by a combination of two high-speed networks: a high-performance parallel interface (HIPPI) and an optical network (UltraNet). This is the first application to use this configuration at NASA Ames Research Center. We describe our experience implementing and using the application and report the results of several timing measurements. We show that the distribution of applications across disparate supercomputing platforms is feasible and has reasonable performance. In addition, several practical aspects of the computing environment are discussed.

Becker, Jeffrey C.↗

Parallel performance investigations of an unstructured mesh Navier-Stokes solver

A Reynolds-averaged Navier-Stokes solver based on unstructured mesh techniques for analysis of high-lift configurations is described. The method makes use of an agglomeration multigrid solver for convergence acceleration. Implicit line-smoothing is employed to relieve the stiffness associated with highly stretched meshes. A GMRES technique is also implemented to speed convergence at the expense of additional memory usage. The solver is cache efficient and fully vectorizable, and is parallelized using a two-level hybrid MPI-OpenMP implementation suitable for shared and/or distributed memory architectures, as well as clusters of shared memory machines. Convergence and scalability results are illustrated for various high-lift cases.

Mavriplis, Dimitri J.↗

Aerodynamic Shape Optimization Using A Combined Distributed/Shared Memory Paradigm

Current parallel computational approaches involve distributed and shared memory paradigms. In the distributed memory paradigm, each processor has its own independent memory. Message passing typically uses a function library such as MPI or PVM. In the shared memory paradigm, such as that used on the SGI Origin 2000 machine, compiler directives are used to instruct the compiler to schedule multiple threads to perform calculations. In this paradigm, it must be assured that processors (threads) do not simultaneously access regions of memory in such away that errors would occur. This paper utilizes the latest version of the SGI MPI function library to combine the two parallelization paradigms to perform aerodynamic shape optimization of a generic wing/body.

Cheung, Samson↗

Implementation of an ADI method on parallel computers

The implementation of an ADI method for solving the diffusion equation on three parallel/vector computers is discussed. The computers were chosen so as to encompass a variety of architectures. They are: the MPP, an SIMD machine with 16K bit serial processors; FLEX/32, an MIMD machine with 20 processors; and CRAY/2, an MIMD machine with four vector processors. The Gaussian elimination algorithm is used to solve a set of tridiagonal systems on the FLEX/32 and CRAY/2 while the cyclic elimination algorithm is used to solve these systems on the MPP. The implementation of the method is discussed in relation to these architectures and measures of the performance on each machine are given. Simple performance models are used to describe the performance. These models highlight the bottlenecks and limiting factors for this algorithm on these architectures. Finally, conclusions are presented.

Fatoohi, Raad A.↗

Pattern recognition and control in manipulation

A new approach to the use of sensors in manipulator or robot control is discussed. The concept addresses the problem of contact or near-contact type of recognition of three-dimensional forms of objects by proprioceptive and/or exteroceptive sensors integrated with the terminal device. This recognition of object shapes both enhances and simplifies the automation of object handling. Several examples have been worked out for the 'Belgrade hand' and for a parallel jaw terminal device, both equipped with proprioceptive (position) and exteroceptive (proximity) sensors. The control applications are discussed in the framework of a multilevel man-machine system control. The control applications create interesting new issues which, in turn, invite novel theoretical considerations. An important issue is the problem of stability in control when the control is referenced to patterns.

Bejczy, A. K.↗

Inventory estimation on the massively parallel processor

This paper describes algorithms for efficiently computing inventory estimates from satellite based images. The algorithms incorporate a one dimensional feature extraction which optimizes the pairwise sum of Fisher distances. Biases are eliminated with a premultiplication by the inverse of the analytically derived error matrix. The technique is demonstrated with a numerical example using statistics obtained from an actual Landsat scene. Attention was given to implementation of the Massively Parallel processor (MPP). A timing analysis demonstrates that the inventory estimation can be performed an order of magnitude faster on the MPP than on a conventional serial machine.

Argentiero, P. D.↗

Concurrent processing in nonlinear structural stability

A concurrent processing algorithm is developed for materially nonlinear stability analysis of imperfect columns with biaxial partial rotational end restraints. The algorithm for solving the governing nonlinear ordinary differential equations is implemented on a multiprocessor computer called the 'Finite Element Machine', developed at the NASA Langley Research Center. Numerical results are obtained on up to nine concurrent processors. A substantial computational gain is achieved in using the parallel processing approach.

Darbhamulla, S. P.↗

Highly parallel computation

Highly parallel computing architectures are the only means to achieve the computation rates demanded by advanced scientific problems. A decade of research has demonstrated the feasibility of such machines and current research focuses on which architectures designated as multiple instruction multiple datastream (MIMD) and single instruction multiple datastream (SIMD) have produced the best results to date; neither shows a decisive advantage for most near-homogeneous scientific problems. For scientific problems with many dissimilar parts, more speculative architectures such as neural networks or data flow may be needed.

Denning, Peter J.↗

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗