SEARCH · Engineering Papers

Results for “parallel codes”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Micro- and meso-scale simulations of magnetospheric processes related to the aurora and substorm morphology

The primary methodology during the grant period has been the use of micro or meso-scale simulations to address specific questions concerning magnetospheric processes related to the aurora and substorm morphology. This approach, while useful in providing some answers, has its limitations. Many of the problems relating to the magnetosphere are inherently global and kinetic. Effort during the last year of the grant period has increasingly focused on development of a global-scale hybrid code to model the entire, coupled magnetosheath - magnetosphere - ionosphere system. In particular, numerical procedures for curvilinear coordinate generation and exactly conservative differencing schemes for hybrid codes in curvilinear coordinates have been developed. The new computer algorithms and the massively parallel computer architectures now make this global code a feasible proposition. Support provided by this project has played an important role in laying the groundwork for the eventual development or a global-scale code to model and forecast magnetospheric weather.

Swift, Daniel W.↗

NASA NTRS1996

Task 7: ADPAC User's Manual

The overall objective of this study was to develop a 3-D numerical analysis for compressor casing treatment flowfields. The current version of the computer code resulting from this study is referred to as ADPAC (Advanced Ducted Propfan Analysis Codes-Version 7). This report is intended to serve as a computer program user's manual for the ADPAC code developed under Tasks 6 and 7 of the NASA Contract. The ADPAC program is based on a flexible multiple- block grid discretization scheme permitting coupled 2-D/3-D mesh block solutions with application to a wide variety of geometries. Aerodynamic calculations are based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. Steady flow predictions are accelerated by a multigrid procedure. An iterative implicit algorithm is available for rapid time-dependent flow calculations, and an advanced two equation turbulence model is incorporated to predict complex turbulent flows. The consolidated code generated during this study is capable of executing in either a serial or parallel computing mode from a single source code. Numerous examples are given in the form of test cases to demonstrate the utility of this approach for predicting the aerodynamics of modem turbomachinery configurations.

Hall, E. J.↗

NASA NTRSDate not supplied

Recent Advancements in the PATO Material Response Code

Introduction: Predicting the complicated multiphysics phenomena during atmospheric entry requires high-fidelity modeling tools to refine estimates of mission risks during entry. To this end, new capabilities are being added to the Porous-material Analysis Toolbox based on OpenFOAM (PATO). PATO is an open-source software for Computational Material Response (CMR) of reactive porous materials submitted to high-temperature environments. The objective of this work is to highlight current efforts to add to and improve upon the modeling capabilities of PATO. These include efforts to loosely couple PATO with other discipline specialized codes including hypersonic Computational Fluid Dynamics (CFD), to assess the interaction effects between pyrolysis gas blowing and the boundary layer, and Computational Solid Mechanics (CSM), to address modeling of mechanical erosion. Other refinements include surface phenomena modeling capabilities to address the effects of silicone-based coatings applied to the TPS during flight preparation, and a unified multiphase solver for a mixed porous-material and plain-fluid domain. Coupling CMR with CFD (CMR/CFD): A loose coupling between PATO and the Data Parallel Line Relaxation (DPLR) CFD code has been achieved by making use of a blowing boundary condition at the heatshield surface available in DPLR. Starting with heat flux estimates with no pyrolysis gas blowing at the surface, blowing gases are computed by the CMR and passed to the CFD such that aerothermal properties of the environment can be recomputed for a new CMR computation. This leads to an iterative process which is supplemented with an estimate of the radiative heat flux using the Nonequilibrium air radiation (NEQAIR) program. The entire iterative process is illustrated in Figure 1. This coupling strategy has been utilized in computing the MSL material response. The goal is to compare the coupled CMR/CFD results with material response results obtained using traditional blowing corrections. Coupling CMS with CMR: A mechanical erosion model is currently being implemented in PATO to account for the additional mass removal induced by high shear conditions. The modeling process at each timestep consists of updating the mechanical properties as a function of temperature and computing the stress tensor and displacement fields of the material. Then, a failure criteria model determines the regions in which the stress exceeds the ultimate strength values resulting in mesh movement to account for mass removal. This model allows the material response simulation to compute the recession due to both oxidation and shear-induced erosion. The model is demonstrated by computing material response of sphere-cone arc jet samples. Surface Modeling Capabilities: NuSil, a silicone-based coating, was sprayed onto the MSL and Mars 2020 heatshields to mitigate shedding of phenolic dust. To better understand the effects of the NuSil coating on the material response, a novel model has been implemented in PATO. In this model, the equilibrium of the charred NuSil surface is modeled as pure silica, and a constant offset, inspired by the classical spallation model, is added to the the char blowing rate and wall enthalpy to reproduce HyMETS experimental results. The model has also been used to estimate the 3D material response of the MSL heatshield. Unified Solver: In addition to the iterative loose coupling approach mentioned above, a multiphase unified solver is being developed to couple the environment (plain-fluid phase) and the porous-material phase. The solver is based on the volume averaged conservation of mass, momentum, and energy for the macroscale with closure models which include microscale effects through effective physicochemical properties. The unified solver has been used to compute flow through a porous plug and solve the Beavers and Joseph problem. Since the strong coupling between phases is inherent to this solver, modeling assumptions present in other coupling methods of material response are mitigated. This strategy also makes it feasible to capture the competition between surface and volume ablation in the same computational domain, which is usually not possible with other coupling approaches.

