Search NASA⌕ Search

SEARCH · Search NASA

Results for “Supercomputing”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Cellular automaton supercomputing

Many of the models now used in science and engineering are over a century old. And most of them can be implemented on modern digital computers only with considerable difficulty. Some new basic models are discussed which are much more directly suitable for digital computer simulation. The fundamental principle is that the models considered herein are as suitable as possible for implementation on digital computers. It is then a matter of scientific analysis to determine whether such models can reproduce the behavior seen in physical and other systems. Such analysis was carried out in several cases, and the results are very encouraging.

Wolfram, Stephen↗
NASA NTRS1985

Supercomputing on massively parallel bit-serial architectures

Research on the Goodyear Massively Parallel Processor (MPP) suggests that high-level parallel languages are practical and can be designed with powerful new semantics that allow algorithms to be efficiently mapped to the real machines. For the MPP these semantics include parallel/associative array selection for both dense and sparse matrices, variable precision arithmetic to trade accuracy for speed, micro-pipelined train broadcast, and conditional branching at the processing element (PE) control unit level. The preliminary design of a FORTRAN-like parallel language for the MPP has been completed and is being used to write programs to perform sparse matrix array selection, min/max search, matrix multiplication, Gaussian elimination on single bit arrays and other generic algorithms. A description is given of the MPP design. Features of the system and its operation are illustrated in the form of charts and diagrams.

Iobst, Ken↗
NASA NTRS1987

Down-to-earth supercomputing at NASA Ames

The requirements for computers for aerospace vehicle design problems, in particular fluid dynamics, are examined. The levels of approximation to Navier-Stokes equations are: (1) linearized inviscid form, (2) nonlinear inviscid equation, (3) Reynolds-averaged Navier-Stokes equation, (4) large eddy simulation with models for subgrid scale turbulence, and (5) full Navier-Stokes equations to calculate laminar/turbulent transition and turbulence dissipation. The Cray 2 with 256 megaword memory and 4.1 nsec clock and the Cray X-MP/48 with a 128 megaword memory and a 9.5 nsec clock of the Ames facility are described, and an example revealing their applicability is presented. The use of zonal methods to simulate aerodynamic flow fields numerically is discussed. Consideration is given to the development of a program for simulation of aerodynamic flow fields, the compilers, symbolic debuggers, the scheduling of multiple CPUs, and the analysis and storage of the data.

Stevens, Kenneth G., Jr.↗
NASA NTRS1987

Approximate polynomial preconditioning applied to biharmonic equations on vector supercomputers

Applying a finite difference approximation to a biharmonic equation results in a very ill-conditioned system of equations. This paper examines the conjugate gradient method used in conjunction with the generalized and approximate polynomial preconditionings for solving such linear systems. An approximate polynomial preconditioning is introduced, and is shown to be more efficient than the generalized polynomial preconditionings. This new technique provides a simple but effective preconditioning polynomial, which is based on another coefficient matrix rather than the original matrix operator as commonly used.

Wong, Yau Shu↗
NASA NTRS1988

Internal fluid mechanics research on supercomputers for aerospace propulsion systems

The Internal Fluid Mechanics Division of the NASA Lewis Research Center is combining the key elements of computational fluid dynamics, aerothermodynamic experiments, and advanced computational technology to bring internal computational fluid mechanics (ICFM) to a state of practical application for aerospace propulsion systems. The strategies used to achieve this goal are to: (1) pursue an understanding of flow physics, surface heat transfer, and combustion via analysis and fundamental experiments, (2) incorporate improved understanding of these phenomena into verified 3-D CFD codes, and (3) utilize state-of-the-art computational technology to enhance experimental and CFD research. Presented is an overview of the ICFM program in high-speed propulsion, including work in inlets, turbomachinery, and chemical reacting flows. Ongoing efforts to integrate new computer technologies, such as parallel computing and artificial intelligence, into high-speed aeropropulsion research are described.

Miller, Brent A.↗
NASA NTRS1987

Supercomputing of supersonic flows using upwind relaxation and MacCormack schemes

