Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallelism”

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 883 records · Page 49

Computational mechanics analysis tools for parallel-vector supercomputers

Computational algorithms for structural analysis on parallel-vector supercomputers are reviewed. These parallel algorithms, developed by the authors, are for the assembly of structural equations, 'out-of-core' strategies for linear equation solution, massively distributed-memory equation solution, unsymmetric equation solution, general eigensolution, geometrically nonlinear finite element analysis, design sensitivity analysis for structural dynamics, optimization search analysis and domain decomposition. The source code for many of these algorithms is available.

Storaasli, Olaf O.↗

Geometrically nonlinear design sensitivity analysis on parallel-vector high-performance computers

Parallel-vector solution strategies for generation and assembly of element matrices, solution of the resulted system of linear equations, calculations of the unbalanced loads, displacements, stresses, and design sensitivity analysis (DSA) are all incorporated into the Newton Raphson (NR) procedure for nonlinear finite element analysis and DSA. Numerical results are included to show the performance of the proposed method for structural analysis and DSA in a parallel-vector computer environment.

Baddourah, Majdi A.↗

Address tracing of parallel systems via TRAPEDS

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces to use in these simulations, however, is a difficult problem for parallel processor architectures. A technique termed TRAPEDS modifies executable code (at the assembly language level) to dynamically collect the address trace from executing code. TRAPEDS has recently been implemented on both a hypercube multicomputer and a shared-memory multiprocessor. Particular attention is focused on strategies for efficiently and accurately collecting traces from both classes of parallel machines. The iPSC/2 hypercube multicomputer implementation traces both user and system code, and performs simulation on-the-fly to avoid large storage costs. Strategies are detailed for mitigating address trace distortion when collecting operating system traces. The Encore Multimax multiprocessor implementation uses a timer-based approach to reflect the interleaving of the processor traces and stores the traces to disc. Time and space overhead results are presented for both TRAPEDS implementations. Experimental cache simulation results derived from iPSC/2 address traces are presented to illustrate the importance of tracing operating system references.

Stunkel, Craig B.↗

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

Swarztrauber, Paul N.↗

A parallel dynamic load balancing algorithm for 3-D adaptive unstructured grids

Adaptive local grid refinement and coarsening results in unequal distribution of workload among the processors of a parallel system. A novel method for balancing the load in cases of dynamically changing tetrahedral grids is developed. The approach employs local exchange of cells among processors in order to redistribute the load equally. An important part of the load balancing algorithm is the method employed by a processor to determine which cells within its subdomain are to be exchanged. Two such methods are presented and compared. The strategy for load balancing is based on the Divide-and-Conquer approach which leads to an efficient parallel algorithm. This method is implemented on a distributed-memory MIMD system.

Vidwans, A.↗

A parallel-vector Lanczos eigen-solver for structural vibration problems

The Lanczos algorithm for the solution of generalized eigen-problem has been receiving a lot of attention in recent years due to its computational efficiency. The focus of this paper is to develop a Lanczos algorithm which can exploit both the parallel and vector capabilities provided by modern high-performance computers. A partial restoring orthogonality scheme is also developed and incorporated into the basic Lanczos algorithm. The numerical performance in terms of accuracy and efficiency of the proposed parallel-vector Lanczos algorithm is demonstrated by solving for the frequencies and mode shapes of structural problems on multiprocessor supercomputers.

Qin, Jiangning↗

On the dispersion relations for parametric instabilities of parallel-propagating Alfven waves

We consider the dispersion relation for the parametric instabilities of large-amplitude circularly polarized Alfven waves propagating parallel to the ambient magnetic field. A linear perturbation analysis is employed, and the perturbations are taken to propagate along the ambient field. We present an analysis based on Floquet's theorem. The result is a hierarchy of dispersion relations. However, all the dispersion relations are found to be equivalent to the one obtained via the standard analysis; the differences between them are due only to how ca and k are defined. Thus we conclude that physically there is really only one dispersion relation, namely the 'electrostatic dispersion relation', which is in agreement with earlier works. However, we disagree with Vinas and Goldstein (1991), who obtained additional dispersion relations which they have called the 'electromagnetic dispersion relations'. Their additional dispersion relations are a consequence of first truncating the dispersion relation for obliquely propagating perturbations and then taking the limit of parallel-propagating perturbations.

Yajanti, Venku↗

Theoretical and experimental investigation of heat transfer by laminar natural convection between parallel plates

Results are presented of a theoretical and experimental investigation of heat transfer involving laminar natural convection of fluids enclosed between parallel walls oriented in the direction of the body force, where one wall is heated uniformly, and the other is cooled uniformly. For the experimental work, parallel walls were simulated by using an annulus with an inner-to-outer diameter ratio near 1. The results of the theoretical investigation are presented in the form of equations for the velocity and temperature profiles and the ratio of actual temperature drop across the fluid to the temperature drop for pure conduction. No experimental measurements were made of the velocity and temperature profiles, but the experimental results are compared with theory on the basis of the ratio of the actual temperature drop to the temperature drop for pure conduction. Good agreement was obtained between theory and experiment for axial temperature gradients of 10 degrees F. per foot or larger.