Material Response↗

NASA NTRS1994

MPIRUN: A Portable Loader for Multidisciplinary and Multi-Zonal Applications

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. One method for implementing the message passing portion of these codes is with the new Message Passing Interface (MPI) standard. Unfortunately, this standard only specifies the message passing portion of an application, but does not specify any portable mechanisms for loading an application. MPIRUN was developed to provide a portable means for loading MPI programs, and was specifically targeted at multidisciplinary and multi-zonal applications. Programs using MPIRUN for loading and MPI for message passing are then portable between all machines supported by MPIRUN. MPIRUN is currently implemented for the Intel iPSC/860, TMC CM5, IBM SP-1 and SP-2, Intel Paragon, and workstation clusters. Further, MPIRUN is designed to be simple enough to port easily to any system supporting MPI.

Fineberg, Samuel A.↗

NASA NTRS1990

Line-drawing algorithms for parallel machines

The fact that conventional line-drawing algorithms, when applied directly on parallel machines, can lead to very inefficient codes is addressed. It is suggested that instead of modifying an existing algorithm for a parallel machine, a more efficient implementation can be produced by going back to the invariants in the definition. Popular line-drawing algorithms are compared with two alternatives; distance to a line (a point is on the line if sufficiently close to it) and intersection with a line (a point on the line if an intersection point). For massively parallel single-instruction-multiple-data (SIMD) machines (with thousands of processors and up), the alternatives provide viable line-drawing algorithms. Because of the pixel-per-processor mapping, their performance is independent of the line length and orientation.

Pang, Alex T.↗

NASA NTRS1998

Rapid Prediction of Unsteady Three-Dimensional Viscous Flows in Turbopump Geometries

A program is underway to improve the efficiency of a three-dimensional Navier-Stokes code and generalize it for nozzle and turbopump geometries. Code modifications have included the implementation of parallel processing software, incorporation of new physical models and generalization of the multiblock capability. The final report contains details of code modifications, numerical results for several nozzle and turbopump geometries, and the implementation of the parallelization software.

Dorney, Daniel J.↗

NASA NTRS2018

Performance Enhancements for the Lattice-Boltzmann Solver in the LAVA Framework

Performance enhancements in NASA's recently developed Lattice Boltzmann solver within the Launch Ascent and Vehicle Aerodynamics (LAVA) framework are presented. Two key algorithmic developments are highlighted. A coarse-fine interface treatment that discretely conserves mass and momentum has been implemented and successfully verified and validated. Code optimizations targeting improved serial and parallel performance were presented. For a simple turbulent Taylor-Green Vortex problem, we were able to demonstrate a 2.3 times speedup over the baseline code for a single Skylake-SP node containing 40 physical cores, and a 2.14 times speedup for 64 nodes containing 2560 physical cores. In addition, we were able to show that the optimizations enabled us to scale the code almost perfectly to 20480 physical cores where, including ghost cells, the problem size was 10 billion cells.

