Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel algorithm”

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 1,279 records · Page 71

Profiles of electrified drops and bubbles

Axisymmetric equilibrium shapes of conducting drops and bubbles, (1) pendant or sessile on one face of a circular parallel-plate capacitor or (2) free and surface-charged, are found by solving simultaneously the free boundary problem consisting of the augmented Young-Laplace equation for surface shape and the Laplace equation for electrostatic field, given the surface potential. The problem is nonlinear and the method is a finite element algorithm employing Newton iteration, a modified frontal solver, and triangular as well as quadrilateral tessellations of the domain exterior to the drop in order to facilitate refined analysis of sharply curved drop tips seen in experiments. The stability limit predicted by this computer-aided theoretical analysis agrees well with experiments.

Basaran, O. A.↗

Controls-structures-interaction dynamics during RCS control of the Orbiter/SRMS/SSF configuration

During the assembly flights of the Space Station Freedom (SSF), the Orbiter will either dock with the SSF and retract to the final berthed position, or will grapple the SSF using the Shuttle Remote Manipulator System (SRMS) and maneuver the SRMS coupled vehicles to their final berthed position. The SRMS method is expected to take approximately one to one and a half hours to complete and require periodic attitude corrections by either the Orbiter or the SSF reaction control system (RCS) or continuous control by a control moment gyro (CMG) system with RCS desaturation as required. Free drift of the attached vehicles is not currently thought to be acceptable because the desired system attitude will quickly deteriorate due to unbalanced gravity gradient and aerodynamic torques resulting in power generation problems, thermodynamic control problems, and communications problems. This paper deals with the simulation and control of the SRMS during trunnion/latch interaction dynamics and during RCS maneuvers. The SRMS servo drive joints have highly non-linear elastic characteristics which tend to degrade sensitive control strategies. In addition the system natural frequencies are extremely low and depend on the drive joint deflections and SRMS geometric position. The lowest mean period of oscillation for the Orbiter/SRMS/SSF(MB6) system in brakes hold mode positioned near the final berthed position is approximately 120 seconds. A detailed finite element model of the SRMS has been developed and used in a newly developed SRMS systems dynamics simulation to investigate the non-linear transient response dynamics of the Orbiter/SRMS/SSF systems. The present SRMS control strategy of brakes only recommended by the Charles Draper Labs is contrasted with a robust controller developed by the authors. The robust controller uses an optimal inear quadratic regulator (LQR) to optimally place the closed-loop poles of a multivariable continuous-time system within the common region of an open sector with the sector angle plus or minus 45 degrees from the negative real axis, and the left-hand side of a parallel to the imaginary axis in the complex s-plane. This guarantees that the critical damping ratio for the desired control modes is equal to or in excess of 0.707. The matrix sign function is used for solving the Riccati equations which appear in the controller design procedure. Fast and stable algorithms have recently been developed for the computation of the matrix sign function. Simulation results are given which demonstrate the potential CSI involvement for the current SRMS control system and the proposed control system.

Schliesing, J. A.↗

Subgrid Combustion Modeling for the Next Generation National Combustion Code

In the first year of this research, a subgrid turbulent mixing and combustion methodology developed earlier at Georgia Tech has been provided to researchers at NASA/GRC for incorporation into the next generation National Combustion Code (called NCCLES hereafter). A key feature of this approach is that scalar mixing and combustion processes are simulated within the LES grid using a stochastic 1D model. The subgrid simulation approach recovers locally molecular diffusion and reaction kinetics exactly without requiring closure and thus, provides an attractive feature to simulate complex, highly turbulent reacting flows of interest. Data acquisition algorithms and statistical analysis strategies and routines to analyze NCCLES results have also been provided to NASA/GRC. The overall goal of this research is to systematically develop and implement LES capability into the current NCC. For this purpose, issues regarding initialization and running LES are also addressed in the collaborative effort. In parallel to this technology transfer effort (that is continuously on going), research has also been underway at Georgia Tech to enhance the LES capability to tackle more complex flows. In particular, subgrid scalar mixing and combustion method has been evaluated in three distinctly different flow field in order to demonstrate its generality: (a) Flame-Turbulence Interactions using premixed combustion, (b) Spatially evolving supersonic mixing layers, and (c) Temporal single and two-phase mixing layers. The configurations chosen are such that they can be implemented in NCCLES and used to evaluate the ability of the new code. Future development and validation will be in spray combustion in gas turbine engine and supersonic scalar mixing.

Menon, Suresh↗

Cloud Thermodynamic Phase Detection with Polarimetrically Sensitive Passive Sky Radiometers

