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 757 records · Page 42

Implementing Connected Component Labeling as a User Defined Operator for SciDB

We have implemented a flexible User Defined Operator (UDO) for labeling connected components of a binary mask expressed as an array in SciDB, a parallel distributed database management system based on the array data model. This UDO is able to process very large multidimensional arrays by exploiting SciDB's memory management mechanism that efficiently manipulates arrays whose memory requirements far exceed available physical memory. The UDO takes as primary inputs a binary mask array and a binary stencil array that specifies the connectivity of a given cell to its neighbors. The UDO returns an array of the same shape as the input mask array with each foreground cell containing the label of the component it belongs to. By default, dimensions are treated as non-periodic, but the UDO also accepts optional input parameters to specify periodicity in any of the array dimensions. The UDO requires four stages to completely label connected components. In the first stage, labels are computed for each subarray or chunk of the mask array in parallel across SciDB instances using the weighted quick union (WQU) with half-path compression algorithm. In the second stage, labels around chunk boundaries from the first stage are stored in a temporary SciDB array that is then replicated across all SciDB instances. Equivalences are resolved by again applying the WQU algorithm to these boundary labels. In the third stage, relabeling is done for each chunk using the resolved equivalences. In the fourth stage, the resolved labels, which so far are "flattened" coordinates of the original binary mask array, are renamed with sequential integers for legibility. The UDO is demonstrated on a 3-D mask of O(1011) elements, with O(108) foreground cells and O(106) connected components. The operator completes in 19 minutes using 84 SciDB instances.

UDO↗

Decision-Tree Formulation With Order-1 Lateral Execution

A compact symbolic formulation enables mapping of an arbitrarily complex decision tree of a certain type into a highly computationally efficient multidimensional software object. The type of decision trees to which this formulation applies is that known in the art as the Boolean class of balanced decision trees. Parallel lateral slices of an object created by means of this formulation can be executed in constant time considerably less time than would otherwise be required. Decision trees of various forms are incorporated into almost all large software systems. A decision tree is a way of hierarchically solving a problem, proceeding through a set of true/false responses to a conclusion. By definition, a decision tree has a tree-like structure, wherein each internal node denotes a test on an attribute, each branch from an internal node represents an outcome of a test, and leaf nodes represent classes or class distributions that, in turn represent possible conclusions. The drawback of decision trees is that execution of them can be computationally expensive (and, hence, time-consuming) because each non-leaf node must be examined to determine whether to progress deeper into a tree structure or to examine an alternative. The present formulation was conceived as an efficient means of representing a decision tree and executing it in as little time as possible. The formulation involves the use of a set of symbolic algorithms to transform a decision tree into a multi-dimensional object, the rank of which equals the number of lateral non-leaf nodes. The tree can then be executed in constant time by means of an order-one table lookup. The sequence of operations performed by the algorithms is summarized as follows: 1. Determination of whether the tree under consideration can be encoded by means of this formulation. 2. Extraction of decision variables. 3. Symbolic optimization of the decision tree to minimize its form. 4. Expansion and transformation of all nested conjunctive-disjunctive paths to a flattened conjunctive form composed only of equality checks when possible. If each reduced conjunctive form contains only equality checks and all of these forms use the same variables, then the decision tree can be reduced to an order-one operation through a table lookup. The speedup to order one is accomplished by distributing each decision variable over a surface of a multidimensional object by mapping the equality constant to an index

James, Mark↗

Efficiency Calculations For a Magnetic Refrigerator Operating Between 2K and 10K

An adiabatic demagnetization refrigerator (ADR) is being developed at NASA-Ames Research Center. The ADR will operate between 2 K and 10 K and will provide 50 mW of cooling at 2 K. The refrigerant in the ADR is Gadolinium Gallium Garnet (GGG). Absorption of heat at 2 K and heat rejection at 10 K in this fully static refrigerator is made possible by the incorporation of 2 K and 10 K heat switches. Physical layout and experimental results are presented in a parallel paper. The present paper discusses the thermal losses associated with components of the ADR as they occur in various parts of the refrigeration cycle. The results are summarized in terms of a prediction for the ADR efficiency.