Barad, Michael↗

NASA NTRS2018

Performance Enhancements for the Lattice-Boltzmann Solver in the LAVA Framework

LAVA↗

NASA NTRS1999

Improvements to the Unstructured Mesh Generator MESH3D

The AIRPLANE process starts with an aircraft geometry stored in a CAD system. The surface is modeled with a mesh of triangles and then the flow solver produces pressures at surface points which may be integrated to find forces and moments. The biggest advantage is that the grid generation bottleneck of the CFD process is eliminated when an unstructured tetrahedral mesh is used. MESH3D is the key to turning around the first analysis of a CAD geometry in days instead of weeks. The flow solver part of AIRPLANE has proven to be robust and accurate over a decade of use at NASA. It has been extensively validated with experimental data and compares well with other Euler flow solvers. AIRPLANE has been applied to all the HSR geometries treated at Ames over the course of the HSR program in order to verify the accuracy of other flow solvers. The unstructured approach makes handling complete and complex geometries very simple because only the surface of the aircraft needs to be discretized, i.e. covered with triangles. The volume mesh is created automatically by MESH3D. AIRPLANE runs well on multiple platforms. Vectorization on the Cray Y-MP is reasonable for a code that uses indirect addressing. Massively parallel computers such as the IBM SP2, SGI Origin 2000, and the Cray T3E have been used with an MPI version of the flow solver and the code scales very well on these systems. AIRPLANE can run on a desktop computer as well. AIRPLANE has a future. The unstructured technologies developed as part of the HSR program are now targeting high Reynolds number viscous flow simulation. The pacing item in this effort is Navier-Stokes mesh generation.

Thomas, Scott D.↗

NASA NTRS2000

Forward Monte Carlo Computations of Polarized Microwave Radiation

Microwave radiative transfer computations continue to acquire greater importance as the emphasis in remote sensing shifts towards the understanding of microphysical properties of clouds and with these to better understand the non linear relation between rainfall rates and satellite-observed radiance. A first step toward realistic radiative simulations has been the introduction of techniques capable of treating 3-dimensional geometry being generated by ever more sophisticated cloud resolving models. To date, a series of numerical codes have been developed to treat spherical and randomly oriented axisymmetric particles. Backward and backward-forward Monte Carlo methods are, indeed, efficient in this field. These methods, however, cannot deal properly with oriented particles, which seem to play an important role in polarization signatures over stratiform precipitation. Moreover, beyond the polarization channel, the next generation of fully polarimetric radiometers challenges us to better understand the behavior of the last two Stokes parameters as well. In order to solve the vector radiative transfer equation, one-dimensional numerical models have been developed, These codes, unfortunately, consider the atmosphere as horizontally homogeneous with horizontally infinite plane parallel layers. The next development step for microwave radiative transfer codes must be fully polarized 3-D methods. Recently a 3-D polarized radiative transfer model based on the discrete ordinate method was presented. A forward MC code was developed that treats oriented nonspherical hydrometeors, but only for plane-parallel situations.

Battaglia, A.↗

NASA NTRS2001

Support for Debugging Automatically Parallelized Programs

This viewgraph presentation provides information on the technical aspects of debugging computer code that has been automatically converted for use in a parallel computing system. Shared memory parallelization and distributed memory parallelization entail separate and distinct challenges for a debugging program. A prototype system has been developed which integrates various tools for the debugging of automatically parallelized programs including the CAPTools Database which provides variable definition information across subroutines as well as array distribution information.

Hood, Robert↗

NASA NTRS1997

