Search NASASearch

SEARCH · Search NASA

Results for “Massively Parallel Implementation”

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 91 records · Page 5

A Partitioned -Task Parallel Implementation of the NASA Multiscale Analysis Tool for High Performance Computing

The NASA Multiscale Analysis Tool (NASMAT) is a “plug and play” software package that allows users to conduct massively multiscale modeling of hierarchical and nonlinear materials. This work extends the scalability and improves the High Performance Computing friendliness of NASMAT by adopting a Partitioned Task-Parallel approach. Interoperability of NASMAT with external software is enhanced through preCICE, a open source library for multiphysics coupling in a partitioned manner. Enhancement through preCICE allows for easy integration of NASMAT to other macro solvers and dissociates the parallelization strategy adopted within NASMAT from the macro solver. The task-parallel framework based on Master-Worker approach is implemented as the parallelization scheme. The scheme accounts for hierarchy of multiple scales (task-dependence) and heterogeneous nature (dynamic load balancing) of computations. The applicability and scalability of the framework will be evaluated by analyzing large scale engineering problems through massively multiscale methods.

NASMAT

Simulation of charged particle transport on the MPP

Computations of cosmic ray transport based upon finite difference methods are afflicted by instabilities, inaccuracies, and artifacts. To avoid these problems, a Monte Carlo formulation was developed which is closely related not only to the finite difference formulation, but also to the underlying physics of transport phenomena. Implementations of this approach are currently running on the Massively Parallel Processor at Goddard, whose enormous computing power overwhelms the poor statistical accuracy that usually limits the use of stochastic methods. In a Monte Carlo simulation of rectilinear transport, the coherent and diffusive effects that appeared are in good quantitative agreement with both finite difference and analytical calculations.

Earl, James A.

Design and Performance Analysis of a Massively Parallel Atmospheric General Circulation Model

In the 1990's computer manufacturers are increasingly turning to the development of parallel processor machines to meet the high performance needs of their customers. Simultaneously, atmospheric scientists study weather and climate phenomena ranging from hurricanes to El Nino to global warming that require increasingly fine resolution models. Here, implementation of a parallel atmospheric general circulation model (GCM) which exploits the power of massively parallel machines is described. Using the horizontal data domain decomposition methodology, this FORTRAN 90 model is able to integrate a 0.6 deg. longitude by 0.5 deg. latitude problem at a rate of 19 Gigaflops on 512 processors of a Cray T3E 600; corresponding to 280 seconds of wall-clock time per simulated model day. At this resolution, the model has 64 times as many degrees of freedom and performs 400 times as many floating point operations per simulated day as the model it replaces.

Schaffer, Daniel S.

Aircraft optimization by a system approach: Achievements and trends

Recently emerging methodology for optimal design of aircraft treated as a system of interacting physical phenomena and parts is examined. The methodology is found to coalesce into methods for hierarchic, non-hierarchic, and hybrid systems all dependent on sensitivity analysis. A separate category of methods has also evolved independent of sensitivity analysis, hence suitable for discrete problems. References and numerical applications are cited. Massively parallel computer processing is seen as enabling technology for practical implementation of the methodology.

Sobieszczanski-Sobieski, Jaroslaw

Aircraft optimization by a system approach - Achievements and trends

Recently emerging methodology for optimal design of aircraft treated as a system of interacting physical phenomena and parts is examined. The methodology is found to coalesce into methods for hierarchic, non-hierarchic, and hybrid systems all dependent on sensitivity analysis. A separate category of methods has also evolved independent of sensitivity analysis, hence suitable for discrete problems. References and numerical applications are cited. Massively parallel computer processing is seen as enabling technology for practical implementation of the methodology.

Sobieszczanski-Sobieski, Jaroslaw

Motion detection in astronomical and ice floe images

Two approaches are presented for establishing correspondence between small areas in pairs of successive images for motion detection. The first one, based on local correlation, is used on a pair of successive Voyager images of the Jupiter which differ mainly in locally variable translations. This algorithm is implemented on a sequential machine (VAX 780) as well as the Massively Parallel Processor (MPP). In the case of the sequential algorithm, the pixel correspondence or match is computed on a sparse grid of points using nonoverlapping windows (typically 11 x 11) by local correlations over a predetermined search area. The displacement of the corresponding pixels in the two images is called the disparities to cubic surfaces. The disparities at points where the error between the computed values and the surface values exceeds a particular threshold are replaced by the surface values. A bilinear interpolation is then used to estimate disparities at all other pixels between the grid points. When this algorithm was applied at the red spot in the Jupiter image, the rotating velocity field of the storm was determined. The second method of motion detection is applicable to pairs of images in which corresponding areas can experience considerable translation as well as rotation.

