Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “execution time”

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 325 records · Page 18

FORTRAN code-evaluation system

Automated code evaluation system can be used to detect coding errors and unsound coding practices in any ANSI FORTRAN IV source code before they can cause execution-time malfunctions. System concentrates on acceptable FORTRAN code features which are likely to produce undesirable results.

Capps, J. D.↗

FORTRAN Automated Code Evaluation System (FACES) user's manual, version 2

A system which provides analysis services for FORTRAN based software systems not normally available from system software is presented. The system is not a compiler, and compiler syntax diagnostics are not duplicated. For maximum adaptation to FORTRAN dialects, the code presented to the system is assumed to be compiler acceptable. The system concentrates on acceptable FORTRAN code features which are likely to produce undesirable results and identifies potential trouble areas before they become execution time malfunctions.

Source record↗

Zonal and tesseral harmonic coefficients for the geopotential function, from zero to 18th order

Zonal and tesseral harmonic coefficients for the geopotential function are usually tabulated in normalized form to provide immediate information as to the relative significance of the coefficients in the gravity model. The normalized form of the geopotential coefficients cannot be used for computational purposes unless the gravity model has been modified to receive them. This modification is usually not done because the absolute or unnormalized form of the coefficients can be obtained from the simple mathematical relationship that relates the two forms. This computation can be quite tedious for hand calculation, especially for the higher order terms, and can be costly in terms of storage and execution time for machine computation. In this report, zonal and tesseral harmonic coefficients for the geopotential function are tabulated in absolute or unnormalized form. The report is designed to be used as a ready reference for both hand and machine calculation to save the user time and effort.

Kirkpatrick, J. C.↗

Evaluation of two swept-infinite-wing potential/viscous-flow computer programs

Two computer programs capable of predicting the potential and viscous interacting flow around wings of infinite aspect ratio was evaluated. The programs are compared in terms of their capabilities, the approximations and the methods of solution used, and the input requirements. Six airfoils, each representative of a class of airfoils, are used as test airfoils. The results predicted by the programs are presented for each airfoil at sweep angles of 0, 20, and 40 degrees over a range of angles of attack. The results show that at zero sweep both programs predicted the aerodynamic coefficients well and generally in good agreement with measurements. At 20 and 40 degrees of sweep, as there are no experimental data available, definitive conclusions cannot be drawn about the accuracy of the predictions although the results are presented and discussed. The execution times are approximately the same for the two programs.

Arimilli, R. V.↗

Interactive LORAN-C to geographic and geographic-to-LORAN-C computation

The LORAN program is stored in CMS disk files for use by Avionics Engineering Center terminal users. A CMS EXEC file named LORAN controls program operation. The user types LORAN and the program then prompts for data input and produces output on the terminal. The FORTRAN program refers to a disk file of LORAN master data giving station locations, coding delays, repetition rate and station pair identification letters. For Geographic-to-LORAN conversion, no iterative computations are required; the program is a straightforward coordinate conversion based upon the techniques described by the Navy. For LORAN-to-Geographic conversion, the original Navy program required a dead-reckoned position, near the actual unknown fix, to begin computations. No iteration was performed to obtain the LORAN fix, but internal program errors occurred at execution time if the dead-reckoned fix were displaced from the actual fix by more than a few minutes of latitude or longitude. In order to enhance usefulness of the program for the terminal user, an iterative routine was added which allows a single dead-reckoned position to be entered from the master data file for each LORAN chain. The results compare exactly with the LORAN-C navigation chart, and provide adequate benchmark data for general aviation flight planning and data analysis.

Piecuch, L. M.↗

Structural performance analysis and redesign

Program performs stress buckling and vibrational analysis of large, linear, finite-element systems in excess of 50,000 degrees of freedom. Cost, execution time, and storage requirements are kept reasonable through use of sparse matrix solution techniques, and other computational and data management procedures designed for problems of very large size.

Whetstone, W. D.↗

High frequency dynamic engine simulation

A digital computer simulation of a mixed flow, twin spool turbofan engine was assembled to evaluate and improve the dynamic characteristics of the engine simulation to disturbance frequencies of at least 100 Hz. One dimensional forms of the dynamic mass, momentum and energy equations were used to model the engine. A TF30 engine was simulated so that dynamic characteristics could be evaluated against results obtained from testing of the TF30 engine at the NASA Lewis Research Center. Dynamic characteristics of the engine simulation were improved by modifying the compression system model. Modifications to the compression system model were established by investigating the influence of size and number of finite dynamic elements. Based on the results of this program, high frequency engine simulations using finite dynamic elements can be assembled so that the engine dynamic configuration is optimum with respect to dynamic characteristics and computer execution time. Resizing of the compression systems finite elements improved the dynamic characteristics of the engine simulation but showed that additional refinements are required to obtain close agreement simulation and actual engine dynamic characteristics.

Schuerman, J. A.↗

Atmospheric density models

An atmospheric model developed by Jacchia, quite accurate but requiring a large amount of computer storage and execution time, was found to be ill-suited for the space shuttle onboard program. The development of a simple atmospheric density model to simulate the Jacchia model was studied. Required characteristics including variation with solar activity, diurnal variation, variation with geomagnetic activity, semiannual variation, and variation with height were met by the new atmospheric density model.

Mueller, A. C.↗

Methodology of modeling and measuring computer architectures for plasma simulations