The performance of two numerical solution schemes, (1) an implicit upwind relaxation with a finite-volume discretization (Thomas and Walters, 1985) and (2) an explicit-implicit MacCormack (1981) scheme with a finite-difference discretization, is compared in two-dimensional simulations of supersonic flow past a flat plate with leading edge, a rearward-facing step, a 10-deg compression corner, a NACA 0012 airfoil at high angle of attack, and a cavity. The algebraic turbulence model, the solution methods, and the boundary conditions and SIMD coding are explained, and the results are presented in tables and graphs and characterized with reference to published experimental data. Scheme (1) is found to converge more rapidly and to give more accurate results than (2) in a wide range of problem types.

Baysal, O.↗
NASA NTRS1987

Optimization of the computational load of a hypercube supercomputer onboard a mobile robot

A combinatorial optimization methodology is developed, which enables the efficient use of hypercube multiprocessors onboard mobile intelligent robots dedicated to time-critical missions. The methodology is implemented in terms of large-scale concurrent algorithms based either on fast simulated annealing, or on nonlinear asynchronous neural networks. In particular, analytic expressions are given for the effect of single-neuron perturbations on the systems' configuration energy. Compact neuromorphic data structures are used to model effects such as precedence constraints, processor idling times, and task-schedule overlaps. Results for a typical robot-dynamics benchmark are presented.

Barhen, Jacob↗
NASA NTRS1989

Development of a Navier-Stokes algorithm for parallel-processing supercomputers

An explicit flow solver, applicable to the hierarchy of model equations ranging from Euler to full Navier-Stokes, is combined with several techniques designed to reduce computational expense. The computational domain consists of local grid refinements embedded in a global coarse mesh, where the locations of these refinements are defined by the physics of the flow. Flow characteristics are also used to determine which set of model equations is appropriate for solution in each region, thereby reducing not only the number of grid points at which the solution must be obtained, but also the computational effort required to get that solution. Acceleration to steady-state is achieved by applying multigrid on each of the subgrids, regardless of the particular model equations being solved. Since each of these components is explicit, advantage can readily be taken of the vector- and parallel-processing capabilities of machines such as the Cray X-MP and Cray-2.

Swisshelm, Julie M.↗
NASA NTRS1988

A high-performance FFT algorithm for vector supercomputers

Many traditional algorithms for computing the fast Fourier transform (FFT) on conventional computers are unacceptable for advanced vector and parallel computers because they involve nonunit, power-of-two memory strides. A practical technique for computing the FFT that avoids all such strides and appears to be near-optimal for a variety of current vector and parallel computers is presented. Performance results of a program based on this technique are given. Notable among these results is that a FORTRAN implementation of this algorithm on the CRAY-2 runs up to 77-percent faster than Cray's assembly-coded library routine.

Bailey, David H.↗
NASA NTRS1988

Supercomputer chemistry at the University of Minnesota

The focus of cluster chemistry studies at the University of Minnesota is on the adsorption of small hydrocarbon molecules on metal and graphite surfaces, and on the substitution defects in diamond and silicon. Of particular interest is the study of very large systems such as the C60 molecule and the C150H30 molecule. Many of the properties of such clusters converge extremely slowly toward bulk values. Ultrathin films and microporous media are discussed as well as the Brownian dynamics of polymers.

Almlof, Jan↗
NASA NTRS1988

Development of an aerodynamics algorithm for parallel-processing supercomputers

An explicit flow solver, applicable to the hierarchy of model equations ranging from Euler to full Navier-Stokes, is combined with several techniques designed to reduce computational expense. The computational domain consists of local grid refinements embedded in a global coarse mesh, where the locations of these refinements are defined by the physics of the flow. Flow characteristics are also used to determine which set of model equations is appropriate for solution in each region, thereby reducing not only the number of grid points at which the solution must be obtained, but also the computational effort required to get that solution. Acceleration to steady-state is achieved by applying multigrid on each of the subgrids, regardless of the particular model equations being solved. Since each of these components is explicit, advantage can readily be taken of the vector- and parallel-processing capabilities of machines such as the Cray X-MP and Cray-2.

