Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “system partition”

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 307 records · Page 17

Integrated flight/propulsion control - Subsystem specifications for performance

A procedure is presented for calculating multiple subsystem specifications given a number of performance requirements on the integrated system. This procedure applies to problems where the control design must be performed in a partitioned manner. It is based on a structured singular value analysis, and generates specifications as magnitude bounds on subsystem uncertainties. The performance requirements should be provided in the form of bounds on transfer functions of the integrated system. This form allows the expression of model following, command tracking, and disturbance rejection requirements. The procedure is demonstrated on a STOVL aircraft design.

Neighbors, W. K.↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗

A model of asynchronous iterative algorithms for solving large, sparse, linear systems

Solving large, sparse, linear systems of equations is one of the fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. This model is then analyzed to determine the expected intertask data transfer and task computational complexity as functions of the number of tasks. Based on the analysis, recommendations for task partitioning are made. These recommendations are a function of the sparseness of the linear system, its structure (i.e., randomly sparse or banded), and dimension.

Reed, D. A.↗

Progress in Parallel Schur Complement Preconditioning for Computational Fluid Dynamics

We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a non-overlapping Schur complement procedure for arbitrary triangulated domains. The ultimate goal of this research is to develop scalable preconditioning algorithms for fluid flow discretizations on parallel computing architectures. In our implementation of the Schur complement preconditioning technique, the triangulation is first partitioned into a number of subdomains using the METIS multi-level k-way partitioning code. This partitioning induces a natural 2X2 partitioning of the p.d.e. discretization matrix. By considering various inverse approximations of the 2X2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 and the SGI Power Challenge array using MPI message passing protocol. A number of example CFD calculations will be presented to illustrate and assess various Schur complement approximations.

Barth, Timothy J.↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗

Seasat synthetic-aperture radar data reduction using parallel programmable array processors

This paper presents a digital processing system that produces the Seasat synthetic-aperture radar (SAR) imagery. The system consists of a SEL 32/77 host minicomputer and three AP-120B array processors. The partitioning of the SAR processing functions and the design of software modules is described. The rationale for selecting the parallel array processor architecture and the methodology for developing the parallel processing scheme on this system is described. This system attains a Seasat SAR data reduction speed of 2.5 h per 25-m resolution 4-look and 100 km x 100 km image frame. A preliminary performance evaluation of this parallel processing system and potential future applications for remote sensing data reduction are described.

Wu, C.↗

Aqueous two-phase partition applied to the isolation of plasma membranes and Golgi apparatus from cultured mammalian cells

Partitioning in dextran-poly(ethylene)glycol (PEG) aqueous-aqueous phase systems represents a mature technology with many applications to separations of cells and to the preparation of membranes from mammalian cells. Most applications to membrane isolation and purification have focused on plasma membranes, plasma membrane domains and separation of right side-out and inside-out plasma membrane vesicles. The method exploits a combination of membrane properties, including charge and hydrophobicity. Purification is based upon differential distributions of the constituents in a sample between the two principal compartments of the two phases (upper and lower) and at the interface. The order of affinity of animal cell membranes for the upper phase is: endoplasmic reticulum <mitochondria<Golgi apparatus<lysosomes and endosomes< plasma membranes. Salt concentrations and temperature affect partitioning behavior and must be precisely standardized. In some cases, it is more fortuitous to combine aqueous two-phase partition with other procedures to obtain a more highly purified preparation. A procedure is described for preparation of Golgi apparatus from transformed mammalian cells that combines aqueous two-phase partition and centrifugation. Also described is a periodic NADH oxidase, a new enzyme marker for right side-out plasma membrane vesicles not requiring detergent disruptions for measurement of activity.

Non-NASA Center↗

Demixing of aqueous polymer two-phase systems in low gravity

