Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distribution Grid”

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 127 records · Page 7

Globally Gridded Satellite (GridSat) Observations for Climate Studies

Geostationary satellites have provided routine, high temporal resolution Earth observations since the 1970s. Despite the long period of record, use of these data in climate studies has been limited for numerous reasons, among them: there is no central archive of geostationary data for all international satellites, full temporal and spatial resolution data are voluminous, and diverse calibration and navigation formats encumber the uniform processing needed for multi-satellite climate studies. The International Satellite Cloud Climatology Project set the stage for overcoming these issues by archiving a subset of the full resolution geostationary data at approx.10 km resolution at 3 hourly intervals since 1983. Recent efforts at NOAA s National Climatic Data Center to provide convenient access to these data include remapping the data to a standard map projection, recalibrating the data to optimize temporal homogeneity, extending the record of observations back to 1980, and reformatting the data for broad public distribution. The Gridded Satellite (GridSat) dataset includes observations from the visible, infrared window, and infrared water vapor channels. Data are stored in the netCDF format using standards that permit a wide variety of tools and libraries to quickly and easily process the data. A novel data layering approach, together with appropriate satellite and file metadata, allows users to access GridSat data at varying levels of complexity based on their needs. The result is a climate data record already in use by the meteorological community. Examples include reanalysis of tropical cyclones, studies of global precipitation, and detection and tracking of the intertropical convergence zone.

Knapp, Kenneth R.↗

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces.

Mastin, E. W.↗

Adaptive grids generated by elliptic systems

It is pointed out that a finite difference grid which moves with the solution of the partial differential equation being solved can improve the accuracy and efficiency of a numerical algorithm. This technique is particularly advantageous in the solution of problems involving boundary layers or shocks where a poorly chosen grid may give a numerical solution which is useless because of poor resolution or extreme oscillations. The present investigation is concerned with the development of a scheme which does not excessively distort the grid. The grid generation algorithm is based on the numerical solution of a system of elliptic differential equations. Holst and Brown (1981) have used a preliminary solution to move points on the boundary of the physical region and then resolved the problem on a new grid generated by an elliptic system. In the current investigation, the grid movement and the solution will develop simultaneously. The solution is used to modify the generating equations, thereby controlling the grid point distributions.

Mastin, C. W.↗

A practical adaptive-grid method for complex fluid-flow problems

A practical solution, adaptive-grid method utilizing a tension and torsion spring analogy is proposed for multidimensional fluid flow problems. The tension spring, which connects adjacent grid points to each other, controls grid spacings. The torsion spring, which is attached to each grid node, controls inclinations of coordinate lines and grid skewness. A marching procedure was used that results in a simple tridiagonal system of equations at each coordinate line to determine grid-point distribution. Multidirectional adaptation is achieved by successive applications of one-dimensional adaptation. Examples of applications for axisymmetric afterbody flow fields and two dimensional transonic airfoil flow fields are shown.

Nakahashi, K.↗

NASA Sea Ice Validation Program for the Defense Meteorological Satellite Program Special Sensor Microwave Imager

The history of the program is described along with the SSM/I sensor, including its calibration and geolocation correction procedures used by NASA, SSM/I data flow, and the NASA program to distribute polar gridded SSM/I radiances and sea ice concentrations (SIC) on CD-ROMs. Following a discussion of the NASA algorithm used to convert SSM/I radiances to SICs, results of 95 SSM/I-MSS Landsat IC comparisons for regions in both the Arctic and the Antarctic are presented. The Landsat comparisons show that the overall algorithm accuracy under winter conditions is 7 pct. on average with 4 pct. negative bias. Next, high resolution active and passive microwave image mosaics from coordinated NASA and Navy aircraft underflights over regions of the Beaufort and Chukchi seas in March 1988 were used to show that the algorithm multiyear IC accuracy is 11 pct. on average with a positive bias of 12 pct. Ice edge crossings of the Bering Sea by the NASA DC-8 aircraft were used to show that the SSM/I 15 pct. ice concentration contour corresponds best to the location of the initial bands at the ice edge. Finally, a summary of results and recommendations for improving the SIC retrievals from spaceborne radiometers are provided.