Helvensteijn, Ben P. M.↗

Silicon-controlled-rectifier square-wave inverter with protection against commutation failure

The square-wave SCR inverter that was designed, built, and tested includes a circuit to turn off the inverter in case of commutation failure. The basic power stage is a complementary impulse-commutated parallel inverter consisting of only six components. The 400-watt breadboard was tested while operating at + or - 28 volts, and it had a peak efficiency of 95.5 percent at 60 hertz and 91.7 percent at 400 hertz. The voltage regulation for a fixed input was 3 percent at 60 hertz. An analysis of the operation and design information is included.

Birchenough, A. G.↗

Numerical simulations of aerodynamic contribution of flows about a space-plane-type configuration

The slightly supersonic viscous flow about the space-plane under development at the National Aerospace Laboratory (NAL) in Japan was simulated numerically using the LU-ADI algorithm. The wind-tunnel testing for the same plane also was conducted with the computations in parallel. The main purpose of the simulation is to capture the phenomena which have a great deal of influence to the aerodynamic force and efficiency but is difficult to capture by experiments. It includes more accurate representation of vortical flows with high angles of attack of an aircraft. The space-plane shape geometry simulated is the simplified model of the real space-plane, which is a combination of a flat and slender body and a double-delta type wing. The comparison between experimental results and numerical ones will be done in the near future. It could be said that numerical results show the qualitatively reliable phenomena.

Matsushima, Kisa↗

Multi-partitioning for ADI-schemes on message passing architectures

A kind of discrete-operator splitting called Alternating Direction Implicit (ADI) has been found to be useful in simulating fluid flow problems. In particular, it is being used to study the effects of hot exhaust jets from high performance aircraft on landing surfaces. Decomposition techniques that minimize load imbalance and message-passing frequency are described. Three strategies that are investigated for implementing the NAS Scalar Penta-diagonal Parallel Benchmark (SP) are transposition, pipelined Gaussian elimination, and multipartitioning. The multipartitioning strategy, which was used on Ethernet, was found to be the most efficient, although it was considered only a moderate success because of Ethernet's limited communication properties. The efficiency derived largely from the coarse granularity of the strategy, which reduced latencies and allowed overlap of communication and computation.

Vanderwijngaart, Rob F.↗

A Magnetohydrodynamic Boost for Relativistic Jets

We performed relativistic magnetohydrodynamic simulations of the hydrodynamic boosting mechanism for relativistic jets explored by Aloy & Rezzolla (2006) using the RAISHIN code. Simulation results show that the presence of a magnetic field changes the properties of the shock interface between the tenuous, overpressured jet (V^z j) flowing tangentially to a dense external medium. We find that magnetic fields can lead to more efficient acceleration of the jet, in comparison to the pure-hydrodynamic case. A "poloidal" magnetic field (B^z), tangent to the interface and parallel to the jet flow, produces both a stronger outward moving shock and a stronger inward moving rarefaction wave. This leads to a large velocity component normal to the interface in addition to acceleration tangent to the interface, and the jet is thus accelerated to larger Lorentz factors than those obtained in the pure-hydrodynamic case. Likewise, a strong "toroidal" magnetic field (B^y), tangent to the interface but perpendicular to the jet flow, also leads to stronger acceleration tangent to the shock interface relative to the pure-hydrodynamic case. Thus. the presence and relative orientation of a magnetic field in relativistic jets can significant modify the hydrodynamic boost mechanism studied by Aloy & Rezzolla (2006).

Mizuno, Yosuke↗

High Performance Access to Archival Data Stored in HDF4 and HDF5 on Cloud Object Stores Without Reformatting the Files

