Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel application”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS1999

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAPT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAPT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗
NASA NTRS2000

Automatic Data Distribution for CFD Applications on Structured Grids

Data distribution is an important step in implementation of any parallel algorithm. The data distribution determines data traffic, utilization of the interconnection network and affects the overall code efficiency. In recent years a number data distribution methods have been developed and used in real programs for improving data traffic. We use some of the methods for translating data dependence and affinity relations into data distribution directives. We describe an automatic data alignment and placement tool (ADAFT) which implements these methods and show it results for some CFD codes (NPB and ARC3D). Algorithms for program analysis and derivation of data distribution implemented in ADAFT are efficient three pass algorithms. Most algorithms have linear complexity with the exception of some graph algorithms having complexity O(n(sup 4)) in the worst case.

Frumkin, Michael↗
NASA NTRS1992

Automatic data partitioning on distributed memory multicomputers

Distributed-memory parallel computers are increasingly being used to provide high levels of performance for scientific applications. Unfortunately, such machines are not very easy to program. A number of research efforts seek to alleviate this problem by developing compilers that take over the task of generating communication. The communication overheads and the extent of parallelism exploited in the resulting target program are determined largely by the manner in which data is partitioned across different processors of the machine. Most of the compilers provide no assistance to the programmer in the crucial task of determining a good data partitioning scheme. A novel approach is presented, the constraints-based approach, to the problem of automatic data partitioning for numeric programs. In this approach, the compiler identifies some desirable requirements on the distribution of various arrays being referenced in each statement, based on performance considerations. These desirable requirements are referred to as constraints. For each constraint, the compiler determines a quality measure that captures its importance with respect to the performance of the program. The quality measure is obtained through static performance estimation, without actually generating the target data-parallel program with explicit communication. Each data distribution decision is taken by combining all the relevant constraints. The compiler attempts to resolve any conflicts between constraints such that the overall execution time of the parallel program is minimized. This approach has been implemented as part of a compiler called Paradigm, that accepts Fortran 77 programs, and specifies the partitioning scheme to be used for each array in the program. We have obtained results on some programs taken from the Linpack and Eispack libraries, and the Perfect Benchmarks. These results are quite promising, and demonstrate the feasibility of automatic data partitioning for a significant class of scientific application programs with regular computations.

Gupta, Manish↗
NASA NTRS1987

EOS: A project to investigate the design and construction of real-time distributed Embedded Operating Systems

Project EOS is studying the problems of building adaptable real-time embedded operating systems for the scientific missions of NASA. Choices (A Class Hierarchical Open Interface for Custom Embedded Systems) is an operating system designed and built by Project EOS to address the following specific issues: the software architecture for adaptable embedded parallel operating systems, the achievement of high-performance and real-time operation, the simplification of interprocess communications, the isolation of operating system mechanisms from one another, and the separation of mechanisms from policy decisions. Choices is written in C++ and runs on a ten processor Encore Multimax. The system is intended for use in constructing specialized computer applications and research on advanced operating system features including fault tolerance and parallelism.

Campbell, R. H.↗
NASA NTRS1968

Penetration of electrons and associated bremsstrahlung through aluminum targets

This paper contains a brief description of Monte Carlo programs designed to calculate the transport of fast electrons and associated bremsstrahlung through extended media. Two applications are discussed: (1) transmission of electrons through plane-parallel targets, and (2) emergence of secondary bremsstrahlung from such targets. It is shown that the predicted results are in reasonably good agreement with recent experiments for electron beams with energies up to 8 MeV incident normally on aluminum targets. Extensive new calculated data for transmission and thick-target bremsstrahlung production are presented for aluminum targets exposed to an isotropic electron flux.

M. J. Berger↗
NASA NTRS1971

On the strength of notched composites

Failure analysis of notched unidirectional composites under tensile load parallel to fiber, considering Griffith-Irwin-Orowan fracture theory applicability

Zweben, C.↗
NASA NTRS1974

Feasibility of using multiplexed SLAR imagery for water resources management and mapping vegetation communities

A two-wavelength (X band and L band) multiplexed synthetic aperture side-looking airborne radar (SLAR), providing parallel- and cross-polarized images, has been tested for application in mapping vegetation and water resources. Indications of the relative heights, densities, surface roughness and other parameters provided by the multiplexed radar imagery can be used to differentiate and map various types of vegetation. The multiplexed SLAR is superior to thermal IR imagery and aerial photography for determining heights of vegetation and water-land boundaries.

Drake, B.↗
NASA NTRS1989

A message passing kernel for the hypercluster parallel processing test bed

