Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel efficiency”

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 829 records · Page 46

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

Thirumalainambi, Rajkumar↗

PROcess Based Diagnostics PROBE

Many of the aspects of the climate system that are of the greatest interest (e.g., the sensitivity of the system to external forcings) are emergent properties that arise via the complex interplay between disparate processes. This is also true for climate models most diagnostics are not a function of an isolated portion of source code, but rather are affected by multiple components and procedures. Thus any model-observation mismatch is hard to attribute to any specific piece of code or imperfection in a specific model assumption. An alternative approach is to identify diagnostics that are more closely tied to specific processes -- implying that if a mismatch is found, it should be much easier to identify and address specific algorithmic choices that will improve the simulation. However, this approach requires looking at model output and observational data in a more sophisticated way than the more traditional production of monthly or annual mean quantities. The data must instead be filtered in time and space for examples of the specific process being targeted.We are developing a data analysis environment called PROcess-Based Explorer (PROBE) that seeks to enable efficient and systematic computation of process-based diagnostics on very large sets of data. In this environment, investigators can define arbitrarily complex filters and then seamlessly perform computations in parallel on the filtered output from their model. The same analysis can be performed on additional related data sets (e.g., reanalyses) thereby enabling routine comparisons between model and observational data. PROBE also incorporates workflow technology to automatically update computed diagnostics for subsequent executions of a model. In this presentation, we will discuss the design and current status of PROBE as well as share results from some preliminary use cases.

PROBE↗

An efficient user-oriented method for calculating compressible flow in an about three-dimensional inlets

A panel method is used to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained rather cheaply. Geometric input is aided by an automatic generating program. A number of graphical output features are provided to aid the user, including surface streamline tracing and automatic generation of curves of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. The inlet method and use of the program are described. Illustrative results are presented.

Hess, J. L.↗

Approximation for Horizontal Photon Transport in Cloud Remote Sensing Problems

The effect of horizontal photon transport within real-world clouds can be of consequence to remote sensing problems based on plane-parallel cloud models. An analytic approximation for the root-mean-square horizontal displacement of reflected and transmitted photons relative to the incident cloud-top location is derived from random walk theory. The resulting formula is a function of the average number of photon scatterings, and particle asymmetry parameter and single scattering albedo. In turn, the average number of scatterings can be determined from efficient adding/doubling radiative transfer procedures. The approximation is applied to liquid water clouds for typical remote sensing solar spectral bands, involving both conservative and non-conservative scattering. Results compare well with Monte Carlo calculations. Though the emphasis is on horizontal photon transport in terrestrial clouds, the derived approximation is applicable to any multiple scattering plane-parallel radiative transfer problem. The complete horizontal transport probability distribution can be described with an analytic distribution specified by the root-mean-square and average displacement values. However, it is shown empirically that the average displacement can be reasonably inferred from the root-mean-square value. An estimate for the horizontal transport distribution can then be made from the root-mean-square photon displacement alone.

Plantnick, Steven↗

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗

Large area CCD image sensors for scientific applications

The designs of the 512 x 512 pixel and 2048 x 2048 pixel CCD sensors developed for scientific imaging are described. Both sensors are manufactured using the three phase, three level polysilicon gate technology, and the architecture of the chips is series-parallel-series. The components of the two different on-chip amplifiers are examined. The sensors are thinned and operated in the back side illumination mode to ensure the highest quantum efficiency. The performances of a number of front side illuminated devices and two thinned rear illuminated chips are evaluated. It is observed that the sensors equal or exceed their proposed charge transfer efficiency of 0.99999, the noise level of 2 e- and 20 e- at 50 kp/s, the quantum efficiency of 40 percent at 400 microns and 70 percent at 700 microns, and of the well capacity of greater than 500 ke-/pixel.

Blouke, M. M.↗

A message passing kernel for the hypercluster parallel processing test bed

A Message-Passing Kernel (MPK) for the Hypercluster parallel-processing test bed is described. The Hypercluster is being developed at the NASA Lewis Research Center to support investigations of parallel algorithms and architectures for computational fluid and structural mechanics applications. The Hypercluster resembles the hypercube architecture except that each node consists of multiple processors communicating through shared memory. The MPK efficiently routes information through the Hypercluster, using a message-passing protocol when necessary and faster shared-memory communication whenever possible. The MPK also interfaces all of the processors with the Hypercluster operating system (HYCLOPS), which runs on a Front-End Processor (FEP). This approach distributes many of the I/O tasks to the Hypercluster processors and eliminates the need for a separate I/O support program on the FEP.