Cloud computing offers numerous advantages for users of extensive Earth science data collections. These benefits encompass direct online access to data files and granules from any location, scalable access supporting parallel computing workflows, and flexible computing tools enabling innovative experimentation with processing techniques. However, older archival file formats designed for distinct computing systems hinder efficient access to decade-long time-series data when compared to data stored in modern cloud-optimized formats like Web Object Stores (WOS), exemplified by Amazon Web Services’ Simple Storage Service (S3). We describe DMR++ (Dataset Metadata Response plus plus), a technology facilitating efficient access to HDF5 (Hierarchical Data Format, version 5) and HDF4 files stored on WOS systems without requiring data reformatting. DMR++ achieves performance comparable to technologies like Zarr while preserving the original file structure, a substantial benefit considering the vast quantity of archival files held by organizations such as NASA. Moreover, DMR++ typically outperforms cloud-optimized versions of HDF5. Essentially an XML (Extensible Markup Language) document usually stored alongside the described data, DMR++ can also be generated on-the-fly but is generally created during data staging to the WOS. Archival files that use HDF4/5 often store large arrays of numerical data. The data in these files is often compressed, typically reducing their size by a factor of four or more. To achieve efficient access to portions of those arrays, they are 'chunked' into smaller sub-arrays, each individually compressed. The chunk size is a compromise, where spinning disks can efficiently access data in smaller chunks while S3 favors larger chunks. A simple optimization of aggregating smaller chunks that are stored adjacently, transferring them in a single access and then individually decompressing them will improve performance. NASA data pose an additional challenge: special Application Programmer Interface (API) libraries are often needed to compute some variables. These libraries are incompatible with WOS environments. Our solution involves storing computed values in the DMR++ document or a companion file, making them accessible like other variables and eliminating the need for specialized APIs. We outline specific optimizations for both satellite grid and swath data stored in HDF4-EOS2 (Earth Observing System).

James Gallagher↗

Effect of individual blade control on noise radiation

In a joint research program of NASA Ames Research Center, ZF Luftfahrttechnik, the German Aerospace Research Establishment (DLR), and EUROCOPTER Deutschland, a wind tunnel test was performed to evaluate the effects of Individual Blade Control (IBC) on rotor noise. This test was conducted in the 40x80 ft wind tunnel at NASA Ames Research Center, utilizing a full scale MBB-BO 105 four-bladed rotor system. Three microphones were installed for determination of the radiated noise, two of them on a moveable traverse below the advancing blade side and one in a fixed location below the retreating side. Acoustic results are presented for flight conditions with Blade-Vortex-Interaction (BVI) noise radiation. High noise level reductions were measured for single harmonic control inputs. In addition to the single harmonic inputs, multi-harmonic inputs were evaluated by superimposing 2/rev to 6/rev harmonics. For the first time the efficiency of sharp wavelets (60 deg and 90 deg width) on acoustic noise were measured. In order to achieve an adequate wavelet shape at the blade tip, corrections were made to account for the blade torsional behavior. In parallel with the acoustic measurements, vibratory loads were measured during the BVI flight condition to correlate the effects of IBC on noise and vibrations. It is shown how noise levels and vibrations are affected by specific IBC control inputs. In addition, correlations are made between noise levels and acoustic time histories with IBC phase and amplitude variations. For one IBC input mode with high noise reducing efficiency, a sweep of the moveable microphone traverse below the advancing side shows the effect on BVI noise directivity.

Swanson, S. M.↗

Parallel iterative methods for sparse linear and nonlinear equations

As three-dimensional models are gaining importance, iterative methods will become almost mandatory. Among these, preconditioned Krylov subspace methods have been viewed as the most efficient and reliable, when solving linear as well as nonlinear systems of equations. There has been several different approaches taken to adapt iterative methods for supercomputers. Some of these approaches are discussed and the methods that deal more specifically with general unstructured sparse matrices, such as those arising from finite element methods, are emphasized.

Saad, Youcef↗

Design, fabrication and performance of high efficiency photovoltaic modules

