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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

A block-corrected subdomain solution procedure for recirculating flow calculations

This paper describes a robust and efficient subdomain solution procedure for two-dimensional recirculating flows. The solution domain is divided into a number of overlapping subdomains, and a direct fully coupled solution is obtained for each subdomain using a sparse matrix form of LU decomposition. An effective parabolic block correction procedure, which calculates global corrections to the tentative solution by a marching technique similar to that used for boundary layer flows, is used to accelerate the convergence of the basic procedure. The use of effective block correction is found to be essential for the success of the subdomain approach on strongly recirculating flows. In a number of laminar two-dimensional flows, the new block-corrected method performed extremely well, rivaling the best direct methods in execution time, while requiring substantially less computer storage. The new method proved to be from two to ten times faster than conventional iterative methods, while requiring only a moderate increase in storage.

Braaten, M. E.↗
NASA NTRS1987

Supersonic flow computations over aerospace configurations using an Euler marching solver

For fully supersonic flows, an efficient strategy for obtaining numerical solutions is to employ space marching techniques. A full potential marching technique, known as the SIMP code and capable of handling such embedded subsonic regions, has achieved some success analyzing low supersonic Mach number flows. The extension of the full potential approach to the Euler equation which model the exact nonlinear inviscid gas dynamic flow processes is presented. Within the assumption of an inviscid flow, such an Euler marching solver can be applied to a wide class of shocked flows including the hypersonic range. The intent is to maintain some of the basic features of the full potential SIMP code within the Euler solver in dealing with geometry input, gridding techniques, and input/output routines including post processing of results. An Euler marching code known as EMTAC was developed. Results obtained for a variety of configurations involving canard, wing, horizontal tail, flow-through inlet, and fuselage using both the EMTAC and SIMP codes are reported. For shocked cases satisfying the isentropic assumption, the EMTAC and SIMP codes produced practically the same results. In terms of execution time, the EMTAC code is slower.

Szema, Kuo-Yen↗
NASA NTRS1987

Theoretical methods and design studies for NLF and HLFC swept wings at subsonic and supersonic speeds

Laminarization of the boundary layer on the surface of aircraft wings can be accomplished by the use of concepts such as Natural Laminar Flow (NLF), Laminar-Flow Control (LFC), and Hybrid Laminar-Flow Control (HLFC). Several integral boundary-layer methods were developed for the prediction of laminar, transition, and separating turbulent boundary layers. These methods were developed for use at either subsonic or supersonic speeds, have small computer execution times, and are simple to use. The theoretical equations and assumptions which form the basis of the boundary-layer method, are briefly outlined and the results of several correlation cases with exciting experimental data are presented.

Goradia, Suresh H.↗
NASA NTRS1989

The use of real-time, hardware-in-the-loop simulation in the design and development of the new Hughes HS601 spacecraft attitude control system

