Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithms”

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 253 records · Page 14

Numerical simulation of three-dimensional transonic turbulent projectile aerodynamics by TVD schemes

The two-dimensional symmetric TVD scheme proposed by Yee has been extended to and investigated for three-dimensional thin-layer Navier-Stokes simulation of complex aerodynamic problems. An existing three-dimensional Navier-stokes code based on the beam and warming algorithm is modified to provide an option of using the TVD algorithm and the flow problem considered is a transonic turbulent flow past a projectile with sting at ten-degree angle of attack. Numerical experiments conducted for three flow cases, free-stream Mach numbers of 0.91, 0.96 and 1.20 show that the symmetric TVD algorithm can provide surface pressure distribution in excellent agreement with measured data; moreover, the rate of convergence to attain a steady state solution is about two times faster than the original beam and warming algorithm.

Shiau, Nae-Haur↗

Performance analysis for the expanding search PN acquisition algorithm

An approach is described for approximating the cumulative probability distribution of the acquisition time of the serial pseudonoise (PN) search algorithm. The results are applicable to both variable and fixed dwell time systems. The theory is developed for the case where some a priori information is available on the PN code epoch (reacquisition problem or acquisition of very long codes). Also considered is the special case of a search over the whole code. The accuracy of the approximation is demonstrated by comparisons with published exact results for the fixed dwell time algorithm.

Braun, W. R.↗

Coagulation algorithms with size binning

The Smoluchowski equation describes the time evolution of an aerosol particle size distribution due to aggregation or coagulation. Any algorithm for computerized solution of this equation requires a scheme for describing the continuum of aerosol particle sizes as a discrete set. One standard form of the Smoluchowski equation accomplishes this by restricting the particle sizes to integer multiples of a basic unit particle size (the monomer size). This can be inefficient when particle concentrations over a large range of particle sizes must be calculated. Two algorithms employing a geometric size binning convention are examined: the first assumes that the aerosol particle concentration as a function of size can be considered constant within each size bin; the second approximates the concentration as a linear function of particle size within each size bin. The output of each algorithm is compared to an analytical solution in a special case of the Smoluchowski equation for which an exact solution is known . The range of parameters more appropriate for each algorithm is examined.

Statton, David M.↗

Measuring the effects of heterogeneity on distributed systems

Distributed computer systems in daily use are becoming more and more heterogeneous. Currently, much of the design and analysis studies of such systems assume homogeneity. This assumption of homogeneity has been mainly driven by the resulting simplicity in modeling and analysis. A simulation study is presented which investigated the effects of heterogeneity on scheduling algorithms for hard real time distributed systems. In contrast to previous results which indicate that random scheduling may be as good as a more complex scheduler, this algorithm is shown to be consistently better than a random scheduler. This conclusion is more prevalent at high workloads as well as at high levels of heterogeneity.

El-Toweissy, Mohamed↗

Simulation of AMVs for OSSEs

An algorithm to simulate locations of atmospheric motion vectors (AMVs) for use in observing system simulation experiments (OSSEs) is described and demonstrated. It is intended to obviate likely deficiencies in nature run data [standard meteorological parameters and aerosol tracers] if used to produce images for feature tracking. The algorithm employs probabilistic functions that are tuned based on distributions of real observations and histograms of nature run fields. For distinct observation types, the algorithm produces geographical and vertical distributions, time - mean counts, and typical spacings of simulated locations that are, at least, qualitatively similar to those of real observations and are associated with nature run cloud and water vapor fields. It thus appears suitable for generating realistic atmospheric motion vectors for use in observing system simulation experiments.

Errico, R. M.↗

Single-Scattering Properties of Ellipsoidal Dust Aerosols Constrained By Measured Dust Shape Distributions

Most global aerosol models approximate dust as spherical particles, whereas most remote sensing retrieval algorithms approximate dust as spheroidal particles with a shape distribution that conflicts with measurements. These inconsistent and inaccurate shape assumptions generate biases in dust single-scattering properties. Here, we obtain dust single-scattering properties by approximating dust as triaxial ellipsoidal particles with observationally constrained shape distributions. We find that, relative to the ellipsoidal dust optics obtained here, the spherical dust optics used in most aerosol models underestimate dust single-scattering albedo, mass extinction efficiency, and asymmetry parameter for almost all dust sizes in both the shortwave and longwave spectra. We further find that the ellipsoidal dust optics are in substantially better agreement with observations of the scattering matrix and linear depolarization ratio than the spheroidal dust optics used in most retrieval algorithms. However, relative to observations, the ellipsoidal dust optics overestimate the lidar ratio by underestimating the backscattering intensity by a factor of ∼2. This occurs largely because the computational method used to simulate ellipsoidal dust optics (i.e., the improved geometric optics method) underestimates the backscattering intensity by a factor of ∼2 relative to other computational methods (e.g., the physical geometric optics method). We conclude that the ellipsoidal dust optics with observationally constrained shape distributions can help improve global aerosol models and possibly remote sensing retrieval algorithms that do not use the backscattering signal.