Blech, Richard A.↗

Large-Constraint-Length, Fast Viterbi Decoder

Scheme for efficient interconnection makes VLSI design feasible. Concept for fast Viterbi decoder provides for processing of convolutional codes of constraint length K up to 15 and rates of 1/2 to 1/6. Fully parallel (but bit-serial) architecture developed for decoder of K = 7 implemented in single dedicated VLSI circuit chip. Contains six major functional blocks. VLSI circuits perform branch metric computations, add-compare-select operations, and then store decisions in traceback memory. Traceback processor reads appropriate memory locations and puts out decoded bits. Used as building block for decoders of larger K.

Collins, O.↗

Gigaflop performance on a CRAY-2: Multitasking a computational fluid dynamics application

The methodology is described for converting a large, long-running applications code that executed on a single processor of a CRAY-2 supercomputer to a version that executed efficiently on multiple processors. Although the conversion of every application is different, a discussion of the types of modification used to achieve gigaflop performance is included to assist others in the parallelization of applications for CRAY computers, especially those that were developed for other computers. An existing application, from the discipline of computational fluid dynamics, that had utilized over 2000 hrs of CPU time on CRAY-2 during the previous year was chosen as a test case to study the effectiveness of multitasking on a CRAY-2. The nature of dominant calculations within the application indicated that a sustained computational rate of 1 billion floating-point operations per second, or 1 gigaflop, might be achieved. The code was first analyzed and modified for optimal performance on a single processor in a batch environment. After optimal performance on a single CPU was achieved, the code was modified to use multiple processors in a dedicated environment. The results of these two efforts were merged into a single code that had a sustained computational rate of over 1 gigaflop on a CRAY-2. Timings and analysis of performance are given for both single- and multiple-processor runs.

Tennille, Geoffrey M.↗

Bounce-averaged Hamiltonian for charged particles in an axisymmetric but nondipolar model magnetosphere

In order to facilitate bounce-averaged guiding center simulations of geomagnetically trapped particles, we express the kinetic energy of a particle with magnetic coordinates (L,phi) as an analytic function of the first two adiabatic invariants (M,J) and the L value of the field line. The magnetic field model is axisymmetric, consisting of a dipolar vector-B field plus a uniform southward magnetic field parallel to the dipole moment mu(sub E). This model magnetosphere is surrounded by a circular equatorial neutral line whose radius b is an adjustable parameter. Our formulation provides a computationally efficient method for tracing the bounce-averaged adiabatic motion (conserving all three invariants) and nonadiabatic transport (violating the third invariant while conserving the first two invariants) of geomagnetically trapped particles in the model magnetosphere.

Schulz, Michael↗

A Quasi-3-D Theory for Impedance Eduction in Uniform Grazing Flow

A 2-D impedance eduction methodology is extended to quasi-3-D sound fields in uniform or shearing mean flow. We introduce a nonlocal, nonreflecting boundary condition to terminate the duct and then educe the impedance by minimizing an objective function. The introduction of a parallel, sparse, equation solver significantly reduces the wall clock time for educing the impedance when compared to that of the sequential band solver used in the 2-D methodology. The accuracy, efficiency, and robustness of the methodology is demonstrated using two examples. In the first example, we show that the method reproduces the known impedance of a ceramic tubular test liner. In the second example, we illustrate that the approach educes the impedance of a four-segment liner where the first, second, and fourth segments consist of a perforated face sheet bonded to honeycomb, and the third segment is a cut from the ceramic tubular test liner. The ability of the method to educe the impedances of multisegmented liners has the potential to significantly reduce the amount of time and cost required to determine the impedance of several uniform liners by allowing them to be placed in series in the test section and to educe the impedance of each segment using a single numerical experiment. Finally, we probe the objective function in great detail and show that it contains a single minimum. Thus, our objective function is ideal for use with local, inexpensive, gradient-based optimizers.

Watson, W. R.↗

Sub-kW Class Hall-Effect Thruster Power Processing Unit for Wide Output Range Applications

