Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed 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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Joint analysis of multiparameter radar and radiometer measurements of convective storms

An account is given of the radiative properties of hydrometeors in order to evaluate the influences of water, ice, and melting layers on the upwelling microwave radiances of convective storms. Attention is given to storm overflights conducted by the ER-2 aircraft in coordination with the NCAR dual-polarization/dual-wavelength mode radar. Radar-radiometer comparisons are conducted for one overflight from each day of the study campaign, using the various multiparameter radar observations to delineate regions of water, ice, and melting, as well as to obtain raindrop-size distribution. Model-computed brightness temperatures are compared with the ER-2 aircraft measurements.

Vivekanandan, J.↗
NASA NTRS1990

The evolution of horizontal-branch stars - Theoretical sequences

A new grid of standard (i.e., solar CNO/Fe, no core rotation, and including semiconvection) horizontal-branch evolutionary sequences are presented which extend the grid of Sweigart both by including the final phase of core helium exhaustion and by using a finer grid of compositions. These sequences were constructed specifically for the studies of the Sandage period-shift effect and the second parameter phenomenon among the Galactic globular clusters. The numerical results for the observable characteristics of the sequences are tabulated which can be directly used to synthesize the observed horizontal-branch distributions. The present computations suggest that the observed difference in period change of RR Lyrae stars in the globular clusters M3 and M15 could be attributed, at least in the mean, to stellar evolution.

Lee, Young-Wook↗
NASA NTRS1990

Relative efficiency and accuracy of two Navier-Stokes codes for simulating attached transonic flow over wings

In the present study, two codes which solve the three-dimensional Thin-Layer Navier-Stokes (TLNS) equations are used to compute the steady-state flow for two test cases representing typical finite wings at transonic conditions. Several grids of C-O topology and varying point densities are used. After a description of each code and test case, standards for determining code efficiency and accuracy are defined and applied to determine the relative performance of the two codes in predicting turbulent transonic wing flows. Comparisons of computed surface pressure distributions with experimental data are made.

Bonhaus, Daryl L.↗
NASA NTRS1991

Relative efficiency and accuracy of two Navier-Stokes codes for simulating attached transonic flow over wings

Two codes which solve the 3-D Thin Layer Navier-Stokes (TLNS) equations are used to compute the steady state flow for two test cases representing typical finite wings at transonic conditions. Several grids of C-O topology and varying point densities are used to determine the effects of grid refinement. After a description of each code and test case, standards for determining code efficiency and accuracy are defined and applied to determine the relative performance of the two codes in predicting turbulent transonic wing flows. Comparisons of computed surface pressure distributions with experimental data are made.

Bonhaus, Daryl L.↗
NASA NTRS1991

Multiphase complete exchange on a circuit switched hypercube

On a distributed memory parallel computer, the complete exchange (all-to-all personalized) communication pattern requires each of n processors to send a different block of data to each of the remaining n - 1 processors. This pattern is at the heart of many important algorithms, most notably the matrix transpose. For a circuit switched hypercube of dimension d(n = 2(sup d)), two algorithms for achieving complete exchange are known. These are (1) the Standard Exchange approach that employs d transmissions of size 2(sup d-1) blocks each and is useful for small block sizes, and (2) the Optimal Circuit Switched algorithm that employs 2(sup d) - 1 transmissions of 1 block each and is best for large block sizes. A unified multiphase algorithm is described that includes these two algorithms as special cases. The complete exchange on a hypercube of dimension d and block size m is achieved by carrying out k partial exchange on subcubes of dimension d(sub i) Sigma(sup k)(sub i=1) d(sub i) = d and effective block size m(sub i) = m2(sup d-di). When k = d and all d(sub i) = 1, this corresponds to algorithm (1) above. For the case of k = 1 and d(sub i) = d, this becomes the circuit switched algorithm (2). Changing the subcube dimensions d, varies the effective block size and permits a compromise between the data permutation and block transmission overhead of (1) and the startup overhead of (2). For a hypercube of dimension d, the number of possible combinations of subcubes is p(d), the number of partitions of the integer d. This is an exponential but very slowly growing function and it is feasible over these partitions to discover the best combination for a given message size. The approach was analyzed for, and implemented on, the Intel iPSC-860 circuit switched hypercube. Measurements show good agreement with predictions and demonstrate that the multiphase approach can substantially improve performance for block sizes in the 0 to 160 byte range. This range, which corresponds to 0 to 40 floating point numbers per processor, is commonly encountered in practical numeric applications. The multiphase technique is applicable to all circuit-switched hypercubes that use the common e-cube routing strategy.