A brief introduction to plasma simulation using computers and the difficulties on currently available computers is given. Through the use of an analyzing and measuring methodology - SARA, the control flow and data flow of a particle simulation model REM2-1/2D are exemplified. After recursive refinements the total execution time may be greatly shortened and a fully parallel data flow can be obtained. From this data flow, a matched computer architecture or organization could be configured to achieve the computation bound of an application problem. A sequential type simulation model, an array/pipeline type simulation model, and a fully parallel simulation model of a code REM2-1/2D are proposed and analyzed. This methodology can be applied to other application problems which have implicitly parallel nature.

Wang, L. P. T.↗

AAA gunnermodel based on observer theory

The Luenberger observer theory is used to develop a predictive model of a gunner's tracking response in antiaircraft artillery systems. This model is composed of an observer, a feedback controller and a remnant element. An important feature of the model is that the structure is simple, hence a computer simulation requires only a short execution time. A parameter identification program based on the least squares curve fitting method and the Gauss Newton gradient algorithm is developed to determine the parameter values of the gunner model. Thus, a systematic procedure exists for identifying model parameters for a given antiaircraft tracking task. Model predictions of tracking errors are compared with human tracking data obtained from manned simulation experiments. Model predictions are in excellent agreement with the empirical data for several flyby and maneuvering target trajectories.

Kou, R. S.↗

An Analytical Satellite Orbit Predictor (ASOP)

The documentation and user's guide are presented for the analytical satellite orbit predictor computer program which is intended to be used for computation of near-earth orbits including those of the shuttle orbiter and its payloads. The Poincare-Similar elements used make it possible to compute near-earth orbits to within an accuracy of a few meters. Recursive equations are used instead of complicated formulas. Execution time is on the order of a few milliseconds.

Source record↗

A comparison of WFTA and FFT programs

Bounds on the minimum number of data transfers (i.e., loads and stores) required by WFTA (Winograd Fourier Transform Algorithm) and FFT programs are presented. The analysis is applicable to those general-purpose computers with a small number of general processor registers (e.g., the IBM370, PDP-11, etc.). It is shown that the 1008-point WFTA requires about 21% more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about 22% fewer data transfers than the 128-point radix-2 FFT. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Nawab, H.↗

Bounds on the minimum number of data transfers in WFTA and FFT programs

Bounds on the minimum number of data transfers (i.e., loads, stores, copies) required by WFTA and FFT programs are presented. The analysis is applicable to those general-purpose computers with M general processor registers, where M is equal to or greater than 4 but much less than the transform length. It is shown that the 1008-point WFTA requires about 21 percent more data transfers than the 1024-point radix-4 FFT; on the other hand, the 120-point WFTA has about the same number of data transfers as the mixed radix (4 x 4 x 4 x 2) version of the 128-point FFT and 22 percent fewer than the radix-2 version. Finally, comparisons of the 'total' program execution times (multiplications, additions, and data transfers, but not indexing or permutations) are presented.

Nawab, H.↗

NAVSTAR/GPS satellite selection for sequential receivers

Derivation of a satellite in-view procedure and two satellite selection procedures are obtained and comparisons to previous procedures are presented. Two suboptimal satellite selection procedures - Quadrature System (QS) and Flexible Orthogonal System (FOS) - are compared to a suboptimal and optimum procedures, taking into account the execution time and Geometric Dilution of Precision (GDOP) of each.

Noe, P. S.↗

STAR adaptation of QR algorithm

The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared.

Shah, S. N.↗

A floating-point/multiple-precision processor for airborne applications

A compact input output (I/O) numerical processor capable of performing floating-point, multiple precision and other arithmetic functions at execution times which are at least 100 times faster than comparable software emulation is described. The I/O device is a microcomputer system containing a 16 bit microprocessor, a numerical coprocessor with eight 80 bit registers running at a 5 MHz clock rate, 18K random access memory (RAM) and 16K electrically programmable read only memory (EPROM). The processor acts as an intelligent slave to the host computer and can be programmed in high order languages such as FORTRAN and PL/M-86.

Yee, R.↗

An efficient full potential implicit method based on characteristics for analysis of supersonic flows

A nonlinear aerodynamic prediction technique based on the full potential equation in conservation form has been developed for the treatment of supersonic flows. The method uses the theory of characteristic signal propagation to accurately simulate the flow structure, which includes shock waves and mixed elliptic-hyperbolic crossflow. An implicit approximate factorization scheme is employed to solve the finite-differenced equation. The necessary body-fitted grid system in every marching plane is generated numerically, using an elliptic grid solver. Results are shown for conical and nonconical wing-body combinations and compared with experimental data and Euler calculations. The method demonstrates an enormous savings in execution time and memory requirements over Euler methods.

Shankar, V.↗

Experiences with explicit finite-difference schemes for complex fluid dynamics problems on STAR-100 and CYBER-203 computers

Several two- and three-dimensional external and internal flow problems solved on the STAR-100 and CYBER-203 vector processing computers are described. The flow field was described by the full Navier-Stokes equations which were then solved by explicit finite-difference algorithms. Problem results and computer system requirements are presented. Program organization and data base structure for three-dimensional computer codes which will eliminate or improve on page faulting, are discussed. Storage requirements for three-dimensional codes are reduced by calculating transformation metric data in each step. As a result, in-core grid points were increased in number by 50% to 150,000, with a 10% execution time increase. An assessment of current and future machine requirements shows that even on the CYBER-205 computer only a few problems can be solved realistically. Estimates reveal that the present situation is more storage limited than compute rate limited, but advancements in both storage and speed are essential to realistically calculate three-dimensional flow.

Kumar, A.↗