Search NASA⌕ Search

SEARCH · Search NASA

Results for “Partitioned scheme”

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 109 records · Page 6

A MIMD implementation of a parallel Euler solver for unstructured grids

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a MIMD (multiple instruction/multiple data stream) parallel computer. Three partitioning strategies for distributing the work load onto the processors are discussed. Issues pertaining to the communication costs are also addressed. We find that the spectral bisection strategy yields the best performance. The performance of this unstructured computation on the Intel iPSC/860 compares very favorably with that on a one-processor CRAY Y-MP/1 and an earlier implementation on the Connection Machine.

Venkatakrishnan, V.↗

A scheme for parameterizing cirrus cloud ice water content in general circulation models

Clouds strongly influence th earth's energy budget. They control th amount of solar radiative energy absorbed by the climate system, partitioning the energy between the atmosphere and the earth's surface. They also control the loss of energy to space by their effect on thermal emission. Cirrus and altostratus are the most frequent cloud types, having an annual average global coverage of 35 and 40 percent, respectively. Cirrus is composed almost entirely of ice crystals and the same is frequently true of the upper portions of altostratus since they are often formed by the thickening of cirrostratus and by the spreading of the middle or upper portions of thunderstorms. Thus, since ice clouds cover such a large portion of the earth's surface, they almost certainly have an important effect on climate. With this recognition, researchers developing climate models are seeking largely unavailable methods for specifying the conditions for ice cloud formation, and quantifying the spatial distribution of ice water content, IWC, a necessary step in deriving their radiative characteristics since radiative properties are apparently related to IWC. A method is developed for specifying IWC in climate models, based on theory and measurements in cirrus during FIRE and other experiments.

Heymsfield, Andrew J.↗

Studies on image compression and image reconstruction

During this six month period our works concentrated on three, somewhat different areas. We looked at and developed a number of error concealment schemes for use in a variety of video coding environments. This work is described in an accompanying (draft) Masters thesis. In the thesis we describe application of this techniques to the MPEG video coding scheme. We felt that the unique frame ordering approach used in the MPEG scheme would be a challenge to any error concealment/error recovery technique. We continued with our work in the vector quantization area. We have also developed a new type of vector quantizer, which we call a scan predictive vector quantization. The scan predictive VQ was tested on data processed at Goddard to approximate Landsat 7 HRMSI resolution and compared favorably with existing VQ techniques. A paper describing this work is included. The third area is concerned more with reconstruction than compression. While there is a variety of efficient lossless image compression schemes, they all have a common property that they use past data to encode future data. This is done either via taking differences, context modeling, or by building dictionaries. When encoding large images, this common property becomes a common flaw. When the user wishes to decode just a portion of the image, the requirement that the past history be available forces the decoding of a significantly larger portion of the image than desired by the user. Even with intelligent partitioning of the image dataset, the number of pixels decoded may be four times the number of pixels requested. We have developed an adaptive scanning strategy which can be used with any lossless compression scheme and which lowers the additional number of pixels to be decoded to about 7 percent of the number of pixels requested! A paper describing these results is included.

Sayood, Khalid↗

Conservative zonal schemes for patched grids in 2 and 3 dimensions

The computation of flow over complex geometries, such as realistic aircraft configurations, poses difficult grid generation problems for computational aerodynamicists. The creation of a traditional, single-module grid of acceptable quality about an entire configuration may be impossible even with the most sophisticated of grid generation techniques. A zonal approach, wherein the flow field is partitioned into several regions within which grids are independently generated, is a practical alternative for treating complicated geometries. This technique not only alleviates the problems of discretizing a complex region, but also facilitates a block processing approach to computation thereby circumventing computer memory limitations. The use of such a zonal scheme, however, requires the development of an interfacing procedure that ensures a stable, accurate, and conservative calculation for the transfer of information across the zonal borders.

Hessenius, Kristin A.↗

Robust contour decomposition using a constant curvature criterion