The National Aeronautics and Space Administration (NASA) Small Spacecraft Electric Propulsion (SSEP) project is maturing high-propellant throughput sub-kilowatt Hall-effect thruster technologies to enable small spacecraft deep space science and exploration missions with high delta-v requirements. In support of this effort, development of a power processing unit (PPU) capable of providing discharge power of up to 1 kW continues to be pursued at the NASA Glenn Research Center (GRC). Previous reported work included a successful integrated test of a scalable, modular breadboard discharge power supply with the NASA-H64M laboratory model Hall-effect thruster and presentation of notional designs for the various auxiliary power supplies needed for thruster operation. Since that time, auxiliary power supply designs have been completed and fabricated, with the cathode heater and keeper power supplies being successfully tested with a hollow cathode assembly (HCA) in the NASA GRC Vacuum Facility 56 (VF-56). The desire for a lower mass, higher efficiency, and more versatile PPU to maximize performance of power and mass-limited small spacecraft has led to the exploration of a discharge power supply based on a series-parallel (LCC) resonant topology. This topology has enabled the discharge power supply to operate over a wider output range at switching frequencies 4-5 times higher than previous design iterations. Simulation models of the topology have been developed and a breadboard of the topology has been fabricated and evaluated on both resistive loads and an integrated Hall thruster test. This paper will present collected performance and integrated test data from both the fabricated auxiliary and resonant discharge power supplies. Advantages of the resonant converter architecture over more traditional pulse-width modulated (PWM) techniques in Hall-effect thruster discharge power supply applications will also be described.

electric propulsion↗

Sub-kW Class Hall-Effect Thruster Power Processing Unit for Wide Output Range Applications

The National Aeronautics and Space Administration (NASA) Small Spacecraft Electric Propulsion (SSEP) project is maturing high-propellant throughput sub-kilowatt Hall-effect thruster technologies to enable small spacecraft deep space science and exploration missions with high delta-v requirements. In support of this effort, development of a power processing unit (PPU) capable of providing discharge power of up to 1 kW continues to be pursued at the NASA Glenn Research Center (GRC). Previous reported work included a successful integrated test of a scalable, modular breadboard discharge power supply with the NASA-H64M laboratory model Hall-effect thruster and presentation of notional designs for the various auxiliary power supplies needed for thruster operation. Since that time, auxiliary power supply designs have been completed and fabricated, with the cathode heater and keeper power supplies being successfully tested with a hollow cathode assembly (HCA) in the NASA GRC Vacuum Facility 56 (VF-56). The desire for a lower mass, higher efficiency, and more versatile PPU to maximize performance of power and mass-limited small spacecraft has led to the exploration of a discharge power supply based on a series-parallel (LCC) resonant topology. This topology has enabled the discharge power supply to operate over a wider output range at switching frequencies 4-5 times higher than previous design iterations. Simulation models of the topology have been developed and a breadboard of the topology has been fabricated and evaluated on both resistive loads and an integrated Hall thruster test. This paper will present collected performance and integrated test data from both the fabricated auxiliary and resonant discharge power supplies. Advantages of the resonant converter architecture over more traditional pulse-width modulated (PWM) techniques in Hall-effect thruster discharge power supply applications will also be described.

electric propulsion↗

Hierarchical Image Segmentation of Remotely Sensed Data using Massively Parallel GNU-LINUX Software

A hierarchical set of image segmentations is a set of several image segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. In [1], Tilton, et a1 describes an approach for producing hierarchical segmentations (called HSEG) and gave a progress report on exploiting these hierarchical segmentations for image information mining. The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HSWO) approach to region growing, which was described as early as 1989 by Beaulieu and Goldberg. The HSWO approach seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing (e.g. Horowitz and T. Pavlidis, [3]). In addition, HSEG optionally interjects between HSWO region growing iterations, merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the utility of the segmentation results, especially for larger images, it also significantly increases HSEG s computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) was devised, which includes special code to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. The recursive nature of RHSEG makes for a straightforward parallel implementation. This paper describes the HSEG algorithm, its recursive formulation (referred to as RHSEG), and the implementation of RHSEG using massively parallel GNU-LINUX software. Results with Landsat TM data are included comparing RHSEG with classic region growing.

Tilton, James C.↗

Highly Efficient Vector-Inversion Pulse Generators

