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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

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↗
NASA NTRS1978

Experimental partitioning of rare earth elements and scandium among armalcolite, ilmenite, olivine and mare basalt liquid

An experimental study was carried out to measure partition coefficients for two rare-earth elements (Sm and Tm) and Sc among armalcolite, ilmenite, olivine and liquid coexisting in a system modeled on high-Ti mare basalt 74275. This 'primitive' sample was chosen for study because its major and trace element chemistry as well as its equilibrium phase relations at atmospheric pressure are known from previous studies. Beta-track analytical techniques were used so that partition coefficients could be measured in an environment whose bulk trace element composition is similar to that of the natural basalt. Partition coefficients for Cr and Mn were determined in the same experiments by microprobe analysis. The only equilibrium partial melting model appears to be one in which ilmenite is initially present in the source region but is consumed by melting before segregation of the high-Ti mare basalt liquid from the residue.

Irving, A. J.↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.

TRT-THEORETICAL↗
NASA NTRSDate not supplied

Aqueous Alteration on the Ryugu Parent Body Constrained by Chemical Equilibrium Models

The composition of solid samples returned from the asteroid 162173 Ryugu byHayabusa2 indicates aqueous alteration of rocks that formed a parent body of Ryugu [1, 2]. As on parent bodies of carbonaceous chondrites [3-5], Ryugu materials could have went through (1) accretion of anhydrous and reduced rocky grains together with water-rich ices, (2) melting of ices in the body’s interior through release of radiogenic heat [6], and (3)aqueous alteration of rocky and organic materials that produced secondary minerals, salt- and organic-bearing water solutions, gases, and altered organic matter. Although the bulk chemical composition and major mineralogy (phyllosilicates, magnetite, pyrrhotite, carbonates, phosphates, etc.) of Ryugu [1,2]are similar to those of CI carbonaceous chondrites [3-5, 7], the lack of sulfates and a deficiency of oxygen in the returned samples suggest a distinct alteration pathway. Chondritic materials [3-5] do not indicate complete chemical equilibration though low-temperature parent body processes. However, calculations of chemical equilibria in modeling rock-water-gas type systems[e.g., 8, 9], could assess deviations of chondritic materials from equilibrium conditions and constrain partitioning of chemical elements between solid, aqueous, and gas phase for different stages of alteration. Here we constrained speciation of solid, aqueous, and gaseous phases during aqueous alteration on the Ryugu parent body through chemical equilibrium calculations.

M Yu Zolotov↗
NASA NTRS1998

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and weighted links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Weights are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗
NASA NTRS1996

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and directed links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Reliability values are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗
NASA NTRS1976

Chromium basalts - Experimental determination of redox states and partitioning among synthetic silicate phases

Experiments were performed on silicate compositions in the forsterite-anorthite-silica and forsterite-anorthite-diopside systems to determine the relative amounts of Cr(II), Cr(III), and Cr(VI) over a wide range of oxygen partial pressures from 10 to the -10th to 1 atm at 1500 and 1550 C. Redox states were measured by visible absorption spectroscopy and electron paramagnetic resonance spectroscopy and titration. It was found that Cr is present almost exclusively as Cr(III) in terrestrial basaltic liquids and as a mixture of Cr(III) and Cr(II) in lunar basaltic liquids.

Schreiber, H. D.↗
NASA NTRS1989

Partitioning And Packing Equations For Parallel Processing

Algorithm developed to identify parallelism in set of coupled ordinary differential equations that describe physical system and to divide set into parallel computational paths, along with parts of solution proceeds independently of others during at least part of time. Path-identifying algorithm creates number of paths consisting of equations that must be computed serially and table that gives dependent and independent arguments and "can start," "can end," and "must end" times of each equation. "Must end" time used subsequently by packing algorithm.

Arpasi, Dale J.↗
NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗
NASA NTRS1994

Responses of soybean to ammonium and nitrate supplied in combination to the whole root system or separately in a split-root system

To address the questions of whether allocation of carbohydrates to roots is influenced by ionic form of nitrogen absorbed and whether allocation of carbohydrates to roots in turn influences proportionality between NH4+ and NO3- uptake from mixed sources, NH4+ and NO3- were supplied separately to halves of a split-root hydroponic system and were supplied in combination to a whole-root system. Dry matter accumulation in the split-root system was 18% less in the NH4(+)-fed axis than in the NO3(-)-fed axis. This, however, does not indicate that partitioning of carbohydrate between the two axes was different. Most of the reduction in dry matter accumulation in the NH4(+)-fed axis can be accounted for by the retransport of CH2O equivalents from the root back to the shoot with amino acids produced by NH4+ assimilation. Uptake of NH4+ or NO3- by the respective halves of the split-root system was proportional to the estimated allocation of carbohydrate to that half. When NH4+ and NO3- were supplied to separate halves of the split-root system, the cumulative NH4+ to NO3- uptake ratio was 0.81. When supplied in combination to the whole-root system, the cumulative NH4+ to NO3- uptake ratio was 1.67. Thus, while the shoot may affect total nitrogen uptake through the export of carbohydrates to roots, the shoot (common for halves of the split-root system) apparently does not exert a direct effect on proportionality of NH4+ and NO3- uptake by roots. For whole roots supplied with both NH4+ and NO3-, the restriction in uptake of NO3- may involve a stimulation of NO3- efflux rather than an inhibition of NO3- influx. While only the net uptake of NH4+ and NO3- was measured by ion chromatography, monitoring at approximately hourly intervals during the first 3 days of treatment revealed irregularly occurring intervals of both depletion (net influx) and enrichment (net efflux) in solutions. In the case of NH4+, numbers of net efflux events were similar (21 to 24 out of 65 sequential sampling intervals) whether NH4+ was supplied with NO3- to whole-root systems or separately to an axis of the split-root system. In the case of NO3-, however, the number of net efflux events increased from 8 when NO3- was supplied to a separate axis of the split-root system to between 19 and 24 when NO3- was supplied with NH4+ to whole-root systems.