When polymers such as dextran and poly(ethylene glycol) are mixed in aqueous solution biphasic systems often form. On Earth the emulsion formed by mixing the phases rapidly demixes because of phase density differences. Biological materials can be purified by selective partitioning between the phases. In the case of cells and other particulates the efficiency of these separations appears to be somewhat compromised by the demixing process. To modify this process and to evaluate the potential of two-phase partitioning in space, experiments on the effects of gravity on phase emulsion demixing were undertaken. The behavior of phase systems with essentially identical phase densities was studied at one-g and during low-g parabolic aircraft maneuvers. The results indicate the demixing can occur rather rapidly in space, although more slowly than on Earth. The demixing process was examined from a theoretical standpoint by applying the theory of Ostwald ripening. This theory predicts demizing rates many orders of magnitude lower than observed. Other possible demixing mechanisms are considered.

Bamberger, S.↗

E-beam generated holographic masks for optical vector-matrix multiplication

An optical vector matrix multiplication scheme that encodes the matrix elements as a holographic mask consisting of linear diffraction gratings is proposed. The binary, chrome on glass masks are fabricated by e-beam lithography. This approach results in a fairly simple optical system that promises both large numerical range and high accuracy. A partitioned computer generated hologram mask was fabricated and tested. This hologram was diagonally separated outputs, compact facets and symmetry about the axis. The resultant diffraction pattern at the output plane is shown. Since the grating fringes are written at 45 deg relative to the facet boundaries, the many on-axis sidelobes from each output are seen to be diagonally separated from the adjacent output signals.

Arnold, S. M.↗

Concepts, strategies and potentials using hypo-g and other features of the space environment for commercialization using higher plants

Opportunities for releasing, capturing, constructing and/or fixing the differential expressions or response potentials of the higher plant genome in the hypo-g environment for commercialization are explored. General strategies include improved plant-growing, crop and forestry production systems which conserve soil, water, labor and energy resources, and nutritional partitioning and mobilization of nutrients and synthates. Tissue and cell culture techniques of commercial potential include the growing and manipulation of cultured plant cells in vitro in a bioreactor to produce biologicals and secondary plants of economic value. The facilitation of plant breeding, the cloning of specific pathogen-free materials, the elimination of growing point or apex viruses, and the increase of plant yield are other O-g applications. The space environment may be advantageous in somatic embryogenesis, the culture of alkaloids, and the development of completely new crop plant germ plasm.

Krikorian, A. D.↗

Techniques and tools for efficiently modeling multiprocessor systems

System-level tools and methodologies associated with an integrated approach to the development of multiprocessor systems are examined. Tools for capturing initial program structure, automated program partitioning, automated resource allocation, and high-level modeling of the combined application and resource are discussed. The primary language focus of the current implementation is Ada, although the techniques should be appropriate for other programming paradigms.

Carpenter, T.↗

Survivable algorithms and redundancy management in NASA's distributed computing systems

The design of survivable algorithms requires a solid foundation for executing them. While hardware techniques for fault-tolerant computing are relatively well understood, fault-tolerant operating systems, as well as fault-tolerant applications (survivable algorithms), are, by contrast, little understood, and much more work in this field is required. We outline some of our work that contributes to the foundation of ultrareliable operating systems and fault-tolerant algorithm design. We introduce our consensus-based framework for fault-tolerant system design. This is followed by a description of a hierarchical partitioning method for efficient consensus. A scheduler for redundancy management is introduced, and application-specific fault tolerance is described. We give an overview of our hybrid algorithm technique, which is an alternative to the formal approach given.

Malek, Miroslaw↗

Formal functional test designs with a test representation language

The application of the category-partition method to the test design phase of hardware, software, or system test development is discussed. The method provides a formal framework for reducing the total number of possible test cases to a minimum logical subset for effective testing. An automatic tool and a formal language were developed to implement the method and produce the specification of test cases.

Hops, J. M.↗

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.↗

Source And Sink Of Iodine For Drinking Water

Proposed system for controlling concentration of iodine in potable water exploits temperature dependence of equilibrium partition of iodine between solution in water and residence in ion-exchange resin. Used to maintain concentration of iodine sufficient to kill harmful microbes, but not so great to make water unpalatable. Requires little attention, yet controls concentration of iodine more precisely than iodination and deiodination by manual techniques. Conceived for use aboard spacecraft, system has terrestrial applications in regions where water must be kept potable, resupply difficult, and system must operate largely unattended.