The primary goal of this project has been to investigate if ground-based visible and near-infrared passive radiometers that have polarization sensitivity can determine the thermodynamic phase of overlying clouds, i.e. if they are comprised of liquid droplets or ice particles. While this knowledge is important by itself for our understanding of the global climate, it can also help improve cloud property retrieval algorithms that use total (unpolarized) radiance to determine Cloud Optical Depth (COD). This is a potentially unexploited capability of some instruments in the NASA Aerosol Robotic Network (AERONET), which, if practical, could expand the products of that global instrument network at minimal additional cost. We performed simulations that found, for zenith observations, cloud thermodynamic phase is often expressed in the sign of the Q component of the Stokes polarization vector. We chose our reference frame as the plane containing solar and observation vectors, so the sign of Q indicates the polarization direction, parallel (negative) or perpendicular (positive) to that plane. Since the quantity of polarization is inversely proportional to COD, optically thin clouds are most likely to create a signal greater than instrument noise. Besides COD and instrument accuracy, other important factors for the determination of cloud thermodynamic phase are the solar and observation geometry (scattering angles between 40 and 60 degrees are best), and the properties of ice particles (pristine particles may have halos or other features that make them difficult to distinguish from water droplets at specific scattering angles, while extreme ice crystal aspect ratios polarize more than compact particles). We tested the conclusions of our simulations using data from polarimetrically sensitive versions of the Cimel 318 sun photometerradiometer that comprise AERONET. Most algorithms that exploit Cimel polarized observations use the Degree of Linear Polarization (DoLP), not the individual Stokes vector elements (such as Q). For this reason, we had no information about the accuracy of Cimel observed Q and the potential for cloud phase determination. Indeed, comparisons to ceilometer observations with a single polarized spectral channel version of the Cimel at a site in the Netherlands showed little correlation. Comparisons to Lidar observations with a more recently developed, multi-wavelength polarized Cimel in Maryland, USA, show more promise. This divergence between simulations and observations has prompted us to begin the development of a small test instrument called the Sky Polarization Radiometric Instrument for Test and Evaluation (SPRITE). This instrument is specifically devoted to the accurate observation of Q, and the testing of calibration and uncertainty assessment techniques, with the ultimate goal of understanding the practical feasibility of these measurements.

Knobelspiesse, Kirk D.↗

A tool for interactive exploration of a hierarchical segmentation

Hierarchical segmentation is discussed as a form of region growing in which the sequence of merges is controlled by a 'best merge first' principle, and a record of the region merging sequence is often retained for later analysis. In the author's massively parallel implementation of hierarchical segmentation, which he calls iterative parallel region growing (IPRG), a set of directional edge maps are used to store the region merging sequence information. An iteractive tool is described that allows an analyst to fully explore a hierarchical segmentation, potentially producing an image segmentation that is a combination of segmentations produced at several different iterations of the IPRG algorithm. A potential method for automatically producing such segmentations is also discussed.

Tilton, James C.↗

Extended ecosystem signatures with application to Eos synergism requirements

The primary objective is to define the advantages of synergistically combining optical and microwave remote sensing measurements for the determination of biophysical properties important in ecosystem modeling. This objective was approached in a stepwise fashion starting with ground-based observations of controlled agricultural and orchard canopies and progressing to airborne observations of more natural forest ecosystems. This observational program is complemented by a parallel effort to model the visible reflectance and microwave scattering properties of composite vegetation canopies. The goals of the modeling studies are to verify our basic understanding of the sensor-scene interaction physics and to provide the basis for development of inverse models optimized for retrieval of key biophysical properties. These retrieval algorithms can then be used to simulate the expected performance of various aspects of Eos including the need for simultaneous SAR and HIRIS observations or justification for other (non-synchronous) relative timing constraints and the frequency, polarization, and angle of incidence requirements for accurate biophysical parameter extractions. This program completed a very successful series of truck-mounted experiments, made remarkable progress in development and validation of optical reflectance and microwave scattering models for vegetation, extended the scattering models to accommodate discontinuous and periodic canopies, developed inversion approaches for surface and canopy properties, and disseminated these results widely through symposia and journal publications. In addition, the third generation of the computer code for the microwave scattering models was provided to a number of other US, Canadian, Australian, and European investigators who are currently presenting and publishing results using the MIMICS research code.

Ulaby, Fawwaz T.↗

Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. For systems that are ill-conditioned, it is often necessary to use a preconditioning technique. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and ILU(O) preconditioned CG (PCG) using different programming paradigms and architectures. Results show that for this class of applications: ordering significantly improves overall performance on both distributed and distributed shared-memory systems, that cache reuse may be more important than reducing communication, that it is possible to achieve message-passing performance using shared-memory constructs through careful data ordering and distribution, and that a hybrid MPI+OpenMP paradigm increases programming complexity with little performance gains. A implementation of CG on the Cray MTA does not require special ordering or partitioning to obtain high efficiency and scalability, giving it a distinct advantage for adaptive applications; however, it shows limited scalability for PCG due to a lack of thread level parallelism.

