Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster computing”

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 451 records · Page 25

Voids and constraints on nonlinear clustering of galaxies

Void statistics of the galaxy distribution in the Center for Astrophysics Redshift Survey provide strong constraints on galaxy clustering in the nonlinear regime, i.e., on scales R equal to or less than 10/h Mpc. Computation of high-order moments of the galaxy distribution requires a sample that (1) densely traces the large-scale structure and (2) covers sufficient volume to obtain good statistics. The CfA redshift survey densely samples structure on scales equal to or less than 10/h Mpc and has sufficient depth and angular coverage to approach a fair sample on these scales. In the nonlinear regime, the void probability function (VPF) for CfA samples exhibits apparent agreement with hierarchical scaling (such scaling implies that the N-point correlation functions for N greater than 2 depend only on pairwise products of the two-point function xi(r)) However, simulations of cosmological models show that this scaling in redshift space does not necessarily imply such scaling in real space, even in the nonlinear regime; peculiar velocities cause distortions which can yield erroneous agreement with hierarchical scaling. The underdensity probability measures the frequency of 'voids' with density rho less than 0.2 -/rho. This statistic reveals a paucity of very bright galaxies (L greater than L asterisk) in the 'voids.' Underdensities are equal to or greater than 2 sigma more frequent in bright galaxy samples than in samples that include fainter galaxies. Comparison of void statistics of CfA samples with simulations of a range of cosmological models favors models with Gaussian primordial fluctuations and Cold Dark Matter (CDM)-like initial power spectra. Biased models tend to produce voids that are too empty. We also compare these data with three specific models of the Cold Dark Matter cosmogony: an unbiased, open universe CDM model (omega = 0.4, h = 0.5) provides a good match to the VPF of the CfA samples. Biasing of the galaxy distribution in the 'standard' CDM model (omega = 1, b = 1.5; see below for definitions) and nonzero cosmological constant CDM model (omega = 0.4, h = 0.6 lambda(sub 0) = 0.6, b = 1.3) produce voids that are too empty. All three simulations match the observed VPF and underdensity probability for samples of very bright (M less than M asterisk = -19.2) galaxies, but produce voids that are too empty when compared with samples that include fainter galaxies.

Vogeley, Michael S.↗

Hot gas in clusters of galaxies

Radio and X-ray observations are discussed which seem to favor the presence of a hot intracluster gas in rich clusters of galaxies. On the assumption that the X-rays are produced by thermal bremsstrahlung, a temperature of the order of 100 million K and a density of a few thousandths per cu cm are computed for the intracluster gas. Theories on the origin and dynamics of this gas are reviewed, and the discovery of an iron line in the spectrum of the Perseus cluster is taken as strong evidence for thermal emission from a hot intracluster gas. Effects of and on the intracluster gas are considered, particularly the formation of radio-tail galaxies due to ram pressure on the galaxies in rich clusters, stripping of interstellar gas from the galaxies, and heating of the intracluster gas by the galaxies. It is concluded that the intracluster gas: (1) originated partially in primordial matter that collapsed into the clusters and partially in gas lost from the galaxies, (2) is in static or almost static equilibrium in the clusters, and (3) either is tightly bound or has an equation of state corresponding to a gamma value of less than 5/3.

Lea, S. M.↗

Fragmentation hierarchy of bright sungrazing comets and the birth and orbital evolution of the Kreutz System. II. the case for cascading fragmentation

We examine the process of cascading fragmentation for the Kreutz sungrazer system to continue our exploration of its birth, orbital evolution, and temporal clumping. We modify and broaden the two-superfragment model from Paper I to include clusters of ~30 bright comets spanning four centuries and 1000 SOHO sungrazers from 1996 to 2006. The spectacular parent sungrazer X/1106 C1 is assumed to have tidally split shortly after perihelion into a train of major protofragments immersed in a cloud of particulate debris, which at larger heliocentric distances were breaking up nontidally over and over again. We describe potential evolutionary paths for the Kreutz system by linking X/1106 C1 in subgroup I-type orbit with the comet of February 423 in one scenario or with the comet of February 467 in another. The latter scenario accounts for sungrazer clusters in as early as the 16th century, suggests that the progenitor object may have been observed as the comet of 214 BCE, is quite consistent with the orbital distribution of the SOHO sungrazers that sample the central filament of the Kreutz system between the clusters of major sungrazers, and predicts future clusters until ~2120. Comet X/1106 C1 and the common parent of C/1882 R1 and C/1965 S1 were two first-generation fragments of the progenitor that split nontidally on the way to its 5th century perihelion, reminiscent of the superfragments in Paper I. We provide computational tools needed for solving the problem of the Kreutz system’s orbital evolution, but no unique scenarios are presented for the individual comets. Another cluster of bright sungrazers is expected to arrive in the coming decades, its earliest member possibly just several years from now.