A Message-Passing Kernel (MPK) for the Hypercluster parallel-processing test bed is described. The Hypercluster is being developed at the NASA Lewis Research Center to support investigations of parallel algorithms and architectures for computational fluid and structural mechanics applications. The Hypercluster resembles the hypercube architecture except that each node consists of multiple processors communicating through shared memory. The MPK efficiently routes information through the Hypercluster, using a message-passing protocol when necessary and faster shared-memory communication whenever possible. The MPK also interfaces all of the processors with the Hypercluster operating system (HYCLOPS), which runs on a Front-End Processor (FEP). This approach distributes many of the I/O tasks to the Hypercluster processors and eliminates the need for a separate I/O support program on the FEP.

Blech, Richard A.↗
NASA NTRS1991

Parallel computations and control of adaptive structures

The equations of motion for structures with adaptive elements for vibration control are presented for parallel computations to be used as a software package for real-time control of flexible space structures. A brief introduction of the state-of-the-art parallel computational capability is also presented. Time marching strategies are developed for an effective use of massive parallel mapping, partitioning, and the necessary arithmetic operations. An example is offered for the simulation of control-structure interaction on a parallel computer and the impact of the approach presented for applications in other disciplines than aerospace industry is assessed.

Park, K. C.↗
NASA NTRS1990

Are highly parallel systems ready for prime time?

This is the edited and abbreviated transcript of a panel discussion held on May 9, 1989, in Los Angeles, during the conference "Parallel Computational Fluid Dynamics-Implementations and Results Using MIMD Computers." The purpose of the conference was to discuss recent developments in the use of MIMD parallel computers in high-performance computational fluid dynamics. The intent of the panel discussion was to summarize the findings of the meeting, and to give a perspective on the state of the art in using parallel computers for solving large-scale engineering and scientific application problems. The panelists were Creon Levit (NAS Systems Division, NASA-Ames Research Center, Moffett Field, California), Kent Misegades (Cray Research, Inc., Mendota Heights, Minnesota), Gary Montry (Myrias Computer Corporation, Albuquerque, New Mexico), Ken Neves (Boeing Computer Services, Seattle, Washington), Anthony Patera (Massachusetts Institute of Technology, Cambridge, Massachusetts), and Justin Rattner (Intel Scientific Computers, Beaverton, Oregon).

Simon, Horst D.↗
NASA NTRS1994

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗
NASA NTRS2007

Modeling Magnetic Properties in EZTB

A software module that calculates magnetic properties of a semiconducting material has been written for incorporation into, and execution within, the Easy (Modular) Tight-Binding (EZTB) software infrastructure. [EZTB is designed to model the electronic structures of semiconductor devices ranging from bulk semiconductors, to quantum wells, quantum wires, and quantum dots. EZTB implements an empirical tight-binding mathematical model of the underlying physics.] This module can model the effect of a magnetic field applied along any direction and does not require any adjustment of model parameters. The module has thus far been applied to study the performances of silicon-based quantum computers in the presence of magnetic fields and of miscut angles in quantum wells. The module is expected to assist experimentalists in fabricating a spin qubit in a Si/SiGe quantum dot. This software can be executed in almost any Unix operating system, utilizes parallel computing, can be run as a Web-portal application program. The module has been validated by comparison of its predictions with experimental data available in the literature.

Lee, Seungwon↗
NASA NTRS2004

Centrifugal Adsorption Cartridge System

The centrifugal adsorption cartridge system (CACS) is an apparatus that recovers one or more bioproduct(s) from a dilute aqueous solution or suspension flowing from a bioreactor. The CACS can be used both on Earth in unit gravity and in space in low gravity. The CACS can be connected downstream from the bioreactor; alternatively, it can be connected into a flow loop that includes the bioreactor so that the liquid can be recycled. A centrifugal adsorption cartridge in the CACS (see figure) includes two concentric cylinders with a spiral ramp between them. The volume between the inner and outer cylinders, and between the turns of the spiral ramp is packed with an adsorbent material. The inner cylinder is a sieve tube covered with a gas-permeable, hydrophobic membrane. During operation, the liquid effluent from the bioreactor is introduced at one end of the spiral ramp, which then constrains the liquid to flow along the spiral path through the adsorbent material. The spiral ramp also makes the flow more nearly uniform than it would otherwise be, and it minimizes any channeling other than that of the spiral flow itself. The adsorbent material is formulated to selectively capture the bioproduct(s) of interest. The bioproduct(s) can then be stored in bound form in the cartridge or else eluted from the cartridge. The centrifugal effect of the spiral flow is utilized to remove gas bubbles from the liquid. The centrifugal effect forces the bubbles radially inward, toward and through the membrane of the inner cylinder. The gas-permeable, hydrophobic membrane allows the bubbles to enter the inner cylinder while keeping the liquid out. The bubbles that thus enter the cylinder are vented to the atmosphere. The spacing between the ramps determines rate of flow along the spiral, and thereby affects the air-bubble-removal efficiency. The spacing between the ramps also determines the length of the fluid path through the cartridge adsorbent, and thus affects the bioproduct-capture efficiency of the cartridge. Depending on the application, several cartridges could be connected in a serial or parallel flow arrangement. A parallel arrangement can be used to increase product-capturing and flow capacities while maintaining a low pressure drop. A serial arrangement can be used to obtain high product-capturing capacity; alternatively, series-connected cartridges can be packed with different adsorbents to capture different bioproducts simultaneously.