Bokhari, Shahid H.↗
NASA NTRS1989

Projection methods for the numerical solution of Markov chain models

Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.

Saad, Youcef↗
NASA NTRS1991

ISE advanced technology

Information on Space Station Freedom scheduling problems and techniques are presented in viewgraph form. Topics covered include automated scheduling systems, user interface standards, benefits of interactive scheduling systems, incremental scheduling, software engineering, computer graphics interface, distributed resource management, and advanced applications.

Fox, Barry R.↗
NASA NTRS1992

High order parallel numerical schemes for solving incompressible flows

The use of parallel computers for numerically solving flow fields has gained much importance in recent years. This paper introduces a new high order numerical scheme for computational fluid dynamics (CFD) specifically designed for parallel computational environments. A distributed MIMD system gives the flexibility of treating different elements of the governing equations with totally different numerical schemes in different regions of the flow field. The parallel decomposition of the governing operator to be solved is the primary parallel split. The primary parallel split was studied using a hypercube like architecture having clusters of shared memory processors at each node. The approach is demonstrated using examples of simple steady state incompressible flows. Future studies should investigate the secondary split because, depending on the numerical scheme that each of the processors applies and the nature of the flow in the specific subdomain, it may be possible for a processor to seek better, or higher order, schemes for its particular subcase.

Lin, Avi↗
NASA NTRS1991

Engineering method for aero-propulsive characteristics at hypersonic Mach numbers

An engineering method has been developed for the rapid analysis of external aerodynamics and propulsive performance characteristics of airbreathing vehicles at hypersonic Mach numbers. This method, based on the theory of characteristics, has been developed to analyze fuselage-wing body combinations and body flaps with blunt or sharp leading/trailing edges. Arbitrary ratio of specific heat for the flowing medium can be specified in the program. Furthermore, the capability exists in the code to compute the inviscid inlet mass capture and momentum flux. The method is under development for computations of pressure distribution, and flow characteristics in the inlet, along with the effect of viscosity. Correlative studies have been performed for representative hypersonic configurations using the current method. The results of these correlations for various aerodynamics parameters are encouraging.

Goradia, Suresh↗
NASA NTRS1992

Extension and validation of an unsteady wake model for rotors

A new three-dimensional, finite-state induced-flow model is extended to treat nonlinearities associated with the mass flow induced through the rotor plane. This new theory is then applied to the correlation of a recent set of unsteady, hover laser Doppler velocimetry inflow measurements conducted in the Aeroelastic Rotor Test Chamber at Georgia Institute of Technology. Although the model is intended primarily as a representation of unsteady aerodynamics for aeroelasticity applications, the results show that it has an excellent capability in predicting the inflow distribution in hover except near the root and tip. In addition, the computed unsteady spanwise lift distribution of a rotor is compared with that from an unsteady vortex lattice method for pitch oscillations at various frequencies. The new model is shown to be capable of prediction of unsteady loads typical of aeroelastic response.

Su, AY↗
NASA NTRS1992

A real-time diagnostic and performance monitor for UNIX

There are now over one million UNIX sites and the pace at which new installations are added is steadily increasing. Along with this increase, comes a need to develop simple efficient, effective and adaptable ways of simultaneously collecting real-time diagnostic and performance data. This need exists because distributed systems can give rise to complex failure situations that are often un-identifiable with single-machine diagnostic software. The simultaneous collection of error and performance data is also important for research in failure prediction and error/performance studies. This paper introduces a portable method to concurrently collect real-time diagnostic and performance data on a distributed UNIX system. The combined diagnostic/performance data collection is implemented on a distributed multi-computer system using SUN4's as servers. The approach uses existing UNIX system facilities to gather system dependability information such as error and crash reports. In addition, performance data such as CPU utilization, disk usage, I/O transfer rate and network contention is also collected. In the future, the collected data will be used to identify dependability bottlenecks and to analyze the impact of failures on system performance.

Dong, Hongchao↗
NASA NTRS1992