Chodas, Paul W.↗

Tidal disruption of open clusters in their parent molecular clouds

A simple model of tidal encounters has been applied to the problem of an open cluster in a clumpy molecular cloud. The parameters of the clumps are taken from the Blitz, Stark, and Long (1988) catalog of clumps in the Rosette molecular cloud. Encounters are modeled as impulsive, rectilinear collisions between Plummer spheres, but the tidal approximation is not invoked. Mass and binding energy changes during an encounter are computed by considering the velocity impulses given to individual stars in a random realization of a Plummer sphere. Mean rates of mass and binding energy loss are then computed by integrating over many encounters. Self-similar evolutionary calculations using these rates indicate that the disruption process is most sensitive to the cluster radius and relatively insensitive to cluster mass. The calculations indicate that clusters which are born in a cloud similar to the Rosette with a cluster radius greater than about 2.5 pc will not survive long enough to leave the cloud. The majority of clusters, however, have smaller radii and will survive the passage through their parent cloud.

Long, Kevin↗

Formation and Combustion of Unconfined Drop Clusters in Microgravity

Single-drop and droplet array studies have become common methods to isolate and investigate the effects of any of the complexities that enter into the drop combustion process. Microgravity environments are required to allow larger drops to be studied while minimizing or eliminating the confounding effects of buoyancy. Based on the results from current isolated drop, drop array, and spray studies funded through the Microgravity Science and Applications Division, it has become clear that even with the effects of buoyancy removed, the extrapolation of results from droplet array studies to spray flames is difficult. The problem occurs because even the simplest spray systems introduce complexities of multi-disperse drop sizes and drop-drop interactions, coupled with more complicated fluid dynamics. Not only do these features make the interpretation of experimental data difficult, they also make the problem very difficult to analyze computationally. Group combustion models, in which the interaction between droplets is treated on a statistical manner, have become a popular method to investigate the behavior of large numbers of interacting droplets, particularly through the work of Ryan et al. and Bellan and co-workers. While these models idealize the actual spray systems to a point where they can be treated computationally, the experimental analogy to these models is difficult to achieve because it requires the formation and Combustion of drop clusters without the effects of buoyancy. Therefore, even though these models have provided useful and insightful information, the verification of the results by direct comparison with experimental data is still lacking.

Liu, S.↗

Computational Nanotechnology at NASA Ames Research Center, 1996

Some forms of nanotechnology appear to have enormous potential to improve aerospace and computer systems; computational nanotechnology, the design and simulation of programmable molecular machines, is crucial to progress. NASA Ames Research Center has begun a computational nanotechnology program including in-house work, external research grants, and grants of supercomputer time. Four goals have been established: (1) Simulate a hypothetical programmable molecular machine replicating itself and building other products. (2) Develop molecular manufacturing CAD (computer aided design) software and use it to design molecular manufacturing systems and products of aerospace interest, including computer components. (3) Characterize nanotechnologically accessible materials of aerospace interest. Such materials may have excellent strength and thermal properties. (4) Collaborate with experimentalists. Current in-house activities include: (1) Development of NanoDesign, software to design and simulate a nanotechnology based on functionalized fullerenes. Early work focuses on gears. (2) A design for high density atomically precise memory. (3) Design of nanotechnology systems based on biology. (4) Characterization of diamonoid mechanosynthetic pathways. (5) Studies of the laplacian of the electronic charge density to understand molecular structure and reactivity. (6) Studies of entropic effects during self-assembly. Characterization of properties of matter for clusters up to sizes exhibiting bulk properties. In addition, the NAS (NASA Advanced Supercomputing) supercomputer division sponsored a workshop on computational molecular nanotechnology on March 4-5, 1996 held at NASA Ames Research Center. Finally, collaborations with Bill Goddard at CalTech, Ralph Merkle at Xerox Parc, Don Brenner at NCSU (North Carolina State University), Tom McKendree at Hughes, and Todd Wipke at UCSC are underway.

Globus, Al↗

Internal velocity and mass distributions in simulated clusters of galaxies for a variety of cosmogonic models