Lietzke, A F↗

Investigation of the Behavior of Parallel Two-Dimensional Air Jets

An investigation was made of the flow downstream from a "two-dimensional" grid formed of parallel rods. In both two and three dimensional jet fields there is a critical range of grid density below which the downstream flow is stable and above which it is unstable. The flow can be completely stabilized by means of an adequate lateral contraction beginning immediately after the grid or by use of a fine-mesh damping screen parallel to the grid plane and within a definite range of positions downstream from the grid.

Corrsin, Stanley↗

Resistance of a plate in parallel flow at low Reynolds numbers

The present paper gives the results of measurements of the resistance of a plate placed parallel to the flow in the range of Reynolds numbers from 10 to 2300; in this range the resistance deviates from the formula of Blasius. The lower limit of validity of the Blasius formula is determined and also the increase in resistance at the edges parallel to the flow in the case of a plate of finite width.

BOUNDARY LAYER - PLATES, FLAT - LAMINAR↗

Six-Degree-Of-Freedom Parallel Minimanipulator

Six-degree-of-freedom parallel minimanipulator stiffer and simpler than earlier six-degree-of-freedom manipulators. Includes only three inextensible limbs with universal joints at ends. Limbs have equal lengths and act in parallel as they share load on manipulated platform. Designed to provide high resolution and high stiffness for fine control of position and force in hybrid serial/parallel-manipulator system.

Tahmasebi, Farhad↗

Overview of ICLASS research: Reliable and parallel computing

An overview of Illinois Computer Laboratory for Aerospace Systems and Software (ICLASS) Research: Reliable and Parallel Computing is presented. Topics covered include: reliable and fault tolerant computing; fault tolerant multiprocessor architectures; fault tolerant matrix computation; and parallel processing.

Iyer, Ravi K.↗

Performance of a parallel algorithm for standard cell placement on the Intel Hypercube

A parallel simulated annealing algorithm for standard cell placement that is targeted to run on the Intel Hypercube is presented. A tree broadcasting strategy that is used extensively in our algorithm for updating cell locations in the parallel environment is presented. Studies on the performance of our algorithm on example industrial circuits show that it is faster and gives better final placement results than the uniprocessor simulated annealing algorithms.

Jones, Mark↗

Portable programming on parallel/networked computers using the Application Portable Parallel Library (APPL)

The Application Portable Parallel Library (APPL) is a subroutine-based library of communication primitives that is callable from applications written in FORTRAN or C. APPL provides a consistent programmer interface to a variety of distributed and shared-memory multiprocessor MIMD machines. The objective of APPL is to minimize the effort required to move parallel applications from one machine to another, or to a network of homogeneous machines. APPL encompasses many of the message-passing primitives that are currently available on commercial multiprocessor systems. This paper describes APPL (version 2.3.1) and its usage, reports the status of the APPL project, and indicates possible directions for the future. Several applications using APPL are discussed, as well as performance and overhead results.

Quealy, Angela↗

Operation of high power converters in parallel

High power converters that are used in space power subsystems are limited in power handling capability due to component and thermal limitations. For applications, such as Space Station Freedom, where multi-kilowatts of power must be delivered to user loads, parallel operation of converters becomes an attractive option when considering overall power subsystem topologies. TRW developed three different unequal power sharing approaches for parallel operation of converters. These approaches, known as droop, master-slave, and proportional adjustment, are discussed and test results are presented.

Decker, D. K.↗

Mobile and replicated alignment of arrays in data-parallel programs

When a data-parallel language like FORTRAN 90 is compiled for a distributed-memory machine, aggregate data objects (such as arrays) are distributed across the processor memories. The mapping determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: first, an alignment that maps all the objects to an abstract template, and then a distribution that maps the template to the processors. We solve two facets of the problem of finding alignments that reduce residual communication: we determine alignments that vary in loops, and objects that should have replicated alignments. We show that loop-dependent mobile alignment is sometimes necessary for optimum performance, and we provide algorithms with which a compiler can determine good mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself (via spread operations) or can be used to improve performance. We propose an algorithm based on network flow that determines which objects to replicate so as to minimize the total amount of broadcast communication in replication. This work on mobile and replicated alignment extends our earlier work on determining static alignment.

Chatterjee, Siddhartha↗

Parallel optimization algorithms and their implementation in VLSI design

Two new parallel optimization algorithms based on the simplex method are described. They may be executed by a SIMD parallel processor architecture and be implemented in VLSI design. Several VLSI design implementations are introduced. An application example is reported to demonstrate that the algorithms are effective.

Lee, G.↗

A new conformal absorbing boundary condition for finite element meshes and parallelization of FEMATS

Some of the progress toward the development and parallelization of an improved version of the finite element code FEMATS is described. This is a finite element code for computing the scattering by arbitrarily shaped three dimensional surfaces composite scatterers. The following tasks were worked on during the report period: (1) new absorbing boundary conditions (ABC's) for truncating the finite element mesh; (2) mixed mesh termination schemes; (3) hierarchical elements and multigridding; (4) parallelization; and (5) various modeling enhancements (antenna feeds, anisotropy, and higher order GIBC).

Chatterjee, A.↗