Oliker, Leonid↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

Numerical study of supersonic combustors by multi-block grids with mismatched interfaces

A three dimensional, finite rate chemistry, Navier-Stokes code was extended to a multi-block code with mismatched interface for practical calculations of supersonic combustors. To ensure global conservation, a conservative algorithm was used for the treatment of mismatched interfaces. The extended code was checked against one test case, i.e., a generic supersonic combustor with transverse fuel injection, examining solution accuracy, convergence, and local mass flux error. After testing, the code was used to simulate the chemically reacting flow fields in a scramjet combustor with parallel fuel injectors (unswept and swept ramps). Computational results were compared with experimental shadowgraph and pressure measurements. Fuel-air mixing characteristics of the unswept and swept ramps were compared and investigated.

Moon, Young J.↗

Numerical study of supersonic combustors by multi-block grids with mismatched interfaces

A three-dimensional, finite-rate chemistry, Navier-Stokes code has been extended to a multi-block with mismatched interface code for practical calculations of supersonic combustors. To ensure global conservation, a conservative algorithm was used for the treatment of mismatched interfaces. The extended code was checked against one test case, i.e., a generic supersonic combustor with transverse fuel injection, examining solution accuracy, convergence, and local mass flux error. After testing, the code was used to simulate the chemically reacting flow fields in a scramjet combustor with parallel fuel injectors (unswept and swept ramps). Computational results were compared with experimental shadowgraph and pressure measurements. Fuel-air mixing characteristics of the unswept and swept ramps were compared and investigated.

Moon, Young J.↗

A Lagrange multiplier based divide and conquer finite element algorithm

A novel domain decomposition method based on a hybrid variational principle is presented. Prior to any computation, a given finite element mesh is torn into a set of totally disconnected submeshes. First, an incomplete solution is computed in each subdomain. Next, the compatibility of the displacement field at the interface nodes is enforced via discrete, polynomial and/or piecewise polynomial Lagrange multipliers. In the static case, each floating subdomain induces a local singularity that is resolved very efficiently. The interface problem associated with this domain decomposition method is, in general, indefinite and of variable size. A dedicated conjugate projected gradient algorithm is developed for solving the latter problem when it is not feasible to explicitly assemble the interface operator. When implemented on local memory multiprocessors, the proposed methodology requires less interprocessor communication than the classical method of substructuring. It is also suitable for parallel/vector computers with shared memory and compares favorably with factorization based parallel direct methods.

Farhat, C.↗

Evolutionary Computational Methods for Identifying Emergent Behavior in Autonomous Systems

A technique based on Evolutionary Computational Methods (ECMs) was developed that allows for the automated optimization of complex computationally modeled systems, such as autonomous systems. The primary technology, which enables the ECM to find optimal solutions in complex search spaces, derives from evolutionary algorithms such as the genetic algorithm and differential evolution. These methods are based on biological processes, particularly genetics, and define an iterative process that evolves parameter sets into an optimum. Evolutionary computation is a method that operates on a population of existing computational-based engineering models (or simulators) and competes them using biologically inspired genetic operators on large parallel cluster computers. The result is the ability to automatically find design optimizations and trades, and thereby greatly amplify the role of the system engineer.

Terrile, Richard J.↗

A Data Exploration Tool for Large Sets of Spectra

We present an exploration tool for very large spectrum data sets such as the SDSS (Sloan Digital Sky Survey), LAMOST (Large Sky Area Multi-Object Fiber Spectroscopic Telescope), and 4MOST (4-meter Multi-Object Spectroscopic Telescope) data sets. The tool works in two stages: the first uses batch processing and the second runs interactively. The latter employs the NASA hyperwall, a configuration of 128 workstation displays (8 by 16 array) controlled by a parallelized software suite running on NASA's Pleiades supercomputer. The stellar subset of the Sloan Digital Sky Survey, DR10, was chosen to show how the our tool may be used. In stage one, SDSS files for 569,740 stars are processed through our data pipeline. The pipeline fits each spectrum using an iterative continuum algorithm, distinguishing emission from absorption and handling molecular absorption bands correctly. It then measures 1659 discrete atomic and molecular spectral features that were carefully preselected based on their likelihood of being visible at some spectral type. The depths relative to the local continuum at each feature wavelength are determined for each spectrum: these depths, the local S/N (signal to noise ratio) level, and DR10-supplied variables such as magnitudes, colors, positions, and radial velocities are the basic measured quantities used on the hyperwall. In stage two, each hyperwall panel is used to display a 2-D scatter plot showing the depth of feature A vs the depth of feature B for all of the stars. A and B change from panel to panel. The relationships between the various (A,B) strengths and any distinctive clustering are immediately apparent when examining and inter-comparing the different panels on the hyperwall. The interactive software allows the user to select the stars in any interesting region of any 2-D plot on the hyperwall, immediately rendering the same stars on all the other 2-D plots in a unique color. The process may be repeated multiple times, each selection displaying a distinctive color on all the plots. At any time, the spectra of the selected stars may be examined in detail on a connected workstation display. We illustrate how our approach allows us to quickly isolate and examine such interesting stellar subsets as EMP (Extremely Metal‐Poor) stars, CV (Cataclymic Variable) stars and C (Carbon)-rich stars.