Dust↗

Optimal dynamic control of resources in a distributed system

The authors quantitatively formulate the problem of controlling resources in a distributed system so as to optimize a reward function and derive optimal control strategies using Markov decision theory. The control variables treated are quite general; they could be control decisions related to system configuration, repair, diagnostics, files, or data. Two algorithms for resource control in distributed systems are derived for time-invariant and periodic environments, respectively. A detailed example to demonstrate the power and usefulness of the approach is provided.

Shin, Kang G.↗

Optimization by decomposition

An algorithm is presented for solving the structural optimization problem as a set of smaller subproblems that correspond to levels of nested substructures. In all three of the algorithm variants presented, the matching was assisted by means of the behavior and optimum sensitivity derivatives. The algorithm is noted to be intrinsically germane to distributed computing, since the subproblems can be concurrently addressed; the algorithm can also be generalized to those multidisciplinary systems whose subsystems can be arranged into a hierarchy of substructure-like dependencies.

Sobieszczanski-Sobieski, Jaroslaw↗

Advanced Symbolic Analysis Tools for Fault-Tolerant Integrated Distributed Systems

The project aims to develop advanced model-checking algorithms and tools to automate the verification of fault-tolerant distributed systems for avionics. We present a new method called Property-Directed K-Induction (PD-KIND) for synthesizing K-inductive invariants of state-transition systems. PD-KIND builds upon Satifiability Modulo Theories (SMT) to generalize Bradley's IC3 method and its variants. This method is implemented in a new tool called SALLY. Case studies show that PD-KIND can automatically verify fault-tolerant algorithms under a variety of fault models and that SALLY is competitive with other SMT-based model checkers.

Dutertre, Bruno↗

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗

Actuator selection for large space structures

The paper discusses the process of selecting the actuator locations and the determination of the required number of actuators for large space structures. The selection is based on the definitions of the degree of controllability, the independence of actuators, and the effectiveness of the individual actuators. An algorithm is developed that can be used for the selection of the essential number of actuators and for finding some defects of the system, such as the insuffiency of the available actuator locations for effective control of the whole system or a too crowded frequency distribution. The efficiency of the algorithm was demonstrated by an application to the Space Station.

Reddy, A. S. S. R.↗

Quantitative Electron Probe Microanalysis: State of the Art

Quantitative electron-probe microanalysis (EPMA) has improved due to better instrument design and X-ray correction methods. Design improvement of the electron column and X-ray spectrometer has resulted in measurement precision that exceeds analytical accuracy. Wavelength-dispersive spectrometer (WDS) have layered-dispersive diffraction crystals with improved light-element sensitivity. Newer energy-dispersive spectrometers (EDS) have Si-drift detector elements, thin window designs, and digital processing electronics with X-ray throughput approaching that of WDS Systems. Using these systems, digital X-ray mapping coupled with spectrum imaging is a powerful compositional mapping tool. Improvements in analytical accuracy are due to better X-ray correction algorithms, mass absorption coefficient data sets,and analysis method for complex geometries. ZAF algorithms have ban superceded by Phi(pz) algorithms that better model the depth distribution of primary X-ray production. Complex thin film and particle geometries are treated using Phi(pz) algorithms, end results agree well with Monte Carlo simulations. For geological materials, X-ray absorption dominates the corretions end depends on the accuracy of mass absorption coefficient (MAC) data sets. However, few MACs have been experimentally measured, and the use of fitted coefficients continues due to general success of the analytical technique. A polynomial formulation of the Bence-Albec alpha-factor technique, calibrated using Phi(pz) algorithms, is used to critically evaluate accuracy issues and can be also be used for high 2% relative and is limited by measurement precision for ideal cases, but for many elements the analytical accuracy is unproven. The EPMA technique has improved to the point where it is frequently used instead of the petrogaphic microscope for reconnaissance work. Examples of stagnant research areas are: WDS detector design characterization of calibration standards, and the need for more complete treatment of the continuum X-ray fluorescence correction.