Manohar, M.

Massively parallel computing for the simulation of unsteady flows in turbomachinery

This paper deals with evaluating the capabilities of the massively parallel Connection Machine CM2 in predicting unsteady flows in turbomachines. The implementation on the CM2 of an implicit, time-accurate, zonal algorithm for the Navier-Stokes equations in two dimensions is described. Programming issues and modifications made to the original sequential algorithm to improve performance on the CM2 are briefly discussed. Performance is compared to a functionally equivalent code for the Cray YMP.

Madavan, Nateri K.

Modeling Chemical Reactions in Classical Molecular Dynamics Simulations

An algorithm capable of incorporating multi-step reaction mechanisms into atomistic molecular dynamics (MD) simulations using traditional fixed valence force fields is proposed and implemented within the framework of LAMMPS (Large-scale Atomic Molecular Massively Parallel Simulator). This extension, referred to as fix bond/react, enables bonding topology modifications during a running MD simulation using pre- and post-reaction bonding templates to carry out a pre-specified reaction. Candidate reactants are first identified by interatomic separation, followed by the application of a generalized topology matching algorithm to confirm they match the pre-reaction template. This is followed by a topology conversion to match the post-reaction template and a dynamic relaxation to minimize high energy configurations. Two case studies, the condensation polymerization of nylon 6,6 and the formation of a highly-crosslinked epoxy, are simulated to demonstrate the robustness, stability, and speed of the algorithm. Improvements which could increase its utility are discussed.

Jacob R Gissinger

Discrete Adjoint-Based Design for Unsteady Turbulent Flows On Dynamic Overset Unstructured Grids

A discrete adjoint-based design methodology for unsteady turbulent flows on three-dimensional dynamic overset unstructured grids is formulated, implemented, and verified. The methodology supports both compressible and incompressible flows and is amenable to massively parallel computing environments. The approach provides a general framework for performing highly efficient and discretely consistent sensitivity analysis for problems involving arbitrary combinations of overset unstructured grids which may be static, undergoing rigid or deforming motions, or any combination thereof. General parent-child motions are also accommodated, and the accuracy of the implementation is established using an independent verification based on a complex-variable approach. The methodology is used to demonstrate aerodynamic optimizations of a wind turbine geometry, a biologically-inspired flapping wing, and a complex helicopter configuration subject to trimming constraints. The objective function for each problem is successfully reduced and all specified constraints are satisfied.

Nielsen, Eric J.

Mapping robust parallel multigrid algorithms to scalable memory architectures

The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than line relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. The parallel implementation of a V-cycle multiple semi-coarsened grid (MSG) algorithm or distributed-memory architectures such as the Intel iPSC/860 and Paragon computers is addressed. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. A mapping of an MSG algorithm to distributed-memory architectures that demonstrate how both levels of parallelism can be exploited is described. The results is a robust and effective multigrid algorithm for distributed-memory machines.

Overman, Andrea

Radiative Heat Transfer Capability Implemented in OpenNCC for Conjugate Heat Transfer Applications

Thermal efficiency of gas turbine engine increases as the temperature and pressure at the combustor increases. Consequently, the materials used inside a combustor must survive an increasingly challenging environment. For this reason, accurate assessment of heat transfer is crucial for combustor design. While all three modes of heat transfer are present inside a combustor, the focus of this paper is the thermal radiation. Radiative heat transfer in a gas turbine combustors are particularly interesting from three reasons. Firstly, the radiative heat loss from the combustion region may affect the emission performance. Secondly, the cooling air will protect the liner from convection but not necessary from radiation. Finally, it is less frequently incorporated in CFD analysis than other forms of heat transfer. In this work, radiative heat transfer using discrete ordinate method has been incorporated in OpenNCC (a publicly releasable version of the National Combustion Code) developed at NASA Glenn Research Center. Aside from massively parallel computation capability using MPI and the ability to utilize unstructured mesh, the current implementation includes two types of spectral models, namely, the weighted some of gray gas model and the full spectrum correlated k-distribution model. After presenting the theory and the strategy of implementation, results of validation cases for gray gas and spectral models will be presented. While the implementation of the radiation solver is intended for gas turbine application, the radiation solver can run independently from the convection/combustion solver and the same theory can be applied to other application.