The problem of decomposing an extended boundary or contour into simple primitives is addressed with particular emphasis on Laplacian-of-Gaussian (LoG) zero-crossing contours. A technique is introduced for partitioning such contours into constant curvature segments. A nonlinear `blip' filter matched to the impairment signature of the curvature computation process, an overlapped voting scheme, and a sequential contiguous segment extraction mechanism are used. This technique is insensitive to reasonable changes in algorithm parameters and robust to noise and minor viewpoint-induced distortions in the contour shape, such as those encountered between stereo image pairs. The results vary smoothly with the data, and local perturbations induce only local changes in the result. Robustness and insensitivity are experimentally verified.

Wuescher, Daniel M.↗

A Test of Sensitivity to Convective Transport in a Global Atmospheric CO2 Simulation

Two approximations to convective transport have been implemented in an offline chemistry transport model (CTM) to explore the impact on calculated atmospheric CO2 distributions. GlobalCO2 in the year 2000 is simulated using theCTM driven by assimilated meteorological fields from the NASA s Goddard Earth Observation System Data Assimilation System, Version 4 (GEOS-4). The model simulates atmospheric CO2 by adopting the same CO2 emission inventory and dynamical modules as described in Kawa et al. (convective transport scheme denoted as Conv1). Conv1 approximates the convective transport by using the bulk convective mass fluxes to redistribute trace gases. The alternate approximation, Conv2, partitions fluxes into updraft and downdraft, as well as into entrainment and detrainment, and has potential to yield a more realistic simulation of vertical redistribution through deep convection. Replacing Conv1 by Conv2 results in an overestimate of CO2 over biospheric sink regions. The largest discrepancies result in a CO2 difference of about 7.8 ppm in the July NH boreal forest, which is about 30% of the CO2 seasonality for that area. These differences are compared to those produced by emission scenario variations constrained by the framework of Intergovernmental Panel on Climate Change (IPCC) to account for possible land use change and residual terrestrial CO2 sink. It is shown that the overestimated CO2 driven by Conv2 can be offset by introducing these supplemental emissions.

Bian, H.↗

LDAS Land Data Assimilation Systems

The land-surface component of the hydrological cycle is fundamental to the overall functioning of the atmospheric and climate processes. The characterization of the spatial and temporal variability of water and energy cycles is critical to improve our understanding of the land-surface-atmosphere interaction and the impact of land-surface processes on climate extremes. Because the accurate knowledge of these processes and their variability is important for climate predictions, most Numerical Weather Prediction (NWP) centers have incorporated land-surface schemes in their models. However, errors in the NWP forcing accumulate in the surface and energy stores, leading to incorrect surface water and energy partitioning and related processes.

data↗

Representing the Sub-Grid Heterogeneity of Surface Precipitation in A General Circulation Model

Precipitation variability on spatial scales smaller than a typical general circulation model (GCM) grid box is often neglected, with the grid-mean precipitation rate being applied uniformly to underlying surface tiles. This reduces the extrema seen by the surface, with corresponding reductions in surface runoff and altered land-atmosphere fluxes. Here we present a novel approach to stochastically distribute precipitation across sub-grid surface tiles within a GCM. Based on 4 km Stage IV precipitation data, the scheme parameterizes the dry area fraction as a function of grid mean precipitation rate, and defines the relative distribution of intensities across non-dry surface tiles. To incorporate memory and mimic the persistence of precipitating storms, the relative intensity assigned to each sub-grid tile is determined by an autoregressive process. Using single column experiments, the scheme is shown to reproduce observed precipitation statistics at the scale of model surface tiles. We also document impacts on surface hydrology and energy partitioning, with notable increases in precipitation runoff, surface temperature variance, and the Bowen ratio.

GCM↗

PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes

Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at a fraction of the cost required a fine initial mesh. Results indicate that our parallel load balancing strategy will remain viable on large numbers of processors.

Oliker, Leonid↗

Coding for Communication Channels with Dead-Time Constraints

Coding schemes have been designed and investigated specifically for optical and electronic data-communication channels in which information is conveyed via pulse-position modulation (PPM) subject to dead-time constraints. These schemes involve the use of error-correcting codes concatenated with codes denoted constrained codes. These codes are decoded using an interactive method. In pulse-position modulation, time is partitioned into frames of Mslots of equal duration. Each frame contains one pulsed slot (all others are non-pulsed). For a given channel, the dead-time constraints are defined as a maximum and a minimum on the allowable time between pulses. For example, if a Q-switched laser is used to transmit the pulses, then the minimum allowable dead time is the time needed to recharge the laser for the next pulse. In the case of bits recorded on a magnetic medium, the minimum allowable time between pulses depends on the recording/playback speed and the minimum distance between pulses needed to prevent interference between adjacent bits during readout. The maximum allowable dead time for a given channel is the maximum time for which it is possible to satisfy the requirement to synchronize slots. In mathematical shorthand, the dead-time constraints for a given channel are represented by the pair of integers (d,k), where d is the minimum allowable number of zeroes between ones and k is the maximum allowable number of zeroes between ones. A system of the type to which the present schemes apply is represented by a binary- input, real-valued-output channel model illustrated in the figure. At the transmitting end, information bits are first encoded by use of an error-correcting code, then further encoded by use of a constrained code. Several constrained codes for channels subject to constraints of (d,infinity) have been investigated theoretically and computationally. The baseline codes chosen for purposes of comparison were simple PPM codes characterized by M-slot PPM frames separated by d-slot dead times.

Moision, Bruce↗

Evaluating the performance of multicomputer configurations

Steps to optimize the performance of a multicomputer system (MCS) are discussed. Three aspects are emphasized: (1) the interconnection scheme that ties all the processors together, (2) the scheduling and mapping of the algorithm on the architecture, and (3) the mechanism for detecting parallelism and partitioning the algorithm into modules which achieve computational speedup when run on an MCS. Mapping and scheduling issues are addressed, and an application example is given.

Agrawal, D. P.↗

Dependence of Z-R Relations on the Rain Type Classification Scheme

The TRMM Global Validation Program is giving us a unique opportunity to compare radar datasets from different sites since they are analyzed in a relatively uniform procedure. Monthly Ze-R relations for four different sites (i.e, Melbourne Florida, Houston Texas, Darwin Australia and Kwajalein Atoll) were derived. The relations were obtained using the Window Probability Matching Method (WPMM). This version of the PMM relies on matching unconditional probabilities of rain rates, R, and radar reflectivity, Ze, using rain gauge and radar data, respectively. This procedure was done separately for convective and stratiform rain type using the Steiner classification procedure. The radar and gauge data from all sites were quality controlled using the same algorithms, which include also an automatic procedure to filter unreliable rain gauge data upon comparison to radar data. An adjusted power law Z-R for each rain type was also derived by comparing the radar-gauge coincident pairs in order to adjust the total monthly rainfall to match the gauges. The obtained PMM based Ze-R relations are found to be curved lines in log-log space rather than any straight line power law. While the PMM based Ze-R curves were always distinctly different between the convective and stratiform rain, the power law based Z-R, in few cases, was found to be the same for both types. In general, a given reflectivity was matched to a much lower rain intensity in the convective rainfall as compared to that in stratiform rainfall. These findings are inherently contradictory to previous findings based on disdrometer data and suggest some precaution for using the latter Z-R relations on radar data when the partition of stratiform and convective rainfall amount is in concern. The inverse trends in the relations might be caused by effects such as partial beam fillings, the use of different classification schemes, as well as having a distinct difference in the Z-R relations between the initial convective and the trailing transition regions as suggested by recent findings.

Amitai, Eyal↗

Multi-dimensional modulation codes for fading channel

Some new codes are presented which have good performance on Rician fading channel with small decoding complexities. A new M-way partition chain is proposed for the L x MPSK (L less than or equal to M) signal set which maximizes the intra-set distance of each subset at each partition level. Based on this partition chain, a class of asymptotical optimum codes was found. For M = 4, these codes have both large symbol distances and product distances. Multi-level coding scheme allows to construct a code by hand such that the code meets some desired parameters, e.g., symbol distance, product distance, etc. In design of a multi-level code, all factors were considered which affect the performance and complexity of the code, such as, the decoding scheme, decoding complexity, and performance under the decoding scheme, e.g., if the multi-stage decoding scheme is used, the performance degradation due to the suboptimum decoding is taken into consideration. The performance for most of the presented codes was simulated on Rayleigh fading channel, and the results show that these codes have good performance with small decoding complexities.

Lin, Shu↗

Unsteady flowfield simulation of ducted prop-fan configurations

A technique for the simulation of unsteady flows in and around complex rotating machinery is presented. Additional domain decomposition mechanisms are introduced which extend the range of applicability of software developed for the time-accurate simulation of rotating machinery flowfields. The flow models uses the unsteady 3D Euler equations, discretized as a finite-volume method, utilizing a high-resolution approximate Riemann solver for cell interface flux definitions. Multiblock domain decomposition is used to partition the field radially, axially, as well as circumferentially into an ordered arrangement of blocks which exhibit varying degrees of similarity. A general high-order numerical scheme is applied to satisfy the geometric conservation law. Two configurations are presented - ducted single rotation prop-fan and a rotor-deswirl vane combination which form a single stage fan. Comparisons are made to other numerical solutions for these geometries and to available experimental data.

Janus, J. M.↗

FD/DAMA Scheme For Mobile/Satellite Communications

Integrated-Adaptive Mobile Access Protocol (I-AMAP) proposed to allocate communication channels to subscribers in first-generation MSAT-X mobile/satellite communication network. Based on concept of frequency-division/demand-assigned multiple access (FD/DAMA) where partition of available spectrum adapted to subscribers' demands for service. Requests processed, and competing requests resolved according to channel-access protocol, or free-access tree algorithm described in "Connection Protocol for Mobile/Satellite Communications" (NPO-17735). Assigned spectrum utilized efficiently.

Yan, Tsun-Yee↗

Dual Use of Packaging on the Moon: Logistics-2-Living

This paper describes a modular packaging system for logistics that can be reconfigured into internal outfitting for a lunar outpost, including desks, chairs, partitions, cabinets, and radiation shielding. Logistics include clothes, equipment, food, and other consumables needed to sustain the crew for the duration of the mission. A significant mass penalty is required for the packaging and handling of logistics for re-supply of short to long-term space missions that must be brought out of the gravity well on a launch vehicle. Once the supplies have been exhausted, the packaging material is typically of no further use and is discarded. If a scheme can be developed that reuses the logistics packaging, the mass penalty can be reduced. In this research, a modular packaging system has been devised as a kit-of-parts that can be used for both handling logistics supplies, and then reconfigured into desks, chairs, partitions, cabinets, and radiation shielding. The system is derived from a standard International Space Station (ISS)-type Cargo Transfer Bag (CTB), using soft, unfoldable box-like containers with stiff metal inserts. The empty hydrogen-impregnated CTBs can be used as-is for cabinets, opened up for use as partitions, or draped over the habitat as layers of radiation shielding. Stiff metal inserts can be reconfigured into desks and other useful outfitting.

recycle and reuse↗

Architectures for reasoning in parallel

The research conducted has dealt with rule-based expert systems. The algorithms that may lead to effective parallelization of them were investigated. Both the forward and backward chained control paradigms were investigated in the course of this work. The best computer architecture for the developed and investigated algorithms has been researched. Two experimental vehicles were developed to facilitate this research. They are Backpac, a parallel backward chained rule-based reasoning system and Datapac, a parallel forward chained rule-based reasoning system. Both systems have been written in Multilisp, a version of Lisp which contains the parallel construct, future. Applying the future function to a function causes the function to become a task parallel to the spawning task. Additionally, Backpac and Datapac have been run on several disparate parallel processors. The machines are an Encore Multimax with 10 processors, the Concert Multiprocessor with 64 processors, and a 32 processor BBN GP1000. Both the Concert and the GP1000 are switch-based machines. The Multimax has all its processors hung off a common bus. All are shared memory machines, but have different schemes for sharing the memory and different locales for the shared memory. The main results of the investigations come from experiments on the 10 processor Encore and the Concert with partitions of 32 or less processors. Additionally, experiments have been run with a stripped down version of EMYCIN.

Hall, Lawrence O.↗

Composition Changes After the "Halloween" Solar Proton Event: The High-Energy Particle Precipitation in the Atmosphere (HEPPA) Model Versus MIPAS Data Intercomparison Study

We have compared composition changes of NO, NO2, H2O2,O3, N2O, HNO3 , N2O5, HNO4, ClO, HOCl, and ClONO2 as observed by the Michelson Interferometer for Passive Atmospheric Sounding (MIPAS) on Envisat in the aftermath of the "Halloween" solar proton event (SPE) in October/November 2003 at 25-0.01 hPa in the Northern hemisphere (40-90 N) and simulations performed by the following atmospheric models: the Bremen 2D model (B2dM) and Bremen 3D Chemical Transport Model (B3dCTM), the Central Aerological Observatory (CAO) model, FinROSE, the Hamburg Model of the Neutral and Ionized Atmosphere (HAMMONIA), the Karlsruhe Simulation Model of the Middle Atmosphere (KASIMA), the ECHAM5/MESSY Atmospheric Chemistry (EMAC) model, the modeling tool for SO1ar Climate Ozone Links studies (SOCOL and SOCOLi), and the Whole Atmosphere Community Climate Model (WACCM4). The large number of participating models allowed for an evaluation of the overall ability of atmospheric models to reproduce observed atmospheric perturbations generated by SPEs, particularly with respect to NOS, and ozone changes. We have further assessed the meteorological conditions and their implications on the chemical response to the SPE in both the models and observations by comparing temperature and tracer (CH4 and CO) fields. Simulated SPE-induced ozone losses agree on average within 5% with the observations. Simulated NO(y) enhancements around 1 hPa, however, are typically 30% higher than indicated by the observations which can be partly attributed to an overestimation of simulated electron-induced ionization. The analysis of the observed and modeled NO(y) partitioning in the aftermath of the SPE has demonstrated the need to implement additional ion chemistry (HNO3 formation via ion-ion recombination and water cluster ions) into the chemical schemes. An overestimation of observed H2O2 enhancements by all models hints at an underestimation of the OH/HO2 ratio in the upper polar stratosphere during the SPE. The analysis of chlorine species perturbations has shown that the encountered differences between models and observations, particularly the underestimation of observed ClONO2 enhancements, are related to a smaller availability of ClO in the polar night region already before the SPE. In general, the intercomparison has demonstrated that differences in the meteorology and/or initial state of the atmosphere in the simulations causes a relevant variability of the model results, even on a short timescale of only a few days.

Funke, B.↗