Efficient Parallel Kernel Solvers for Computational Fluid Dynamics Applications

Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be partitioned and distributed appropriately among processors to reduce communication cost and to attain load balance. More importantly, even with careful partitioning and mapping, the performance of an algorithm may still be unsatisfactory, since conventional sequential algorithms may be serial in nature and may not be implemented efficiently on parallel machines. In many cases, new algorithms have to be introduced to increase parallel performance. In order to achieve optimal performance, in addition to partitioning and mapping, a careful performance study should be conducted for a given application to find a good algorithm-machine combination. This process, however, is usually painful and elusive. The goal of this project is to design and develop efficient parallel algorithms for highly accurate Computational Fluid Dynamics (CFD) simulations and other engineering applications. The work plan is 1) developing highly accurate parallel numerical algorithms, 2) conduct preliminary testing to verify the effectiveness and potential of these algorithms, 3) incorporate newly developed algorithms into actual simulation packages. The work plan has well achieved. Two highly accurate, efficient Poisson solvers have been developed and tested based on two different approaches: (1) Adopting a mathematical geometry which has a better capacity to describe the fluid, (2) Using compact scheme to gain high order accuracy in numerical discretization. The previously developed Parallel Diagonal Dominant (PDD) algorithm and Reduced Parallel Diagonal Dominant (RPDD) algorithm have been carefully studied on different parallel platforms for different applications, and a NASA simulation code developed by Man M. Rai and his colleagues has been parallelized and implemented based on data dependency analysis. These achievements are addressed in detail in the paper.

Sun, Xian-He↗

NASA NTRS1986

Viterbi algorithm on a hypercube: Concurrent formulation

The similarity between the Fast Fourier Transform and the Viterbi algorithm is exploited to develop a Concurrent Viterbi Algorithm suitable for a multiprocessor system interconnected as a hypercube. The proposed algorithm can efficiently decode large constraint length convolutional codes, using different degrees of parallelism, and is attractive for VLSI implementation.

Pllara, F.↗

NASA NTRS1990

The nondeterministic divide

The nondeterministic divide partitions a vector into two non-empty slices by allowing the point of division to be chosen nondeterministically. Support for high-level divide-and-conquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide-and-conquer sequential algorithm on one or more vectors of the same range, whose division point for a new pair of recursive calls is chosen nondeterministically before any computation is performed and whose recursive calls are made immediately after the choice of division point; also, access to vector components is only permitted during activations in which the vector parameters have unit length. The notion of diva algorithm is formulated precisely as a diva call, a restricted call on a sequential procedure. Diva calls are proven to be intimately related to associativity. Numerous applications of diva calls are given and strategies are described for translating a diva call into code for a variety of parallel computers. Thus diva algorithms separate logical correctness concerns from implementation concerns.

Charlesworth, Arthur↗

NASA NTRS1991

Implementation of the Lanczos eigen-solver for the CSI code on high performance computers

The focus of this research is to implement a Lanczos algorithm for the Control-Structure Integration (CSI) code which can exploit both 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 of the proposed parallel-vector Lanczos algorithm is demonstrated by solving for the frequencies and mode shapes of the Phase Zero CSI model. The superior performance of the Lanczos algorithm is illustrated in tabular form.

Nguyen, Duc T.↗

NASA NTRS1992

The design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured grid Euler-solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented in order to accelerate the parallel communication rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effect of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of three performance improvement. The overall solution efficiency is compared with that obtained on the CRAY-YMP vector supercomputer.

Das, R.↗

NASA NTRS1994

A hydrodynamic approach to cosmology: The mixed dark matter cosmological scenario