Cavalieri, Donald J.↗

Contour advection with surgery: A technique for investigating finescale structure in tracer transport

We present a trajectory technique, contour advection with surgery (CAS), for tracing the evolution of material contours in a specified (including observed) evolving flow. CAS uses the algorithms developed by Dritschel for contour dynamics/surgery to trace the evolution of specified contours. The contours are represented by a series of particles, which are advected by a specified, gridded, wind distribution. The resolution of the contours is preserved by continually adjusting the number of particles, and finescale features are produced that are not present in the input data (and cannot easily be generated using standard trajectory techniques). The reliability, and dependence on the spatial and temporal resolution of the wind field, of the CAS procedure is examined by comparisons with high-resolution numerical data (from contour dynamics calculations and from a general circulation model), and with routine stratospheric analyses. These comparisons show that the large-scale motions dominate the deformation field and that CAS can accurately reproduce small scales from low-resolution wind fields. The CAS technique therefore enables examination of atmospheric tracer transport at previously unattainable resolution.

Waugh, Darryn W.↗

A Latency-Tolerant Partitioner for Distributed Computing on the Information Power Grid

NASA's Information Power Grid (IPG) is an infrastructure designed to harness the power of graphically distributed computers, databases, and human expertise, in order to solve large-scale realistic computational problems. This type of a meta-computing environment is necessary to present a unified virtual machine to application developers that hides the intricacies of a highly heterogeneous environment and yet maintains adequate security. In this paper, we present a novel partitioning scheme. called MinEX, that dynamically balances processor workloads while minimizing data movement and runtime communication, for applications that are executed in a parallel distributed fashion on the IPG. We also analyze the conditions that are required for the IPG to be an effective tool for such distributed computations. Our results show that MinEX is a viable load balancer provided the nodes of the IPG are connected by a high-speed asynchronous interconnection network.

Das, Sajal K.↗

A Survey of Collectives

Due to the increasing sophistication and miniaturization of computational components, complex, distributed systems of interacting agents are becoming ubiquitous. Such systems, where each agent aims to optimize its own performance, but where there is a well-defined set of system-level performance criteria, are called collectives. The fundamental problem in analyzing/designing such systems is in determining how the combined actions of self-interested agents leads to 'coordinated' behavior on a iarge scale. Examples of artificial systems which exhibit such behavior include packet routing across a data network, control of an array of communication satellites, coordination of multiple deployables, and dynamic job scheduling across a distributed computer grid. Examples of natural systems include ecosystems, economies, and the organelles within a living cell. No current scientific discipline provides a thorough understanding of the relation between the structure of collectives and how well they meet their overall performance criteria. Although still very young, research on collectives has resulted in successes both in understanding and designing such systems. It is eqected that as it matures and draws upon other disciplines related to collectives, this field will greatly expand the range of computationally addressable tasks. Moreover, in addition to drawing on them, such a fully developed field of collective intelligence may provide insight into already established scientific fields, such as mechanism design, economics, game theory, and population biology. This chapter provides a survey to the emerging science of collectives.

Tumer, Kagan↗

Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D showed that HPF has potential to be a high level language for parallelization of CFD applications. The use of HPF requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement and data granularity. Since HPF hides data movement from the user even with this knowledge it is easy to overlook pieces of the code causing low performance of the application. In order to simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and partially implemented ADAPT (Automatic Data Distribution and Placement Tool). The ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level or inter application level. ADAPT is designed to annotate existing CFD FORTRAN application performing computations on single or multiple grids. On each grid the application can considered as a sequence of operators each applied to a set of variables defined in a particular grid domain. The operators can be classified as implicit, having data dependences, and explicit, without data dependences. In order to parallelize an explicit operator it is sufficient to create a template for the domain of the operator, align arrays used in the operator with the template, distribute the template, and declare the loops over the distributed dimensions as INDEPENDENT. In order to parallelize an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator then the loop which implements the operator can be declared as INDEPENDENT.