Realtime simulation and hardware-in-the-loop testing is being used extensively in all phases of the design, development, and testing of the attitude control system (ACS) for the new Hughes HS601 satellite bus. Realtime, hardware-in-the-loop simulation, integrated with traditional analysis and pure simulation activities is shown to provide a highly efficient and productive overall development program. Implementation of high fidelity simulations of the satellite dynamics and control system algorithms, capable of real-time execution (using applied Dynamics International's System 100), provides a tool which is capable of being integrated with the critical flight microprocessor to create a mixed simulation test (MST). The MST creates a highly accurate, detailed simulated on-orbit test environment, capable of open and closed loop ACS testing, in which the ACS design can be validated. The MST is shown to provide a valuable extension of traditional test methods. A description of the MST configuration is presented, including the spacecraft dynamics simulation model, sensor and actuator emulators, and the test support system. Overall system performance parameters are presented. MST applications are discussed; supporting ACS design, developing on-orbit system performance predictions, flight software development and qualification testing (augmenting the traditional software-based testing), mission planning, and a cost-effective subsystem-level acceptance test. The MST is shown to provide an ideal tool in which the ACS designer can fly the spacecraft on the ground.

Slafer, Loren I.↗
NASA NTRS1990

Parallelization of implicit finite difference schemes in computational fluid dynamics

Implicit finite difference schemes are often the preferred numerical schemes in computational fluid dynamics, requiring less stringent stability bounds than the explicit schemes. Each iteration in an implicit scheme involves global data dependencies in the form of second and higher order recurrences. Efficient parallel implementations of such iterative methods are considerably more difficult and non-intuitive. The parallelization of the implicit schemes that are used for solving the Euler and the thin layer Navier-Stokes equations and that require inversions of large linear systems in the form of block tri-diagonal and/or block penta-diagonal matrices is discussed. Three-dimensional cases are emphasized and schemes that minimize the total execution time are presented. Partitioning and scheduling schemes for alleviating the effects of the global data dependencies are described. An analysis of the communication and the computation aspects of these methods is presented. The effect of the boundary conditions on the parallel schemes is also discussed.

Decker, Naomi H.↗
NASA NTRS1989

Determining robot actions for tasks requiring sensor interaction

The performance of non-trivial tasks by a mobile robot has been a long term objective of robotic research. One of the major stumbling blocks to this goal is the conversion of the high-level planning goals and commands into the actuator and sensor processing controls. In order for a mobile robot to accomplish a non-trivial task, the task must be described in terms of primitive actions of the robot's actuators. Most non-trivial tasks require the robot to interact with its environment; thus necessitating coordination of sensor processing and actuator control to accomplish the task. The main contention is that the transformation from the high level description of the task to the primitive actions should be performed primarily at execution time, when knowledge about the environment can be obtained through sensors. It is proposed to produce the detailed plan of primitive actions by using a collection of low-level planning components that contain domain specific knowledge and knowledge about the available sensors, actuators, and sensor/actuator processing. This collection will perform signal and control processing as well as serve as a control interface between an actual mobile robot and a high-level planning system. Previous research has shown the usefulness of high-level planning systems to plan the coordination of activities such to achieve a goal, but none have been fully applied to actual mobile robots due to the complexity of interacting with sensors and actuators. This control interface is currently being implemented on a LABMATE mobile robot connected to a SUN workstation and will be developed such to enable the LABMATE to perform non-trivial, sensor-intensive tasks as specified by a planning system.

Budenske, John↗
NASA NTRS1989

Vector algorithms for geometrically nonlinear 3D finite element analysis

Algorithms for geometrically nonlinear finite element analysis are presented which exploit the vector processing capability of the VPS-32, which is closely related to the CYBER 205. By manipulating vectors (which are long lists of numbers) rather than individual numbers, very high processing speeds are obtained. Long vector lengths are obtained without extensive replication or reordering by storage of intermediate results in strategic patterns at all stages of the computations. Comparisons of execution times with those from programs using either scalar or other vector programming techniques indicate that the algorithms presented are quite efficient.

Whitcomb, John D.↗
NASA NTRS1989

A survey of fault diagnosis technology

Existing techniques and methodologies for fault diagnosis are surveyed. The techniques run the gamut from theoretical artificial intelligence work to conventional software engineering applications. They are shown to define a spectrum of implementation alternatives where tradeoffs determine their position on the spectrum. Various tradeoffs include execution time limitations and memory requirements of the algorithms as well as their effectiveness in addressing the fault diagnosis problem.

Riedesel, Joel↗
NASA NTRS1989

TRAPEDS - Producing traces for multicomputers via execution driven simulation

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. Even when existing trace methods can be used on multicomputers, the amount of collected data typically grows with the number of processors, so I/O and trace storage costs increase. A new technique is presented which modifies the executable code to dynamically collect the address trace from the user code and analyzes this trace during the execution of the program. This method helps resolve the I/O and storage problems and facilitates parallel analysis of the address trace. If a trace stored on disk is desired, the generated trace information can also be written to files during execution, with a resultant drop in program execution speed. An initial implementation on the Intel iPSC/2 hypercube multicomputer is detailed, and sample simulation results are presented. The effect of this trace collection method on execution time is illustrated.

Stunkel, Craig B.↗
NASA NTRS1990

A conservative approach to parallelizing the Sharks World simulation

Parallelizing a benchmark problem for parallel simulation, the Sharks World, is described. The described solution is conservative, in the sense that no state information is saved, and no 'rollbacks' occur. The used approach illustrates both the principal advantage and principal disadvantage of conservative parallel simulation. The advantage is that by exploiting lookahead an approach was found that dramatically improves the serial execution time, and also achieves excellent speedups. The disadvantage is that if the model rules are changed in such a way that the lookahead is destroyed, it is difficult to modify the solution to accommodate the changes.

Nicol, David M.↗
NASA NTRS1990

Performance of a parallel code for the Euler equations on hypercube computers

The performance of hypercubes were evaluated on a computational fluid dynamics problem and the parallel environment issues were considered that must be addressed, such as algorithm changes, implementation choices, programming effort, and programming environment. The evaluation focuses on a widely used fluid dynamics code, FLO52, which solves the two dimensional steady Euler equations describing flow around the airfoil. The code development experience is described, including interacting with the operating system, utilizing the message-passing communication system, and code modifications necessary to increase parallel efficiency. Results from two hypercube parallel computers (a 16-node iPSC/2, and a 512-node NCUBE/ten) are discussed and compared. In addition, a mathematical model of the execution time was developed as a function of several machine and algorithm parameters. This model accurately predicts the actual run times obtained and is used to explore the performance of the code in interesting but yet physically realizable regions of the parameter space. Based on this model, predictions about future hypercubes are made.

Barszcz, Eric↗
NASA NTRS1990

An AD100 implementation of a real-time STOVL aircraft propulsion system

A real-time dynamic model of the propulsion system for a Short Take-Off and Vertical Landing (STOVL) aircraft was developed for the AD100 simulation environment. The dynamic model was adapted from a FORTRAN based simulation using the dynamic programming capabilities of the AD100 ADSIM simulation language. The dynamic model includes an aerothermal representation of a turbofan jet engine, actuator and sensor models, and a multivariable control system. The AD100 model was tested for agreement with the FORTRAN model and real-time execution performance. The propulsion system model was also linked to an airframe dynamic model to provide an overall STOVL aircraft simulation for the purposes of integrated flight and propulsion control studies. An evaluation of the AD100 system for use as an aircraft simulation environment is included.

Ouzts, Peter J.↗
NASA NTRS1991

The Navy/NASA Engine Program (NNEP89): A user's manual

An engine simulation computer code called NNEP89 was written to perform 1-D steady state thermodynamic analysis of turbine engine cycles. By using a very flexible method of input, a set of standard components are connected at execution time to simulate almost any turbine engine configuration that the user could imagine. The code was used to simulate a wide range of engine cycles from turboshafts and turboprops to air turborockets and supersonic cruise variable cycle engines. Off design performance is calculated through the use of component performance maps. A chemical equilibrium model is incorporated to adequately predict chemical dissociation as well as model virtually any fuel. NNEP89 is written in standard FORTRAN77 with clear structured programming and extensive internal documentation. The standard FORTRAN77 programming allows it to be installed onto most mainframe computers and workstations without modification. The NNEP89 code was derived from the Navy/NASA Engine program (NNEP). NNEP89 provides many improvements and enhancements to the original NNEP code and incorporates features which make it easier to use for the novice user. This is a comprehensive user's guide for the NNEP89 code.

Plencner, Robert M.↗
NASA NTRS1990

Synthesizing information-update functions using off-line symbolic processing

This paper explores the synthesis of programs that track dynamic conditions in their environment. An approach is proposed in which the designer specifies, in a declarative language, aspects of the environment in which the program will be embedded. This specification is then automatically compiled into a program that, when executed, updates internal data structures so as to maintain as an invariant a desired correspondence between internal data structures and states of the external environment. This approach retains much of the flexibility of declarative programming while guaranteeing a hard bound on the execution time of information-update functions.

Rosenschein, Stanley J.↗
NASA NTRS1991

Improved algorithms for mapping pipelined and parallel computations

Recent work on the problem of mapping pipelined or parallel computations onto linear array, shared memory, and host-satellite systems is extended. It is shown how these problems can be solved even more efficiently when computation module execution times are bounded from below, intermodule communication times are bounded from above, and the processors satisfy certain homogeneity constraints. The improved algorithms have significantly lower time and space complexities than the more general algorithms: in one case, an O(nm3) time algorithm for mapping m modules onto n processors is replaced with an O(nm log m) time algorithm, and the space requirements are reduced from O(nm2) to O(m). Run-time complexity is reduced further with parallel mapping algorithms based on these improvements, which run on the architectures for which they create mappings.

Nicol, David M.↗
NASA NTRS1991

Gain in computational efficiency by vectorization in the dynamic simulation of multi-body systems

An improved technique for the identification and extraction of the exact quantities associated with the degrees of freedom at the element as well as the flexible body level is presented. It is implemented in the dynamic equations of motions based on the recursive formulation of Kane et al. (1987) and presented in a matrix form, integrating the concepts of strain energy, the finite-element approach, modal analysis, and reduction of equations. This technique eliminates the CPU intensive matrix multiplication operations in the code's hot spots for the dynamic simulation of the interconnected rigid and flexible bodies. A study of a simple robot with flexible links is presented by comparing the execution times on a scalar machine and a vector-processor with and without vector options. Performance figures demonstrating the substantial gains achieved by the technique are plotted.

Amirouche, F. M. L.↗
NASA NTRS1992

Fault-Tree Compiler Program

FTC, Fault-Tree Compiler program, is reliability-analysis software tool used to calculate probability of top event of fault tree. Five different types of gates allowed in fault tree: AND, OR, EXCLUSIVE OR, INVERT, and M OF N. High-level input language of FTC easy to understand and use. Program supports hierarchical fault-tree-definition feature simplifying process of description of tree and reduces execution time. Solution technique implemented in FORTRAN, and user interface in Pascal. Written to run on DEC VAX computer operating under VMS operating system.

Butler, Ricky W.↗
NASA NTRS1989

A highly parallel multigrid-like method for the solution of the Euler equations

We consider a highly parallel multigrid-like method for the solution of the two dimensional steady Euler equations. The new method, introduced as filtering multigrid, is similar to a standard multigrid scheme in that convergence on the finest grid is accelerated by iterations on coarser grids. In the filtering method, however, additional fine grid subproblems are processed concurrently with coarse grid computations to further accelerate convergence. These additional problems are obtained by splitting the residual into a smooth and an oscillatory component. The smooth component is then used to form a coarse grid problem (similar to standard multigrid) while the oscillatory component is used for a fine grid subproblem. The primary advantage in the filtering approach is that fewer iterations are required and that most of the additional work per iteration can be performed in parallel with the standard coarse grid computations. We generalize the filtering algorithm to a version suitable for nonlinear problems. We emphasize that this generalization is conceptually straight-forward and relatively easy to implement. In particular, no explicit linearization (e.g., formation of Jacobians) needs to be performed (similar to the FAS multigrid approach). We illustrate the nonlinear version by applying it to the Euler equations, and presenting numerical results. Finally, a performance evaluation is made based on execution time models and convergence information obtained from numerical experiments.

Tuminaro, Ray S.↗