Sauer, Richard L.↗

Trapped Melt in IIIAB Irons: Solid/Liquid Elemental Partitioning During the Fractionation of the IIIAB Magma

Group IIIAB, the largest iron-meteorite group, shows compositional trends (including a three-order-of-magnitude It concentration range) indicating that it formed by fractional crystallization of a metallic magma. Because about 200 irons are available, and all degrees of crystallization are well represented, IIIAB offers an excellent set of samples for the study of crystallization at all depths of the asteroidal core. On log-log Ir-Au, and Ir-As diagrams IIIAB forms a broad band; the breadth represents real meteorite-to-meteorite variations, far outside experimental or sampling uncertainties. A successful model must explain the width of this band; I suggest that it mainly resulted from the trapping of parental magma within the crystallizing solid. Because S is essentially insoluble in metal, the abundance of FeS is a measure of the fraction of trapped liquid. The trapped-melt model is supported by the observation that irons having higher S contents plot closer to the inferred composition of the magmatic parental liquid. The lowest S values are found in the irons occupying the left envelope of the IIIAB Ir-Au or Ir-As compositional fields, thus it is this set of irons that should be interpreted as the solid products of a fractionating magma. This simplifies the modeling of the crystallization process and allows inferences regarding the distribution ratios for other elements in the evolved IIIAB system. The large (multiton) Cape York irons show wide variations in their trapped-melt fractions; their compositions seem best understood in terms of a low initial S content of the IIIAB magma, about 20 mg/g. The inferred initial IIIAB distribution coefficient for Ir, 4.6, is much higher than published values based on laboratory studies of low-S systems; I suggest that low-S (and low-P) partition-ratio measurements tend to err in the direction of unity. In IIIAB distribution coefficients for Au, As, and Ni were still < 1 when the most evolved IIIAB irons formed, another indication of a low initial S content.

Wasson, John T.↗

Spacecraft On-Board Information Extraction Computer (SOBIEC)

The Jet Propulsion Laboratory is the Technical Monitor on an SBIR Program issued for Irvine Sensors Corporation to develop a highly compact, dual use massively parallel processing node known as SOBIEC. SOBIEC couples 3D memory stacking technology provided by nCUBE. The node contains sufficient network Input/Output to implement up to an order-13 binary hypercube. The benefit of this network, is that it scales linearly as more processors are added, and it is a superset of other commonly used interconnect topologies such as: meshes, rings, toroids, and trees. In this manner, a distributed processing network can be easily devised and supported. The SOBIEC node has sufficient memory for most multi-computer applications, and also supports external memory expansion and DMA interfaces. The SOBIEC node is supported by a mature set of software development tools from nCUBE. The nCUBE operating system (OS) provides configuration and operational support for up to 8000 SOBIEC processors in an order-13 binary hypercube or any subset or partition(s) thereof. The OS is UNIX (USL SVR4) compatible, with C, C++, and FORTRAN compilers readily available. A stand-alone development system is also available to support SOBIEC test and integration.

Eisenman, David↗

Computations of Viscous Flows in Complex Geometries Using Multiblock Grid Systems

Generating high quality, structured, continuous, body-fitted grid systems (multiblock grid systems) for complicated geometries has long been a most labor-intensive and frustrating part of simulating flows in complicated geometries. Recently, new methodologies and software have emerged that greatly reduce the human effort required to generate high quality multiblock grid systems for complicated geometries. These methods and software require minimal input form the user-typically, only information about the topology of the block structure and number of grid points. This paper demonstrates the use of the new breed of multiblock grid systems in simulations of internal flows in complicated geometries. The geometry used in this study is a duct with a sudden expansion, a partition, and an array of cylindrical pins. This geometry has many of the features typical of internal coolant passages in turbine blades. The grid system used in this study was generated using a commercially available grid generator. The simulations were done using a recently developed flow solver, TRAF3D.MB, that was specially designed to use multiblock grid systems.

Steinthorsson, Erlendur↗