Data Exploration↗

Partitioning of unstructured problems for parallel processing

Many large-scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. The question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory is addressed. A graph theoretical framework for these problems is established. Based on this framework three decomposition algorithms are introduced. In particular a new decomposition algorithm is discussed, which is based on the computation of an eigenvector of the Laplacian matrix associated with the graph. Numerical comparisons on large-scale two- and three-dimensional problems demonstrate the superiority of the new spectral bisection algorithm.

Simon, H. D.↗

The application of compiler-assisted multiple instruction retry to VLIW architectures

Very Long Instruction Word (VLIW) architectures enhance performance by exploiting fine-grained instruction level parallelism. We describe the development of two compiler assisted multiple instruction word retry schemes for VLIW architectures. The first scheme utilizes the compiler techniques previously developed for processors with single functional units. A compiler generated hazard-free code with different degrees of rollback capability for uniprocessors is compacted by a modified VLIW trace scheduling algorithm. Nops are then inserted in the scheduled code words to resolve data hazards for VLIW architectures. Performance is compared under three parameters: the rollback distance for uni-processors; the number of functional units; and the rollback distance for VLIW architectures. The second scheme employs a hardware read buffer to resolve frequently occurring data hazards, and utilizes the compiler to resolve the remaining hazards. Performance results are shown for six benchmark programs.

Chen, Shyh-Kwei↗

Automated Vectorization of Decision-Based Algorithms

Virtually all existing vectorization algorithms are designed to only analyze the numeric properties of an algorithm and distribute those elements across multiple processors. This advances the state of the practice because it is the only known system, at the time of this reporting, that takes high-level statements and analyzes them for their decision properties and converts them to a form that allows them to automatically be executed in parallel. The software takes a high-level source program that describes a complex decision- based condition and rewrites it as a disjunctive set of component Boolean relations that can then be executed in parallel. This is important because parallel architectures are becoming more commonplace in conventional systems and they have always been present in NASA flight systems. This technology allows one to take existing condition-based code and automatically vectorize it so it naturally decomposes across parallel architectures.

James, Mark↗

Programmable Remapper with Single Flow Architecture

An apparatus for image processing comprising a camera for receiving an original visual image and transforming the original visual image into an analog image, a first converter for transforming the analog image of the camera to a digital image, a processor having a single flow architecture for receiving the digital image and producing, with a single algorithm, an output image, a second converter for transforming the digital image of the processor to an analog image, and a viewer for receiving the analog image, transforming the analog image into a transformed visual image for observing the transformations applied to the original visual image. The processor comprises one or more subprocessors for the parallel reception of a digital image for producing an output matrix of the transformed visual image. More particularly, the processor comprises a plurality of subprocessors for receiving in parallel and transforming the digital image for producing a matrix of the transformed visual image, and an output interface means for receiving the respective portions of the transformed visual image from the respective subprocessor for producing an output matrix of the transformed visual image.

Fisher, Timothy E.↗

A New Code SORD for Simulation of Polarized Light Scattering in the Earth Atmosphere

We report a new publicly available radiative transfer (RT) code for numerical simulation of polarized light scattering in plane-parallel atmosphere of the Earth. Using 44 benchmark tests, we prove high accuracy of the new RT code, SORD (Successive ORDers of scattering). We describe capabilities of SORD and show run time for each test on two different machines. At present, SORD is supposed to work as part of the Aerosol Robotic NETwork (AERONET) inversion algorithm. For natural integration with the AERONET software, SORD is coded in Fortran 90/95. The code is available by email request from the corresponding (first) author or from ftp://climate1.gsfc.nasa.gov/skorkin/SORD/.

AERONET↗