A study of weather-dependent data links for deep space applications
Weather-dependent data links for deep space applications, and five potential systems
Potter, P. D.↗
SEARCH · Search NASA
Results for “data dependencies”
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.
An efficient data dependence analysis for parallelizing compilers
A novel algorithm, called the lambda test, is presented for an efficient and accurate data dependence analysis of multidimensional array references. It extends the numerical methods to allow all dimensions of array references to be tested simultaneously. Hence, it combines the efficiency and the accuracy of the both approaches. This algorithm has been implemented in PARAFRASE, a FORTRAN program parallelization restructurer developed at the University of Illinois at Urbana-Champaign. Some experimental results are presented to show its effectiveness.
Li, Zhiyuan↗
Data dependent systems methodology for lumped mass modeling of structures
Limitations of the frequency domain methods in analyzing structura1 vibrations has created an awareness of the comparative merits of the time domain methods. Although time domain methods would be ideal for modeling large precisions space systems, the popular methods based on fitting theoretical response to actual data by least squares are too sensitive to noise and require too much data to be suitable for orbiting space crafts. This paper briefly reviews the theory and illustrative applications of a time domain methodology called Data Dependent Systems (DDS) that eliminates these limitations. Simulation results are presented to demonstrate a better than 4-place accuracy in the identifications of all system parameters, both modal (frequencies, damping ratios, and mode shapes) and physical (mass, stiffness, and damping matrices).
Pandit, Sudhakar M.↗
Minimizing inner product data dependencies in conjugate gradient iteration
The amount of concurrency available in conjugate gradient iteration is limited by the summations required in the inner product computations. The inner product of two vectors of length N requires time c log(N), if N or more processors are available. This paper describes an algebraic restructuring of the conjugate gradient algorithm which minimizes data dependencies due to inner product calculations. After an initial start up, the new algorithm can perform a conjugate gradient iteration in time c*log(log(N)).
Vanrosendale, J.↗
Trends in column ozone based on TOMS data - Dependence on month, latitude, and longitude
On the basis of the TOMS satellite column ozone data in latitudes 70 deg S-70 deg N from November 1978 to May 1990, a statistical model is used to estimate the trends in ozone as a function of latitude, longitude, and month. The trends in the TOMS ozone data are highly seasonal and dependent on location. Near the equator, the estimated monthly trends are not significantly different from zero. For high latitudes, most of the estimated monthly trends are negative. In January, February, and March, there are some positive trend estimates in the western hemisphere around latitude 60 deg N. The most negative trends for these three months also appear in the high latitudes of the northern hemisphere. Starting in June, more negative trends appear in the latitudes 50 deg S-70 deg S than the trends in the rest of the world considered. A large depletion develops during the spring time (September to November) in the southern high-latitude region, and the area of peak ozone decline is moving eastward during the period. The largest negative trends (about -29 percent per decade) for the area considered in this study appear in October around the latitude 70 deg S and longitudes 20 deg W-100 deg W region. For the northern hemisphere, the year-round trend estimates for latitudes 30 deg N-70 deg N range from -0.96 percent to -7.43 percent per decade. In the latitudes 30 deg N-50 deg N, the winter trend estimates are more negative than those for the summer and the fall. However, this pattern did not hold for latitudes 50 deg N-70 deg N.
Niu, Xufeng↗
Strategies for weather-dependent data acquisition
A strategy for data acquisition from a very distant spacecraft is presented, when the system performance can be severely degraded by the Earth's weather due to the high microwave frequency being used. When there is no minimum rate to be maintained, the optimum strategy is the greedy strategy, which always transmits at the single rate which maximizes the expected data returned. If there is a minimum data rate, the optimum strategy transmits simultaneously at the minimum or base data rate and at a bonus data rate. A coding system designed for the bandwidth-constrained degraded broadcast channels used. The optimum version of this system can, under realistic assumptions, save on the order of 5 dB over the conservative strategy of just transmitting at a single lower data rate.
Posner, E. C.↗
Strategies for weather-dependent data acquisition
A strategy for data acquisition from a very distant spacecraft is presented, when the system performance can be severely degraded by the Earth's weather due to the high microwave frequency being used. When there is no minimum rate to be maintained, the optimum strategy is the greedy strategy, which always transmits at the single rate which maximizes the expected data returned. If there is a minimum data rate, tne optimum strategy transmits simultaneously at the minimum or base data rate and at a bonus data rate. A coding system designed for the bandwidth-constrained degraded broadcast channels used. The optimum version of this system can, under realistic assumptions, save on the order of 5 dB over the conservative strategy of just transmitting at a single lower data rate. Previously announced in STAR as N82-11286
Posner, E. C.↗
An expert system to analyze high frequency dependent data for the space shuttle main engine turbopumps
The prototype expert system ADDAMX identifies selected sinusoid frequencies from spectral data graphs as speed frequencies and harmonics from each turbopump, frequency feed through from one turbopump to another, frequencies generated by turbopump bearings, pseudo 3N for the phase 2 high pressure fuel turbopump, and electrical noise. ADDAMX does the analysis in an interactive or batch mode and the results can be displayed on the screen or hardcopy.
Garcia, Raul C., Jr.↗
Revised radiometric calibration technique for LANDSAT-4 Thematic Mapper data
Depending on detector number, there are random fluctuations in the background level for spectral band 1 of magnitudes ranging from 2 to 3.5 digital numbers (DN). Similar variability is observed in all the other reflective bands, but with smaller magnitude in the range 0.5 to 2.5 DN. Observations of background reference levels show that line dependent variations in raw TM image data and in the associated calibration data can be measured and corrected within an operational environment by applying simple offset corrections on a line-by-line basis. The radiometric calibration procedure defined by the Canadian Center for Remote Sensing was revised accordingly in order to prevent striping in the output product.
Murphy, J.↗
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↗
Parafrase restructuring of FORTRAN code for parallel processing
Parafrase transforms a FORTRAN code, subroutine by subroutine, into a parallel code for a vector and/or shared-memory multiprocessor system. Parafrase is not a compiler; it transforms a code and provides information for a vector or concurrent process. Parafrase uses a data dependency to reveal parallelism among instructions. The data dependency test distinguishes between recurrences and statements that can be directly vectorized or parallelized. A number of transformations are required to build a data dependency graph.
Wadhwa, Atul↗
A Tool for Automatic Data Distribution for CFD Applications on Structured Grids
Development of HPF versions of NPB and ARC3D has shown that HPF provides an efficient, concise way to express parallelism and to organize data traffic. The use of HPF, as noted in the papers, requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement, and data granularity. To simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and implemented ADAPT (Automatic Data Alignment and Placement Tool). 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 on the application interface level. ADAPT annotates an existing CFD FORTRAN application, performing computations on single or multiple grids. On each grid the application is considered as a sequence of operators, each applied to a set of variables defined in a particular grid domain. ADAPT automatically detects implicit operators (i.e., having data dependences) and explicit operators (without data dependences). For parallelization of an explicit operator ADAPT creates a template for the operator domain, aligns arrays used in the operator with the template, distributes the template, and declares the loops over the distributed dimensions as INDEPENDENT. For parallelization of 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 the 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. ADAPT starts with an analysis of array index expressions of the loop nests. For each pair of arrays referenced in an assignment statement, it generates an arc in the alignment graph and annotates it with an affinity relation. The template, alignment, and distribution directives for a particular loop nest are then derived from a transitive closure of the affinity relation. A compromise of data distributions in different nests and subroutines is achieved by merging annotated alignment graphs for adjacent nests/stibroutine calls in the nest/call graph of the application in the process called distribution lifting. ADAPT has been implemented as a C++ program running in conjunction with a parallelization tool called CAPTools. ADAPT uses the parse tree, interprocedural analysis and application database generated by CAPTools. It also uses the Directed Graph class, initially implemented in p2d2 (parallel debugger oi distributed programs), and some other classes supporting symbolic computations. ADAPT uses data distribution techniques described. ADAPT was tested with ARC3D and the FT benchmark and has demonstrated a code performance within a factor of 1.5 of handwritten versions.
Frumkin, Michael↗
Two systems for automatic reduction of time- dependent photomechanics data
Servo systems for analog automatic reduction of time dependent photomechanical model materials fringe data in stress analysis
Fowlkes, C. W.↗
Two systems for automatic reduction of time- dependent photomechanics data
Servo systems for analog automatic reduction of time dependent photomechanical model materials fringe data in stress analysis
Fowlkes, C. W.↗
An empirical study of FORTRAN programs for parallelizing compilers
Some results are reported from an empirical study of program characteristics that are important in parallelizing compiler writers, especially in the area of data dependence analysis and program transformations. The state of the art in data dependence analysis and some parallel execution techniques are examined. The major findings are included. Many subscripts contain symbolic terms with unknown values. A few methods of determining their values at compile time are evaluated. Array references with coupled subscripts appear quite frequently; these subscripts must be handled simultaneously in a dependence test, rather than being handled separately as in current test algorithms. Nonzero coefficients of loop indexes in most subscripts are found to be simple: they are either 1 or -1. This allows an exact real-valued test to be as accurate as an exact integer-valued test for one-dimensional or two-dimensional arrays. Dependencies with uncertain distance are found to be rather common, and one of the main reasons is the frequent appearance of symbolic terms with unknown values.
Shen, Zhiyu↗
Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm
In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.
Povitsky, A.↗
Computer-Aided Parallelizer and Optimizer
The Computer-Aided Parallelizer and Optimizer (CAPO) automates the insertion of compiler directives (see figure) to facilitate parallel processing on Shared Memory Parallel (SMP) machines. While CAPO currently is integrated seamlessly into CAPTools (developed at the University of Greenwich, now marketed as ParaWise), CAPO was independently developed at Ames Research Center as one of the components for the Legacy Code Modernization (LCM) project. The current version takes serial FORTRAN programs, performs interprocedural data dependence analysis, and generates OpenMP directives. Due to the widely supported OpenMP standard, the generated OpenMP codes have the potential to run on a wide range of SMP machines. CAPO relies on accurate interprocedural data dependence information currently provided by CAPTools. Compiler directives are generated through identification of parallel loops in the outermost level, construction of parallel regions around parallel loops and optimization of parallel regions, and insertion of directives with automatic identification of private, reduction, induction, and shared variables. Attempts also have been made to identify potential pipeline parallelism (implemented with point-to-point synchronization). Although directives are generated automatically, user interaction with the tool is still important for producing good parallel codes. A comprehensive graphical user interface is included for users to interact with the parallelization process.
Jin, Haoqiang↗
Sequential Principal Component Analysis -An Optimal and Hardware-Implementable Transform for Image Compression
This paper presents the JPL-developed Sequential Principal Component Analysis (SPCA) algorithm for feature extraction / image compression, based on "dominant-term selection" unsupervised learning technique that requires an order-of-magnitude lesser computation and has simpler architecture compared to the state of the art gradient-descent techniques. This algorithm is inherently amenable to a compact, low power and high speed VLSI hardware embodiment. The paper compares the lossless image compression performance of the JPL's SPCA algorithm with the state of the art JPEG2000, widely used due to its simplified hardware implementability. JPEG2000 is not an optimal data compression technique because of its fixed transform characteristics, regardless of its data structure. On the other hand, conventional Principal Component Analysis based transform (PCA-transform) is a data-dependent-structure transform. However, it is not easy to implement the PCA in compact VLSI hardware, due to its highly computational and architectural complexity. In contrast, the JPL's "dominant-term selection" SPCA algorithm allows, for the first time, a compact, low-power hardware implementation of the powerful PCA algorithm. This paper presents a direct comparison of the JPL's SPCA versus JPEG2000, incorporating the Huffman and arithmetic coding for completeness of the data compression operation. The simulation results show that JPL's SPCA algorithm is superior as an optimal data-dependent-transform over the state of the art JPEG2000. When implemented in hardware, this technique is projected to be ideally suited to future NASA missions for autonomous on-board image data processing to improve the bandwidth of communication.
Duong, Tuan A.↗