The mass and velocity distributions in the outskirts (0.5-3.0/h Mpc) of simulated clusters of galaxies are examined for a suite of cosmogonic models (two Omega(sub 0) = 1 and two Omega(sub 0) = 0.2 models) utilizing large-scale particle-mesh (PM) simulations. Through a series of model computations, designed to isolate the different effects, we find that both Omega(sub 0) and P(sub k) (lambda less than or = 16/h Mpc) are important to the mass distributions in clusters of galaxies. There is a correlation between power, P(sub k), and density profiles of massive clusters; more power tends to point to the direction of a stronger correlation between alpha and M(r less than 1.5/h Mpc); i.e., massive clusters being relatively extended and small mass clusters being relatively concentrated. A lower Omega(sub 0) universe tends to produce relatively concentrated massive clusters and relatively extended small mass clusters compared to their counterparts in a higher Omega(sub 0) model with the same power. Models with little (initial) small-scale power, such as the hot dark matter (HDM) model, produce more extended mass distributions than the isothermal distribution for most of the mass clusters. But the cold dark matter (CDM) models show mass distributions of most of the clusters more concentrated than the isothermal distribution. X-ray and gravitational lensing observations are beginning providing useful information on the mass distribution in and around clusters; some interesting constraints on Omega(sub 0) and/or the (initial) power of the density fluctuations on scales lambda less than or = 16/h Mpc (where linear extrapolation is invalid) can be obtained when larger observational data sets, such as the Sloan Digital Sky Survey, become available.

Cen, Renyue↗

Asymmetric Electrostatic Radiation Shielding for Spacecraft

A paper describes the types, sources, and adverse effects of energetic-particle radiation in interplanetary space, and explores a concept of using asymmetric electrostatic shielding to reduce the amount of such radiation impinging on spacecraft. Typically, such shielding would include a system of multiple inflatable, electrically conductive spheres deployed in clusters in the vicinity of a spacecraft on lightweight structures that would maintain the spheres in a predetermined multipole geometry. High-voltage generators would maintain the spheres at potential differences chosen in conjunction with the multipole geometry so that the resulting multipole field would gradually divert approaching energetic atomic nuclei from a central region occupied by the spacecraft. The spheres nearest the center would be the most positive, so as to repel the positively charged impinging nuclei from the center. At the same time, the monopole potential of the overall spacecraft-and-shielding system would be made negative so as to repel thermal electrons. The paper presents results of computational simulations of energetic-particle trajectories and shield efficiency for a trial system of 21 spheres arranged in three clusters in an overall linear quadrupole configuration. Further development would be necessary to make this shielding concept practical.

Metzger, Philip T.↗

Algebraic grid generation

Algebraic grid generation is the direct expression of a physical coordinate system as a function of a uniform grid in a rectangular computational coordinate system. Algebraic grid generation is based on mathematical interpolation and is presented in general terms of multivariate transfinite interpolation. The multisurface method and the two-boundary technique are described as univariate procedures that can be applied within the context of transfinite interpolation. A technique for grid clustering is described. Problems that are commonly encountered in three-dimensional grid generation are discussed and approaches for dealing with complex physical domains using multiple computational grid blocks are presented.

Smith, Robert E.↗

Digital processing of satellite imagery application to jungle areas of Peru

The author has identified the following significant results. The use of clustering methods permits the development of relatively fast classification algorithms that could be implemented in an inexpensive computer system with limited amount of memory. Analysis of CCTs using these techniques can provide a great deal of detail permitting the use of the maximum resolution of LANDSAT imagery. Potential cases were detected in which the use of other techniques for classification using a Gaussian approximation for the distribution functions can be used with advantage. For jungle areas, channels 5 and 7 can provide enough information to delineate drainage patterns, swamp and wet areas, and make a reasonable broad classification of forest types.

Pomalaza, J. C.↗

Metal-to-metal charge transfer transitions - Interpretation of visible-region spectra of the moon and lunar materials

Prominent bands in the spectral profiles of Fe-Ti phases in lunar samples have been attributed to charge-transfer transitions between Fe and Ti cations, and a model is presented for calculating charge transfer energies from energy levels computed by the SCF-X(alpha) scattered wave molecular orbital method for isolated MO6 octahedral coordination clusters containing Fe(2+), Fe(3+), Ti(3+), and Ti(4+) cations. The calculated charge transfer energy for the Fe(2+) to Ti(4+) transition correlates well with a measured spectral feature around 0.6 micron in ilmenite, and, since ilmenite is a major constituent of mare basalts and dark-mantling material, the observed darkness and blueness of the regolith in lunar black spots is attributed primarily to this transition. The Ti(3+) to Ti(4+) transition is thought to contribute to some phases.

Loeffler, B. M.↗

Three-dimensional grids as solutions of elliptic systems

An elliptic grid generation scheme is described which produces a curvilinear, boundary-fitted grid for highly swept wings with sharp leading edges. The three-dimensional integration domain is segmented in successive crossflow sections wherein the physical coordinates are transformed to computational coordinates by solving an elliptic set of two quasi-linear differential equations. Grid points are clustered in the vicinity of the wing surface, especially in the neighborhood of the leading edges. The formulation of the source terms in the equations governing the transformation contains adjustable parameters which are determined from limiting forms of the elliptic equations along the boundaries. The source terms are assigned to each grid point by interpolation of these parameters into the interior domain. The formulation does not depend on the boundary shape or on the distribution of the grid points along the boundaries. For the first time, the discretized governing equations have been solved using a fast AF1 iteration scheme.