Frumkin, Michael↗

The Montage architecture for grid-enabled science processing of large, distributed datasets

Montage is an Earth Science Technology Office (ESTO) Computational Technologies (CT) Round III Grand Challenge investigation to deploy a portable, compute-intensive, custom astronomical image mosaicking service for the National Virtual Observatory (NVO). Although Montage is developing a compute- and data-intensive service for the astronomy community, we are also helping to address a problem that spans both Earth and Space science, namely how to efficiently access and process multi-terabyte, distributed datasets. In both communities, the datasets are massive, and are stored in distributed archives that are, in most cases, remote from the available Computational resources. Therefore, state of the art computational grid technologies are a key element of the Montage portal architecture. This paper describes the aspects of the Montage design that are applicable to both the Earth and Space science communities.

virtual observatory↗

Grid-Sphere Current Collection in View of the TSS-1, TSS-1R Mission Results

Passive end-body contactors have been validated in space and provide a simple, effective and robust means of current collection at the positive terminal of an electrodynamic tether system. The grid-sphere has been first suggested by Stone and Gierow, [2001] as the end body that has distinct advantages, compare to solid sphere, lower dynamic drag and higher current-to-mass ratio. This paper presents the estimation of upper limit of current collection by grid-sphere that takes into account the orbital grid-sphere motion, and the ions production inside the grid-sphere. We review the current collection of Tethered Satellite System (TSS-1) flight and of the TSS-1R flights results and suggest how to incorporate them into the grid-sphere current collection estimations. The potential distribution inside the grid-sphere and the potential distribution outside the solid sphere for the same system parameters are calculated. Assuming that the grid- sphere is characterized by the transparency alpha, equal approximately to the ratio of the part of the sphere surface without the mesh to it's total surface, the upper limit of it's current collection is estimated.

Khazanov, G. V.↗

Collaborative Simulation Grid: Multiscale Quantum-Mechanical/Classical Atomistic Simulations on Distributed PC Clusters in the US and Japan

A multidisciplinary, collaborative simulation has been performed on a Grid of geographically distributed PC clusters. The multiscale simulation approach seamlessly combines i) atomistic simulation backed on the molecular dynamics (MD) method and ii) quantum mechanical (QM) calculation based on the density functional theory (DFT), so that accurate but less scalable computations are performed only where they are needed. The multiscale MD/QM simulation code has been Grid-enabled using i) a modular, additive hybridization scheme, ii) multiple QM clustering, and iii) computation/communication overlapping. The Gridified MD/QM simulation code has been used to study environmental effects of water molecules on fracture in silicon. A preliminary run of the code has achieved a parallel efficiency of 94% on 25 PCs distributed over 3 PC clusters in the US and Japan, and a larger test involving 154 processors on 5 distributed PC clusters is in progress.

Kikuchi, Hideaki↗

High-Order Residual-Distribution Schemes for Discontinuous Problems on Irregular Triangular Grids

In this paper, we develop second- and third-order non-oscillatory shock-capturing hyperbolic residual distribution schemes for irregular triangular grids, extending our second- and third-order schemes to discontinuous problems. We present extended first-order N- and Rusanov-scheme formulations for hyperbolic advection-diffusion system, and demonstrate that the hyperbolic diffusion term does not affect the solution of inviscid problems for vanishingly small viscous coefficient. We then propose second- and third-order blended hyperbolic residual-distribution schemes with the extended first-order Rusanov-scheme. We show that these proposed schemes are extremely accurate in predicting non-oscillatory solutions for discontinuous problems. We also propose a characteristics-based nonlinear wave sensor for accurately detecting shocks, compression, and expansion regions. Using this proposed sensor, we demonstrate that the developed hyperbolic blended schemes do not produce entropy-violating solutions (unphysical stocks). We then verify the design order of accuracy of these blended schemes on irregular triangular grids.