National Space Science Data Center data archive and distribution service (NDADS) automated retrieval mail system user's guide

The National Space Science Data Center (NSSDC) has developed an automated data retrieval request service utilizing our Data Archive and Distribution Service (NDADS) computer system. NDADS currently has selected project data written to optical disk platters with the disks residing in a robotic 'jukebox' near-line environment. This allows for rapid and automated access to the data with no staff intervention required. There are also automated help information and user services available that can be accessed. The request system permits an average-size data request to be completed within minutes of the request being sent to NSSDC. A mail message, in the format described in this document, retrieves the data and can send it to a remote site. Also listed in this document are the data currently available.

Perry, Charleen M.↗
NASA NTRS1993

The velocity dispersion of the caustic network due to random motion of individual stars in the lensing galaxy

We present a method of computing the velocity distribution of the caustic network due to the random motion of stars in the lensing galaxy. This method is illustrated on the example of the two-point mass lens and then applied to a large sample of stars. We conclude that the proper motion of the stars increases significantly the frequency of the high magnification events in comparison with a static lens configuration with constant stream or constant bulk velocity. The stream velocity is the velocity of the star field relative to the global bulk velocity of the galaxy. We show that the global bulk and the stream velocity of the star field have to be considered separately for any microlensing situation. The higher the surface mass density of the stars in the lensing galaxy, the higher the influence of proper motion of stars on the statistics of high magnification events. The influence of a Gaussian velocity distribution of the stars in the lensing galaxy compared with a constant stream velocity of the stars increases the number of high magnification events by a factor 1.30 +/- 0.06 for a normalized surface density of the stars cr = 0.1 and by a factor 1.7 +/- 0.1 for sigma = 0.5. This means that for some microlensing situations the proper motion of the stars in a lensing galaxy has to be considered for exact microlensing predictions.

Kundik, Tomislav↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance FORTRAN. We show that, for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution and a computation involving the regular section A(l:h:s), the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little run-time overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1989

Communications among elements of a space construction ensemble

Space construction projects will require careful coordination between managers, designers, manufacturers, operators, astronauts, and robots with large volumes of information of varying resolution, timeliness, and accuracy flowing between the distributed participants over computer communications networks. Within the CSC Operations Branch, we are researching the requirements and options for such communications. Based on our work to date, we feel that communications standards being developed by the International Standards Organization, the CCITT, and other groups can be applied to space construction. We are currently studying in depth how such standards can be used to communicate with robots and automated construction equipment used in a space project. Specifically, we are looking at how the Manufacturing Automation Protocol (MAP) and the Manufacturing Message Specification (MMS), which tie together computers and machines in automated factories, might be applied to space construction projects. Together with our CSC industrial partner Computer Technology Associates, we are developing a MAP/MMS companion standard for space construction and we will produce software to allow the MAP/MMS protocol to be used in our CSC operations testbed.

Davis, Randal L.↗
NASA NTRS1993

Generating local addresses and communication sets for data-parallel programs

Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as High Performance Fortran. We show that for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution, and a computation involving the regular section A, the local memory access sequence for any processor is characterized by a finite state machine of at most k states. We present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. We also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little runtime overhead and acceptable preprocessing time.

Chatterjee, Siddhartha↗
NASA NTRS1994

Ozone transport during a cut-off low event studied in the frame of the TOASTE program

A study of ozone transfer to the troposphere has been performed during two phases of the evolution of a cut-off low using both ozone vertical profiles and objective analysis of the ECMWF to compute potential vorticity distributions and air mass trajectories. Ozone profiles were measured by a ground based lidar system at the Observatoire de Haute Provence (OHP, 43 deg 55 N, 5 deg 42 E). A stratospheric ozone transport into the troposphere has been observed during a tropopause fold which occurred at the beginning of the cut-off low formation and during the erosion phase of the cut-off low. From the estimate of the maximum ozone content transferred to the troposphere, both mechanisms have the same order of magnitude of influence on the ozone flux to the troposphere. On a time scale of a few days, the correlation is very good between the potential vorticity and the ozone time evolution in the vicinity of the upper level frontal system.

Ancellet, G.↗
NASA NTRS1994

Unstructured grids on SIMD torus machines

Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. Here, we consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance.

Bjorstad, Petter E.↗