OpenNCC

Radiative Heat Transfer Capability Implemented in OpenNCC for Conjugate Heat Transfer Applications

Thermal efficiency of gas turbine engine increases as the temperature and pressure at the combustor increases. Consequently, the materials used inside a combustor must survive an increasingly challenging environment. For this reason, accurate assessment of heat transfer is crucial for combustor design. While all three modes of heat transfer are present inside a combustor, the focus of this paper is the thermal radiation. Radiative heat transfer in a gas turbine combustors are particularly interesting from three reasons. Firstly, the radiative heat loss from the combustion region may affect the emission performance. Secondly, the cooling air will protect the liner from convection but not necessary from radiation. Finally, it is less frequently incorporated in CFD analysis than other forms of heat transfer. In this work, radiative heat transfer using discrete ordinate method has been incorporated in OpenNCC (a publicly releasable version of the National Combustion Code) developed at NASA Glenn Research Center. Aside from massively parallel computation capability using MPI and the ability to utilize unstructured mesh, the current implementation includes two types of spectral models, namely, the weighted some of gray gas model and the full spectrum correlated k-distribution model. After presenting the theory and the strategy of implementation, results of validation cases for gray gas and spectral models will be presented. While the implementation of the radiation solver is intended for gas turbine application, the radiation solver can run independently from the convection/combustion solver and the same theory can be applied to other application.

OpenNCC

Future directions in computing and CFD

In recent years CFD on massively parallel machines has become a reality. This paper summarizes some recent trends both in high performance computing, and in CFD using parallel machines. The long term computational requirements for accomplishing some of the large scale problems in computational aerosciences, and current hardware and architecture trends are discussed. Performance results obtained from the implementation of some CFD applications on the Connection Machine CM-2 and the Intel iPSC/860 at NASA Ames Research Center are presented. It is argued that only massively parallel machines will be able to meet these grand challenge requirements.

Bailey, F. R.

Missileborne Artificial Vision System (MAVIS)

Several years ago when INTEL and China Lake designed the ETANN chip, analog VLSI appeared to be the only way to do high density neural computing. In the last five years, however, digital parallel processing chips capable of performing neural computation functions have evolved to the point of rough equality with analog chips in system level computational density. The Naval Air Warfare Center, China Lake, has developed a real time, hardware and software system designed to implement and evaluate biologically inspired retinal and cortical models. The hardware is based on the Adaptive Solutions Inc. massively parallel CNAPS system COHO boards. Each COHO board is a standard size 6U VME card featuring 256 fixed point, RISC processors running at 20 MHz in a SIMD configuration. Each COHO board has a companion board built to support a real time VSB interface to an imaging seeker, a NTSC camera, and to other COHO boards. The system is designed to have multiple SIMD machines each performing different corticomorphic functions. The system level software has been developed which allows a high level description of corticomorphic structures to be translated into the native microcode of the CNAPS chips. Corticomorphic structures are those neural structures with a form similar to that of the retina, the lateral geniculate nucleus, or the visual cortex. This real time hardware system is designed to be shrunk into a volume compatible with air launched tactical missiles. Initial versions of the software and hardware have been completed and are in the early stages of integration with a missile seeker.

Andes, David K.

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.

Overcoming rule-based rigidity and connectionist limitations through massively-parallel case-based reasoning

Symbol manipulation as used in traditional Artificial Intelligence has been criticized by neural net researchers for being excessively inflexible and sequential. On the other hand, the application of neural net techniques to the types of high-level cognitive processing studied in traditional artificial intelligence presents major problems as well. A promising way out of this impasse is to build neural net models that accomplish massively parallel case-based reasoning. Case-based reasoning, which has received much attention recently, is essentially the same as analogy-based reasoning, and avoids many of the problems leveled at traditional artificial intelligence. Further problems are avoided by doing many strands of case-based reasoning in parallel, and by implementing the whole system as a neural net. In addition, such a system provides an approach to some aspects of the problems of noise, uncertainty and novelty in reasoning systems. The current neural net system (Conposit), which performs standard rule-based reasoning, is being modified into a massively parallel case-based reasoning version.

Barnden, John