Mazaheri, Alireza↗

A three-dimensional adaptive grid method

A three-dimensional solution-adaptive-grid scheme is described which is suitable for complex fluid flows. This method, using tension and torsion spring analogies, was previously developed and successfully applied for two-dimensional flows. In the present work, a collection of three-dimensional flow fields are used to demonstrate the feasibility and versatility of this concept to include an added dimension. Flow fields considered include: (1) supersonic flow past an aerodynamic afterbody with a propulsive jet at incidence to the free stream, (2) supersonic flow past a blunt fin mounted on a solid wall, and (3) supersonic flow over a bump. In addition to generating three-dimensional solution-adapted grids, the method can also be used effectively as an initial grid generator. The utility of the method lies in: (1) optimum distribution of discrete grid points, (2) improvement of accuracy, (3) improved computational efficiency, (4) minimization of data base sizes, and (5) simplified three-dimensional grid generation.

Nakahashi, K.↗

Research on Spectroscopy, Opacity, and Atmospheres

A web site has been set up to make the calculations accessible; (i.e., cfakus.harvard.edu) This data can also be accessed by FTP. It has all of the atomic and diatomic molecular data, tables of distribution function opacities, grids of model atmospheres, colors, fluxes, etc, programs that are ready for distribution, and most of recent papers developed during this grant. Atlases and computed spectra will be added as they are completed. New atomic and molecular calculations will be added as they are completed. The atomic programs that had been running on a Cray at the San Diego Supercomputer Center can now run on the Vaxes and Alpha. The work started with Ni and Co because there were new laboratory analyses that included isotopic and hyperfine splitting. Those calculations are described in the appended abstract for the 6th Atomic Spectroscopy and oscillator Strengths meeting in Victoria last summer. A surprising finding is that quadrupole transitions have been grossly in error because mixing with higher levels has not been included. All levels up through n=9 for Fe I and II, the spectra for which the most information is available, are now included. After Fe I and Fe II, all other spectra are "easy". ATLAS12, the opacity sampling program for computing models with arbitrary abundances, has been put on the web server. A new distribution function opacity program for workstations that replaces the one used on the Cray at the San Diego Supercomputer Center has been written. Each set of abundances would take 100 Cray hours costing $100,000.

Kurucz, Robert L.↗

Large-Scale Distributed Computational Fluid Dynamics on the Information Power Grid Using Globus

This paper describes an experiment in which a large-scale scientific application development for tightly-coupled parallel machines is adapted to the distributed execution environment of the Information Power Grid (IPG). A brief overview of the IPG and a description of the computational fluid dynamics (CFD) algorithm are given. The Globus metacomputing toolkit is used as the enabling device for the geographically-distributed computation. Modifications related to latency hiding and Load balancing were required for an efficient implementation of the CFD application in the IPG environment. Performance results on a pair of SGI Origin 2000 machines indicate that real scientific applications can be effectively implemented on the IPG; however, a significant amount of continued effort is required to make such an environment useful and accessible to scientists and engineers.

Barnard, Stephen↗

Distributed Computing Framework for Synthetic Radar Application

We are developing an extensible software framework, in response to Air Force and NASA needs for distributed computing facilities for a variety of radar applications. The objective of this work is to develop a Python based software framework, that is the framework elements of the middleware that allows developers to control processing flow on a grid in a distributed computing environment. Framework architectures to date allow developers to connect processing functions together as interchangeable objects, thereby allowing a data flow graph to be devised for a specific problem to be solved. The Pyre framework, developed at the California Institute of Technology (Caltech), and now being used as the basis for next-generation radar processing at JPL, is a Python-based software framework. We have extended the Pyre framework to include new facilities to deploy processing components as services, including components that monitor and assess the state of the distributed network for eventual real-time control of grid resources.

synthetic aperture radar (SAR)↗