Improved transmission-line pulse generators of the vector-inversion type are being developed as lightweight sources of pulsed high voltage for diverse applications, including spacecraft thrusters, portable x-ray imaging systems, impulse radar systems, and corona-discharge systems for sterilizing gases. In this development, more than the customary attention is paid to principles of operation and details of construction so as to the maximize the efficiency of the pulse-generation process while minimizing the sizes of components. An important element of this approach is segmenting a pulse generator in such a manner that the electric field in each segment is always below the threshold for electrical breakdown. One design of particular interest, a complete description of which was not available at the time of writing this article, involves two parallel-plate transmission lines that are wound on a mandrel, share a common conductor, and are switched in such a manner that the pulse generator is divided into a "fast" and a "slow" section. A major innovation in this design is the addition of ferrite to the "slow" section to reduce the size of the mandrel needed for a given efficiency.

Rose, Franklin↗

An efficient user-oriented method for calculating compressible flow about three-dimensional inlets

This method uses a so-called panel method to calculate incompressible flow about arbitrary three-dimensional inlets with or without centerbodies for four fundamental flow conditions: unit onset flows parallel to each of the coordinate axes plus static operation. The computing time is scarcely longer than for a single solution. A linear superposition of these solutions quite rigorously gives incompressible flow about the inlet for any angle of attack, angle of yaw, and mass flow rate. Compressibility is accounted for by applying a well-proven correction to the incompressible flow. Since the computing times for the combination and the compressibility correction are small, flows at a large number of inlet operating conditions are obtained very cheaply. A number of graphical output features are provided to aid the user, including streamline tracing and automatic generation of curves of constant pressure, Mach number, and flow inclination at selected inlet cross sections. This paper describes the method in some detail and presents calculated results.

Hess, J. L.↗

On computational methods for crashworthiness

The evolution of computational methods for crashworthiness and related fields is described and linked with the decreasing cost of computational resources and with improvements in computation methodologies. The latter includes more effective time integration procedures and more efficient elements. Some recent developments in methodologies and future trends are also summarized. These include multi-time step integration (or subcycling), further improvements in elements, adaptive meshes, and the exploitation of parallel computers.

Belytschko, T.↗

Particle-in-cell simulations of the critical ionization velocity effect in finite size clouds

The critical ionization velocity (CIV) mechanism in a finite size cloud is studied with a series of electrostatic particle-in-cell simulations. It is observed that an initial seed ionization, produced by non-CIV mechanisms, generates a cross-field ion beam which excites a modified beam-plasma instability (MBPI) with frequency in the range of the lower hybrid frequency. The excited waves accelerate electrons along the magnetic field up to the ion drift energy that exceeds the ionization energy of the neutral atoms. The heated electrons in turn enhance the ion beam by electron-neutral impact ionization, which establishes a positive feedback loop in maintaining the CIV process. It is also found that the efficiency of the CIV mechanism depends on the finite size of the gas cloud in the following ways: (1) Along the ambient magnetic field the finite size of the cloud, L (sub parallel), restricts the growth of the fastest growing mode, with a wavelength lambda (sub m parallel), of the MBPI. The parallel electron heating at wave saturation scales approximately as (L (sub parallel)/lambda (sub m parallel)) (exp 1/2); (2) Momentum coupling between the cloud and the ambient plasma via the Alfven waves occurs as a result of the finite size of the cloud in the direction perpendicular to both the ambient magnetic field and the neutral drift. This reduces exponentially with time the relative drift between the ambient plasma and the neutrals. The timescale is inversely proportional to the Alfven velocity. (3) The transvers e charge separation field across the cloud was found to result in the modulation of the beam velocity which reduces the parallel heating of electrons and increases the transverse acceleration of electrons. (4) Some energetic electrons are lost from the cloud along the magnetic field at a rate characterized by the acoustic velocity, instead of the electron thermal velocity. The loss of energetic electrons from the cloud seems to be larger in the direction of plasma drift relative to the neutrals, where the loss rate is characterized by the neutral drift velocity. It is also shown that a factor of 4 increase in the ambient plasma density, increases the CIV ionization yield by almost 2 orders of magnitude at the end of a typical run. It is concluded that a larger ambient plasma density can result in a larger CIV yield because of (1) larger seed ion production by non-CIV mechanisms, (2) smaller Alfven velocity and hence weak momentum coupling, and (3) smaller ratio of the ion beam density to the ambient ion density, and therefore a weaker modulation of the beam velocity. The simulation results are used to interpret various chemical release experiments in space.

Moghaddam-Taaheri, E.↗