Swisshelm, Julie M.↗
NASA NTRS1990

Multi-processing on supercomputers for computational aerodynamics

The MIMD concept is applied, through multitasking, with relatively minor modifications to an existing code for a single processor. This approach maps the available memory to multiple processors, exploiting the C-FORTRAN-Unix interface. An existing single processor algorithm is mapped without the need for developing a new algorithm. The procedure of designing a code utilizing this approach is automated with the Unix stream editor. A Multiple Processor Multiple Grid (MPMG) code is developed as a demonstration of this approach. This code solves the three-dimensional, Reynolds-averaged, thin-layer and slender-layer Navier-Stokes equations with an implicit, approximately factored and diagonalized method. This solver is applied to a generic, oblique-wing aircraft problem on a four-processor computer using one process for data management and nonparallel computations and three processes for pseudotime advance on three different grid systems.

Yarrow, Maurice↗
NASA NTRS1990

Supercomputer applications in gas turbine flowfield simulation

The numerical simulation of the unsteady three-dimensional viscous flow in a gas turbine stage is considered. Results from a three-dimensional time-accurate Navier-Stokes simulation of rotor-stator interaction in an axial turbine stage are presented. The present study uses a fine grid in the spanwise direction to better resolve the complex three-dimensional flowfield, and complements earlier reported coarse-grid calculations. Several different features of the flowfield are analyzed and compared to earlier calculations and to experimental data whenever possible. Computer animation techniques are used to visualize various unsteady three-dimensional features of the flow. The results demonstrate the capabilities of current computing hardware in obtaining accurate simulations of unsteady flows in turbomachines.

Madavan, Nateri K.↗
NASA NTRS1991

Implementation of 3-D isoparametric finite elements on supercomputer for the formulation of recursive dynamical equations of multi-body systems

A computational algorithmic procedure is developed and implemented for the dynamic analysis of a multibody system with rigid/flexible interconnected bodies. The algorithm takes into consideration the large rotation/translation and small elastic deformations associated with the rigid-body degrees of freedom and the flexibility of the bodies in the system respectively. Versatile three-dimensional isoparametric brick elements are employed for the modeling of the geometric configurations of the bodies. The formulation of the recursive dynamical equations of motion is based on the recursive Kane's equations, strain energy concepts, and the techniques of component mode synthesis. In order to minimize CPU-intensive matrix multiplication operations and speed up the execution process, the concepts of indexed arrays is utilized in the formulation of the equations of motion. A spin-up maneuver of a space robot with three flexible links carrying a solar panel is used as an illustrative example.

Shareef, N. H.↗
NASA NTRS1991

Efficient multitasking of Choleski matrix factorization on CRAY supercomputers

A Choleski method is described and used to solve linear systems of equations that arise in large scale structural analysis. The method uses a novel variable-band storage scheme and is structured to exploit fast local memory caches while minimizing data access delays between main memory and vector registers. Several parallel implementations of this method are described for the CRAY-2 and CRAY Y-MP computers demonstrating the use of microtasking and autotasking directives. A portable parallel language, FORCE, is used for comparison with the microtasked and autotasked implementations. Results are presented comparing the matrix factorization times for three representative structural analysis problems from runs made in both dedicated and multi-user modes on both computers. CPU and wall clock timings are given for the parallel implementations and are compared to single processor timings of the same algorithm.

Overman, Andrea L.↗
NASA NTRS1992

Iterative methods for large scale static analysis of structures on a scalable multiprocessor supercomputer

A parallel Preconditioned Conjugate Gradient (PCG) iterative solver has been developed and implemented on the iPSC-860 scalable hypercube. This new implementation makes use of the Parallel Automated Runtime Toolkit at ICASE (PARTI) primitives to efficiently program irregular communications patterns that exist in general sparse matrices and in particular in the finite element sparse stiffness matrices. The iterative PCG has been used to solve the finite element equations that result from discretizing large scale aerospace structures. In particular, the static response of the High Speed Civil Transport (HSCT) finite element model is solved on the iPSC-860.

Sobh, Nahil Atef↗