Non-NASA Center↗
NASA NTRS1971

A Thermal Survey Instrument Using LSI Data Storage

This paper describes a developmental system for monitoring the temperature of lakes and rivers. The battery powered instrument is housed in a buoy and requires no external electrical connections. Temperature is periodically sampled and stored in LSI shift register circuits. Depending on the type of data reduction used, storage times from days to weeks are possible. The measurement range is from 0 C to 50 C with an accuracy of +/- 0.1 c. This is accomplished using a novel temperature sensitive C/MOS oscillator together with off-line computer linearization. The electronics is partitioned for eventual C/MOS LSI implementation which should result in a total cost of under $1,000 for the system.

Lathrop. Jay W.↗
NASA NTRS1990

Constraint treatment techniques and parallel algorithms for multibody dynamic analysis

Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.

Chiou, Jin-Chern↗
NASA NTRS1988

Efficient parallel architecture for highly coupled real-time linear system applications

A systematic procedure is developed for exploiting the parallel constructs of computation in a highly coupled, linear system application. An overall top-down design approach is adopted. Differential equations governing the application under consideration are partitioned into subtasks on the basis of a data flow analysis. The interconnected task units constitute a task graph which has to be computed in every update interval. Multiprocessing concepts utilizing parallel integration algorithms are then applied for efficient task graph execution. A simple scheduling routine is developed to handle task allocation while in the multiprocessor mode. Results of simulation and scheduling are compared on the basis of standard performance indices. Processor timing diagrams are developed on the basis of program output accruing to an optimal set of processors. Basic architectural attributes for implementing the system are discussed together with suggestions for processing element design. Emphasis is placed on flexible architectures capable of accommodating widely varying application specifics.

Carroll, Chester C.↗
NASA NTRS1990

Efficient algorithms for a class of partitioning problems

The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.

Iqbal, M. Ashraf↗
NASA NTRSDate not supplied

Silicon Partitioning Between Iron-Rich Metal and Silicate Melt: New Constraints From Aerodynamic Laser Levitation Furnace Experiments

The partitioning of light elements (e.g., Si, C, H, etc.) between silicate melts and iron metal alloys as a function of pressure and temperature is a critical constraint in defining the compositional evolution of planetary interiors. While there are a significant number of experimental studies in the literature that examine the various influences of oxygen fugacity, temperature, pressure, and composition on the metal-melt partitioning of silicon, it is difficult to disentangle the effects of each variable due to the nominally independent parameters (e.g., pressure, temperature, composition) being collinear. To better test for the independent effects of pressure, temperature, and melt composition on the partitioning of silicon between iron alloy and silicate melt, new high temperature (1800°–2500°C), rapid quench (~700°C/s) aerodynamic levitation laser-heating experiments in the Fe-Si-Mg-O (En65-Fa5-Si3-Fe27) system were conducted. This high temperature, low pressure method is ideal for these experiments because it eliminates the metal container as a sink for elements of interest to partition into, and it has a rapid quench rate that minimizes potential exsolution of silicon from the metal phase during quench cooling. Given the short run times of the levitation experiments (30–60 seconds), a time series at a lower temperature (1700°C) in a vertical gas-mixing muffle tube furnace was also conducted to assess equilibrium times of the bulk composition. All successful runs were imaged using back-scatter electron imaging and analyzed for phase composition using a JEOL 8530F field emission microprobe. These new data were added to a comprehensive and internally consistent data set created from published experiments, and subsequently modeled using parameters designed to minimize collinearity (e.g., optical basicity is used as a proxy for melt composition). High collinearity is found in the data set however between temperature and oxygen fugacity, precluding any model that contains both as nominally independent variables. The resulting model demonstrates a statistically significant effect of pressure, temperature, and melt composition on the partitioning of silicon in Fe-rich metal, which has implications for the formation of planetary cores in rocky planets and provides important constraints on potential bulk core compositions.

Metal↗
NASA NTRS1981

Wedge-and-strip anodes for centroid-finding position-sensitive photon and particle detectors

The paper examines geometries employing position-dependent charge partitioning to obtain a two-dimensional position signal from each detected photon or particle. Requiring three or four anode electrodes and signal paths, images have little distortion and resolution is not limited by thermal noise. An analysis of the geometrical image nonlinearity between event centroid location and the charge partition ratios is presented. In addition, fabrication and testing of two wedge-and-strip anode systems are discussed. Images obtained with EUV radiation and microchannel plates verify the predicted performance, with further resolution improvements achieved by adopting low noise signal circuitry. Also discussed are the designs of practical X-ray, EUV, and charged particle image systems.

Martin, C.↗
NASA NTRS1990

Trellis-coded multidimensional phase modulation

A 2L-dimensional multiple phase-shift keyed (MPSK) (L x MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L x MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper. Trellis-coded L x 4PSK, L x 8PSK, and L x 16PSK modulation schemes are found for L = 1-4 and a variety of code rates and decoder complexities, many of which are fully transparent to discrete phase rotations of the signal set. The new codes achieve asymptotic coding gains up to 5.85 dB.

Pietrobon, Steven S.↗