Gonda, Steve R.↗
NASA NTRS2013

Modeling of Particle Acceleration at Multiple Shocks via Diffusive Shock Acceleration: Preliminary Results

Successful forecasting of energetic particle events in space weather models require algorithms for correctly predicting the spectrum of ions accelerated from a background population of charged particles. We present preliminary results from a model that diffusively accelerates particles at multiple shocks. Our basic approach is related to box models in which a distribution of particles is diffusively accelerated inside the box while simultaneously experiencing decompression through adiabatic expansion and losses from the convection and diffusion of particles outside the box. We adiabatically decompress the accelerated particle distribution between each shock by either the method explored in Melrose and Pope (1993) and Pope and Melrose (1994) or by the approach set forth in Zank et al. (2000) where we solve the transport equation by a method analogous to operator splitting. The second method incorporates the additional loss terms of convection and diffusion and allows for the use of a variable time between shocks. We use a maximum injection energy (E(sub max)) appropriate for quasi-parallel and quasi-perpendicular shocks and provide a preliminary application of the diffusive acceleration of particles by multiple shocks with frequencies appropriate for solar maximum (i.e., a non-Markovian process).

Parker, L. Neergaard↗
NASA NTRS2015

Minimal Power Latch for Single-Slope ADCs

A latch circuit that uses two interoperating latches. The latch circuit has the beneficial feature that it switches only a single time during a measurement that uses a stair step or ramp function as an input signal in an analog to digital converter. This feature minimizes the amount of power that is consumed in the latch and also minimizes the amount of high frequency noise that is generated by the latch. An application using a plurality of such latch circuits in a parallel decoding ADC for use in an image sensor is given as an example.

Hancock, Bruce R.↗
NASA NTRS1994

VLSI Neuroprocessors

Electronic and optoelectronic hardware implementations of highly parallel computing architectures address several ill-defined and/or computation-intensive problems not easily solved by conventional computing techniques.

computing↗
NASA NTRS1990

Autoplan: A self-processing network model for an extended blocks world planning environment

Self-processing network models (neural/connectionist models, marker passing/message passing networks, etc.) are currently undergoing intense investigation for a variety of information processing applications. These models are potentially very powerful in that they support a large amount of explicit parallel processing, and they cleanly integrate high level and low level information processing. However they are currently limited by a lack of understanding of how to apply them effectively in many application areas. The formulation of self-processing network methods for dynamic, reactive planning is studied. The long-term goal is to formulate robust, computationally effective information processing methods for the distributed control of semiautonomous exploration systems, e.g., the Mars Rover. The current research effort is focusing on hierarchical plan generation, execution and revision through local operations in an extended blocks world environment. This scenario involves many challenging features that would be encountered in a real planning and control environment: multiple simultaneous goals, parallel as well as sequential action execution, action sequencing determined not only by goals and their interactions but also by limited resources (e.g., three tasks, two acting agents), need to interpret unanticipated events and react appropriately through replanning, etc.

Dautrechy, C. Lynne↗
NASA NTRS2003

Computational Aero-acoustics As a Tool For Turbo-machinery Noise Reduction

This talk will provide an overview of the field of computational aero-acoustics and its use in fan noise prediction. After a brief history of computational fluid dynamics, some of the recent developments in computational aero-acoustics will be explored. Computational issues concerning sound wave production, propagation, and reflection in practical turbo-machinery applications will be discussed including: (a) High order/High Resolution Numerical Techniques. (b) High Resolution Boundary Conditions. [c] MIMD Parallel Computing. [d] Form of Governing Equations Useful for Simulations. In addition, the basic design of our Broadband Analysis Stator Simulator (BASS) code and its application to a 2 D rotor wake-stator interaction will be shown. An example of the noise produced by the wakes from a rotor impinging upon a stator cascade will be shown.

Dyson, Rodger W.↗