Hartwich, P.-M.↗

The Efficiency of Various Computers and Optimizations in Performing Finite Element Computations

With the advent of computers with many processors, it becomes unclear how to best exploit this advantage. For example, matrices can be inverted by applying several processors to each vector operation, or one processor can be applied to each matrix. The former approach has diminishing returns beyond a handful of processors, but how many processors depends on the computer architecture. Applying one processor to each matrix is feasible with enough ram memory and scratch disk space, but the speed at which this is done is found to vary by a factor of three depending on how it is done. The cost of the computer must also be taken into account. A computer with many processors and fast interprocessor communication is much more expensive than the same computer and processors with slow interprocessor communication. Consequently, for problems that require several matrices to be inverted, the best speed per dollar for computers is found to be several small workstations that are networked together, such as in a Beowulf cluster. Since these machines typically have two processors per node, each matrix is most efficiently inverted with no more than two processors assigned to it.

Marcus, Martin H.↗

Clustering methods for removing outliers from vision-based range estimates

The present approach to the automation of helicopter low-altitude flight uses one or more passive imaging sensors to extract environmental obstacle information; this is then processed via computer-vision techniques to yield a time-varying map of range to obstacles in the sensor's field of view along the vehicle's flight path. Attention is given to two related techniques which can eliminate outliers from a sparse range map, clustering sparse range-map information into different spatial classes that rely on a segmented and labeled image to aid in spatial classification within the image plane.

Hussien, B.↗

Scalability of a Low-Cost Multi-Teraflop Linux Cluster for High-End Classical Atomistic and Quantum Mechanical Simulations

Scalability of a low-cost, Intel Xeon-based, multi-Teraflop Linux cluster is tested for two high-end scientific applications: Classical atomistic simulation based on the molecular dynamics method and quantum mechanical calculation based on the density functional theory. These scalable parallel applications use space-time multiresolution algorithms and feature computational-space decomposition, wavelet-based adaptive load balancing, and spacefilling-curve-based data compression for scalable I/O. Comparative performance tests are performed on a 1,024-processor Linux cluster and a conventional higher-end parallel supercomputer, 1,184-processor IBM SP4. The results show that the performance of the Linux cluster is comparable to that of the SP4. We also study various effects, such as the sharing of memory and L2 cache among processors, on the performance.

Kikuchi, Hideaki↗

The dynamics of superclusters - Initial determination of the mass density of the universe at large scales

The radial velocities of cluster members of two rich, large superclusters have been measured in order to probe the supercluster mass densities, and simple evolutionary models have been computed to place limits upon the mass density within each supercluster. These superclusters represent true physical associations of size of about 100 Mpc seen presently at an early stage of evolution. One supercluster is weakly bound, the other probably barely bound, but possibly marginally unbound. Gravity has noticeably slowed the Hubble expansion of both superclusters. Galaxy surface-density counts and the density enhancement of Abell clusters within each supercluster were used to derive the ratio of mass densities of the superclusters to the mean field mass density. The results strongly exclude a closed universe.

Ford, H. C.↗

NCUBE - A clustering algorithm based on a discretized data space

Cluster analysis involves the unsupervised grouping of data. The process provides an automatic procedure for generating known training samples for pattern classification. NCUBE, the clustering algorithm presented, is based upon the concept of imposing a gridwork on the data space. The NCUBE computer implementation of this concept provides an easily derived form of piecewise linear discrimination. This piecewise linear discrimination permits the separation of some types of data groups that are not linearly separable.

Eigen, D. J.↗

The evaluation of alternate methodologies for land cover classification in an urbanizing area

The usefulness of LANDSAT in classifying land cover and in identifying and classifying land use change was investigated using an urbanizing area as the study area. The question of what was the best technique for classification was the primary focus of the study. The many computer-assisted techniques available to analyze LANDSAT data were evaluated. Techniques of statistical training (polygons from CRT, unsupervised clustering, polygons from digitizer and binary masks) were tested with minimum distance to the mean, maximum likelihood and canonical analysis with minimum distance to the mean classifiers. The twelve output images were compared to photointerpreted samples, ground verified samples and a current land use data base. Results indicate that for a reconnaissance inventory, the unsupervised training with canonical analysis-minimum distance classifier is the most efficient. If more detailed ground truth and ground verification is available, the polygons from the digitizer training with the canonical analysis minimum distance is more accurate.

Smekofski, R. M.↗