Carpernter, P. K.↗

Verifying the interactive convergence clock synchronization algorithm using the Boyer-Moore theorem prover

The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance as the sophistication of our tools and techniques increases. Improvements in tools and techniques come about as we pit the current state of the art against new and challenging problems. A promising area for the application of formal methods is in real-time and distributed computing. Some of the algorithms in this area are both subtle and important. In response to this challenge and as part of an ongoing attempt to verify an implementation of the Interactive Convergence Clock Synchronization Algorithm (ICCSA), we decided to undertake a proof of the correctness of the algorithm using the Boyer-Moore theorem prover. This paper describes our approach to proving the ICCSA using the Boyer-Moore prover.

Young, William D.↗

Estimating Downward Cross-Tropopause Ozone Flux using Column Ozone and Potential Vorticity

A new method of estimating the downward ozone flux across the midlatitude tropopause is introduced. The algorithm derives the estimate from total column ozone observations. Vertical information is given by analysis potential vorticity fields. This method yields an annual estimate of 500 +/- 140 Tg/yr stratospheric injection of ozone into the northern hemisphere, midlatitude troposphere. The downward ozone flux exhibits the expected spring maximum and autumn minimum. The annual distribution of the cross-tropopause ozone, transport by latitude is consistent with the seasonal frequency and (list distribution) of baroclinic systems. This algorithm also produces localized results and call thus be applied to a single case or global studies.

Olsen, Mark A.↗

Determination of the horizontal and vertical distribution of clouds from infrared satellite sounding data

A numerical algorithm, based on a physical inversion of the radiative transfer equation, is developed to retrieve the global distribution of the horizontal cloud cover, the cloud-top pressure levels and their temperature. The algorithm makes use of infrared and microwave temperature sounding data to derive the clear-column vertical temperature profiles and then uses the same infrared sounding data to obtain the corresponding cloud parameters. Experimental verification of this method is carried out using data from the High resolution Infrared Sounder (HIRS) and the Microwave Sounding Unit (MSU) operating on the NOAA weather satellite system.

Chahine, M. T.↗

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

In this work, we develop an approach to formation estimation by explicitly characterizing formation's system-theoretic attributes in terms of the underlying inter-spacecraft information-exchange network. In particular, we approach the formation observer/estimator design by relaxing the accessibility to the global state information by a centralized observer/estimator- and in turn- providing an analysis and synthesis framework for formation observers/estimators that rely on local measurements. The noveltyof our approach hinges upon the explicit examination of the underlying distributed spacecraft network in the realm of guidance, navigation, and control algorithmic analysis and design. The overarching goal of our general research program, some of whose results are reported in this paper, is the development of distributed spacecraft estimation algorithms that are scalable, modular, and robust to variations inthe topology and link characteristics of the formation information exchange network. In this work, we consider the observability of a spacecraft formation from a single observation node and utilize the agreement protocol as a mechanism for observing formation states from local measurements. Specifically, we show how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the observability of the corresponding multi-agent system The ramification of this notion of observability over networks is then explored in the context of distributed formation estimation.

observability↗

Parallel Wavefront Analysis for a 4D Interferometer

This software provides a programming interface for automating data collection with a PhaseCam interferometer from 4D Technology, and distributing the image-processing algorithm across a cluster of general-purpose computers. Multiple instances of 4Sight (4D Technology s proprietary software) run on a networked cluster of computers. Each connects to a single server (the controller) and waits for instructions. The controller directs the interferometer to several images, then assigns each image to a different computer for processing. When the image processing is finished, the server directs one of the computers to collate and combine the processed images, saving the resulting measurement in a file on a disk. The available software captures approximately 100 images and analyzes them immediately. This software separates the capture and analysis processes, so that analysis can be done at a different time and faster by running the algorithm in parallel across several processors. The PhaseCam family of interferometers can measure an optical system in milliseconds, but it takes many seconds to process the data so that it is usable. In characterizing an adaptive optics system, like the next generation of astronomical observatories, thousands of measurements are required, and the processing time quickly becomes excessive. A programming interface distributes data processing for a PhaseCam interferometer across a Windows computing cluster. A scriptable controller program coordinates data acquisition from the interferometer, storage on networked hard disks, and parallel processing. Idle time of the interferometer is minimized. This architecture is implemented in Python and JavaScript, and may be altered to fit a customer s needs.

Rao, Shanti R.↗