We compute the evolution of spatially flat, mixed cold and hot dark matter models containing both baryonic matter and two kinds of dark matter. Hydrodynamics is treated with a highly developed Eulerian hydrodynamic code (see Cen 1992). A standard particle-mesh (PM) code is also used in parallel to calculate the motion of the dark matter components. We adopt the following parameters: h equivalent to (sub 0)/100 km/s Mpc(exp -1) = 0.5, OMEGA(sub C) = 0.3, and OMEGA(sub B) = 0.06, with amplitude of the perturbation spectrum fixed by the Cosmic Background Explorer Satellite (COBE) Dark Matter Radiation (DMR) measurements (Smoot et al. 1992) being sigma (sub 8) = 0.67. Four different boxes are simulated with box sizes of L = (64, 16, 4, 1) h(exp -1) Mpc, respectively, the two small boxes providing good resolution but little valid information due to absence of large-scale power. We use 128(exp 3) approximate 10(exp 6.3) baryonic cells, 128(exp .3) cold dark matter particles, and 2 x 128(exp 3) hot dark matter particles. In addition to the dark matter we follow separately six baryonic species (H, H(+), He, He(+), He(++), e(-)) with allowance for both (nonequilibrium) collisional and radiative ionization in every cell. The background radiation field is also followed in detail with allowance made for both continuum and line processes, to allow nonequilibrium heating and cooling processes to be followed in detail. The mean final Zeldovich-Sunyaev y parameter is estimated to be y Bar = (5.4 + or - 2.7) x 10(exp -7) below currently attainable observations, with a rms fluctuation of approximately delta bar y = (0.6 + or - 3.0) x 10(exp -7) on arcminute scales. The rate of galaxy formation peaks at an even later epoch (z approximate 0.3) than in the standard (OMEGA = 1, sigma sub 8 = 0.67) cold dark matter (CDM) model (z approximate 0.5) and, at a redshift of z = 4, is nearly a factor of 100 lower than for the CDM model with the same value of sigma sub 8. With regard to mass function, the smallest objects are stabilized against collapse by thermal energy: the mass-weighted mass spectrum has a broad peak in the vicinity of M(sub B) = 10(exp 9.5) solar mass with a reasonable fit to the Schechter luminosity function if the ratio of baryon mass to blue light is approximately 4. In addition, one very large PM simulation was made in a box with size (320 h(exp - 1) Mpc) containing 3 x 200(exp 3) = 10(exp 7.4) particles. Utilizing this simulation we find that the model yields a cluster mass function which is about a factor of 4 higher than observed, but a cluster-cluster correlation length marginally lower than observed, but that both are closer to observations than in the (COBE) normalized CDM model. The one-dimensional pairwise velocity dispersion is 605 + or - 8 km/s at 1/h separation, lower than that of the DCM model normalized to COBE, but still significant higher than observations (Davis & Peebles 1983). A plausible velocity bias b(sub v) = 0.8 + or - 0.1 on this scale will reduce but not remove the discrepancy. The velocity auto-correlat ion function has a coherence length of 40/h Mpc, which is somewhat lower than the observed counterpart. In all these respects the model would be improved by decreasing the cold fraction of the dark OMEGA(sub CDM)/ (OMEGA(sub CDM) + OMEGA(sub HDB). But formation of galaxies and clusters of galaxies is much later in this model than in COBE-normalized CDM, perhaps too late. To improve on these constraints a larger ratio of OMEGA(sub CDM)/ (OMEGA(sub CDM) + OMEGA(sub HDM)) is required than the value of 0.67 adopted here. It does not seem possible to find a value for this ratio which would satisfy all tests. Overall, the model is similar both on large and intermediate scales to the standard CDM model normalized to the same value of sigma(sub B), but the problem with regard to late formation of galaxies is more severe in this model than in that CDM model. Adding hot dark matter, significantly improves the ability of the COBE-normalized CDM scenario to fit existing observations, but the model is in fact not as good as the CDM model with the same sigma(sub 8) and is still probably unsatisfactory with regard to several critical tests.

Cen, Renyue↗

NASA NTRS1994

Design and implementation of a parallel unstructured Euler solver using software primitives

This paper is concerned with the implementation of a three-dimensional unstructured-grid Euler solver on massively parallel distributed-memory computer architectures. The goal is to minimize solution time by achieving high computational rates with a numerically efficient algorithm. An unstructured multigrid algorithm with an edge-based data structure has been adopted, and a number of optimizations have been devised and implemented to accelerate the parallel computational rates. The implementation is carried out by creating a set of software tools, which provide an interface between the parallelization issues and the sequential code, while providing a basis for future automatic run-time compilation support. Large practical unstructured grid problems are solved on the Intel iPSC/860 hypercube and Intel Touchstone Delta machine. The quantitative effects of the various optimizations are demonstrated, and we show that the combined effect of these optimizations leads to roughly a factor of 3 performance improvement. The overall solution efficiency is compared with that obtained on the Cray Y-MP vector supercomputer.

Das, R.↗