Design details and performance and environmental test results of newly developed high performance and reliability photovoltaic modules are presented. Efficiencies averaging 14.3% for 3040 cells were obtained by using ion implantation for cell junction and back surface field formation. 152 rectangular (6.0 cm x 4.6 cm) cells arranged with a 97% local packing density comprise the circuit assembly, and cells are wired 4 in parallel by 38 in series. The top cover of the superstrate design module is composed of tempered low-iron glass to provide transparent protection for the optical surface. Results show that this design has an encapsulation system which does not fail in the event of reverse-bias operation, and an average module efficiency of 12.2% was achieved at a 58.6W power which varied only 2% among all 20 modules.

Nowlan, M. J.↗

An improved multilevel optimization approach for the design of complex engineering systems

Multilevel optimization methods are being considered for the design of complex systems on distributed networks of computers or even parallel processors. An obstacle to the use of multilevel methods is that they can be computationally expensive because of the cycling necessary to account for the coupling between the subproblems. This research effort aims at increasing the efficiency of multilevel optimization by adapting two techniques that are widely used in conventional one-level optimization: constraint approximation and temporary constraint deletion. These improvements are implemented and tested on three-, ten- and 52-bar planar truss designs. The results show that for larger problems (approximately 100 design variables and larger), the cost of analysis dominates the total cost so that multilevel optimization is no more expensive than one-level optimization. If parallel processing is used or the analysis process itself is decomposed, then multilevel optimization stands to become more economical than one-level optimization.

Barthelemy, J.-F. M.↗

Linear charge coupled device detector array for imaging light propagating in an integrated thin-film optical waveguide

Device design, fabrication, and operation of a linear charge coupled device (CCD) detector array integrated with a thin film optical waveguide and applications of this structure to integrated optical signal processing and fiber optical communications were discussed. A two phase, overlapping-gate CCD is connected in parallel by means of a series of gates to an array of photodiodes. The photodiode provides an electrode free surface region so that a highly efficient waveguide detector coupling technique can be implemented. A thermally-oxidized layer of SiO2 forms an effective substrate for the optical waveguide.

Chen, C. L.↗

Neural network based decomposition in optimal structural synthesis

The present paper describes potential applications of neural networks in the multilevel decomposition based optimal design of structural systems. The generic structural optimization problem of interest, if handled as a single problem, results in a large dimensionality problem. Decomposition strategies allow for this problem to be represented by a set of smaller, decoupled problems, for which solutions may either be obtained with greater ease or may be obtained in parallel. Neural network models derived through supervised training, are used in two distinct modes in this work. The first uses neural networks to make available efficient analysis models for use in repetitive function evaluations as required by the optimization algorithm. In the second mode, neural networks are used to represent the coupling that exists between the decomposed subproblems. The approach is illustrated by application to the multilevel decomposition-based synthesis of representative truss and frame structures.

Hajela, P.↗

Three-dimensional radiative transfer on a massively parallel computer

We perform 3D radiative transfer calculations in non-local thermodynamic equilibrium (NLTE) in the simple two-level atom approximation on the Mas-Par MP-1, which contains 8192 processors and is a single instruction multiple data (SIMD) machine, an example of the new generation of massively parallel computers. On such a machine, all processors execute the same command at a given time, but on different data. To make radiative transfer calculations efficient, we must re-consider the numerical methods and storage of data. To solve the transfer equation, we adopt the short characteristic method and examine different acceleration methods to obtain the source function. We use the ALI method and test local and non-local operators. Furthermore, we compare the Ng and the orthomin methods of acceleration. We also investigate the use of multi-grid methods to get fast solutions for the NLTE case. In order to test these numerical methods, we apply them to two problems with and without periodic boundary conditions.

Vath, H. M.↗

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 will include the implementation of parallel processing software, incorporating new physical models and generalizing the multi-block capability to allow the simultaneous simulation of nozzle and turbopump configurations. The current report contains details of code modifications, numerical results of several flow simulations and the status of the parallelization effort.

Dorney, Daniel J.↗

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.↗