Search NASA⌕ Search

SEARCH · Search NASA

Results for “CPU”

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 397 records · Page 22

Practical implementation of an accurate method for multilevel design sensitivity analysis

Solution techniques for handling large scale engineering optimization problems are reviewed. Potentials for practical applications as well as their limited capabilities are discussed. A new solution algorithm for design sensitivity is proposed. The algorithm is based upon the multilevel substructuring concept to be coupled with the adjoint method of sensitivity analysis. There are no approximations involved in the present algorithm except the usual approximations introduced due to the discretization of the finite element model. Results from the six- and thirty-bar planar truss problems show that the proposed multilevel scheme for sensitivity analysis is more effective (in terms of computer incore memory and the total CPU time) than a conventional (one level) scheme even on small problems. The new algorithm is expected to perform better for larger problems and its applications on the new generation of computer hardwares with 'parallel processing' capability is very promising.

Nguyen, Duc T.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

System architecture of a gallium arsenide one-gigahertz digital IC tester

The design for a 1-GHz digital integrated circuit tester for the evaluation of custom GaAs chips and subsystems is discussed. Technology-related problems affecting the design of a GaAs computer are discussed, with emphasis on the problems introduced by long printed-circuit-board interconnect. High-speed interface modules provide a link between the low-speed microprocessor and the chip under test. Memory-multiplexer and memory-shift register architectures for the storage of test vectors are described in addition to an architecture for local data storage consisting of a long chain of GaAs shift registers. The tester is constructed around a VME system card cage and backplane, and very little high-speed interconnect exists between boards. The tester has a three part self-test consisting of a CPU board confidence test, a main memory confidence test, and a high-speed interface module functional test.

Fouts, Douglas J.↗

Simulation of transonic viscous flow over a fighter-like configuration including inlet

The simulation of transonic viscous flow over a modified F-16A including inlet is presented. A zonal approach is utilized which allows appropriate clustering suitable for viscous calculations on all solid surfaces. Computational efficiency is enhanced by solving the thin-layer Navier-Stokes equations in viscous zones adjacent to the aircraft and the Euler equations on those coarse zones away from the aircraft. The flow conditions for this transonic case are freestream Mach number of 0.9, angle of attack of 4.12 deg, and a Reynolds number (based on root chord) of 4.5 million. A total of 19 zones are utilized yielding a total of 350,000 grid points. This case required about 3000 iterations to reduce the residual by three orders, which takes about 10 hr of CPU time on the Cray X-MP/48 computer. Pressure distributions on the wing and on cross sections through the inlet region compare favorably with the experimental data for this transonic case.

Flores, Jolen↗

Multitasking the code ARC3D

The CRAY multitasking system was developed in order to utilize all four processors and sharply reduce the wall clock run time. This paper describes the techniques used to modify the computational fluid dynamics code ARC3D for this run and analyzes the achieved speedup. The ARC3D code solves either the Euler or thin-layer N-S equations using an implicit approximate factorization scheme. Results indicate that multitask processing can be used to achieve wall clock speedup factors of over three times, depending on the nature of the program code being used. Multitasking appears to be particularly advantageous for large-memory problems running on multiple CPU computers.

Barton, John T.↗

Effective core potential parameters for first- and second-row atoms

An improved effective core potential (ECP) technique is described and used to give ECP parameters for the atoms of the first two rows of the periodic table. A given basis set is parametrized which allows for a direct comparison with all-electron calculations. Extensive test calculations on first- and second-row molecules using the ECP have been performed, giving excellent agreement with the all-electron results at the SCF, CASSCF, and CI levels of treatment. Correlating and diffuse functions may be added without modifying the ECP parameters. The present ECP descriptions result in CPU time reductions of the order of 50 percent in addition to reduced disk storage.

Pettersson, Lars G. M.↗

High-speed assembly language (80386/80387) programming for laser spectra scan control and data acquisition providing improved resolution water vapor spectroscopy

An assembly language program using the Intel 80386 CPU and 80387 math co-processor chips was written to increase the speed of data gathering and processing, and provide control of a scanning CW ring dye laser system. This laser system is used in high resolution (better than 0.001 cm-1) water vapor spectroscopy experiments. Laser beam power is sensed at the input and output of white cells and the output of a Fabry-Perot. The assembly language subroutine is called from Basic, acquires the data and performs various calculations at rates greater than 150 faster than could be performed by the higher level language. The width of output control pulses generated in assembly language are 3 to 4 microsecs as compared to 2 to 3.7 millisecs for those generated in Basic (about 500 to 1000 times faster). Included are a block diagram and brief description of the spectroscopy experiment, a flow diagram of the Basic and assembly language programs, listing of the programs, scope photographs of the computer generated 5-volt pulses used for control and timing analysis, and representative water spectrum curves obtained using these programs.

Allen, Robert J.↗

Tabulation of Mie scattering calculation results for microwave radiative transfer modeling

In microwave radiative transfer model simulations, the Mie calculations usually consume the majority of the computer time necessary for the calculations (70 to 86 percent for frequencies ranging from 6.6 to 183 GHz). For a large array of atmospheric profiles, the repeated calculations of the Mie codes make the radiative transfer computations not only expensive, but sometimes impossible. It is desirable, therefore, to develop a set of Mie tables to replace the Mie codes for the designated ranges of temperature and frequency in the microwave radiative transfer calculation. Results of using the Mie tables in the transfer calculations show that the total CPU time (IBM 3081) used for the modeling simulation is reduced by a factor of 7 to 16, depending on the frequency. The tables are tested by computing the upwelling radiance of 144 atmospheric profiles generated by a 3-D cloud model (Tao, 1986). Results are compared with those using Mie quantities computed from the Mie codes. The bias and root-mean-square deviation (RMSD) of the model results using the Mie tables, in general, are less than 1 K except for 37 and 90 GHz. Overall, neither the bias nor RMSD is worse than 1.7 K for any frequency and any viewing angle.

Yeh, Hwa-Young M.↗

A direct-execution parallel architecture for the Advanced Continuous Simulation Language (ACSL)

A direct-execution parallel architecture for the Advanced Continuous Simulation Language (ACSL) is presented which overcomes the traditional disadvantages of simulations executed on a digital computer. The incorporation of parallel processing allows the mapping of simulations into a digital computer to be done in the same inherently parallel manner as they are currently mapped onto an analog computer. The direct-execution format maximizes the efficiency of the executed code since the need for a high level language compiler is eliminated. Resolution is greatly increased over that which is available with an analog computer without the sacrifice in execution speed normally expected with digitial computer simulations. Although this report covers all aspects of the new architecture, key emphasis is placed on the processing element configuration and the microprogramming of the ACLS constructs. The execution times for all ACLS constructs are computed using a model of a processing element based on the AMD 29000 CPU and the AMD 29027 FPU. The increase in execution speed provided by parallel processing is exemplified by comparing the derived execution times of two ACSL programs with the execution times for the same programs executed on a similar sequential architecture.

Carroll, Chester C.↗

Duct flow nonuniformities for Space Shuttle Main Engine (SSME)

A three-duct Space Shuttle Main Engine (SSME) Hot Gas Manifold geometry code was developed for use. The methodology of the program is described, recommendations on its implementation made, and an input guide, input deck listing, and a source code listing provided. The code listing is strewn with an abundance of comments to assist the user in following its development and logic. A working source deck will be provided. A thorough analysis was made of the proper boundary conditions and chemistry kinetics necessary for an accurate computational analysis of the flow environment in the SSME fuel side preburner chamber during the initial startup transient. Pertinent results were presented to facilitate incorporation of these findings into an appropriate CFD code. The computation must be a turbulent computation, since the flow field turbulent mixing will have a profound effect on the chemistry. Because of the additional equations demanded by the chemistry model it is recommended that for expediency a simple algebraic mixing length model be adopted. Performing this computation for all or selected time intervals of the startup time will require an abundance of computer CPU time regardless of the specific CFD code selected.

Source record↗

Strategies for vectorizing the sparse matrix vector product on the CRAY XMP, CRAY 2, and CYBER 205

Large, randomly sparse matrix vector products are important in a number of applications in computational chemistry, such as matrix diagonalization and the solution of simultaneous equations. Vectorization of this process is considered for the CRAY XMP, CRAY 2, and CYBER 205, using a matrix of dimension of 20,000 with from 1 percent to 6 percent nonzeros. Efficient scatter/gather capabilities add coding flexibility and yield significant improvements in performance. For the CYBER 205, it is shown that minor changes in the IO can reduce the CPU time by a factor of 50. Similar changes in the CRAY codes make a far smaller improvement.

Bauschlicher, Charles W., Jr.↗

Overview of numerical codes developed for predicted electrothermal deicing of aircraft blades

An overview of the deicing computer codes that have been developed at the University of Toledo under sponsorship of the NASA-Lewis Research Center is presented. These codes simulate the transient heat conduction and phase change occurring in an electrothermal deicier pad that has an arbitrary accreted ice shape on its surface. The codes are one-dimensional rectangular, two-dimensional rectangular, and two-dimensional with a coordinate transformation to model the true blade geometry. All modifications relating to the thermal physics of the deicing problem that have been incorporated into the codes will be discussed. Recent results of reformulating the codes using different numerical methods to increase program efficiency are described. In particular, this reformulation has enabled a more comprehensive two-dimensional code to run in much less CPU time than the original version. The code predictions are compared with experimental data obtained in the NASA-Lewis Icing Research Tunnel with a UH1H blade fitted with a B. F. Goodrich electrothermal deicer pad. Both continuous and cyclic heater firing cases are considered. The major objective in this comparison is to illustrate which codes give acceptable results in different regions of the airfoil for different heater firing sequences.

Keith, Theo G.↗

Generation of three-dimensional unstructured grids by the advancing-front method

The generation of three-dimensional unstructured grids using the advancing-front technique is described. While this generation technique has been shown to be effective for the generation of unstructured grids in two dimensions, its extension to three-dimensional regions required the development of surface definition software and sophisticated data structures to avoid excessive CPU-time overheads for the search operations involved. After obtaining an initial triangulation of the surfaces, tetrahedrons are generated by successively deleting faces from the generation front. Details of the mesh generation algorithm are given, together with examples and timings.

Lohner, Rainald↗

Temporal and spatial adaptive algorithm for reacting flows

A numerical integration scheme for quasi-one-dimensional unsteady flows with finite-rate chemistry is developed and demonstrated. The governing Euler and species-conservation equations are derived; the integration method and the spatial and temporal grid embedding techniques are explained; and results for sample problems involving stream-tube flow with one dissociating gas, shock-tube flow with one dissociating gas, and diverging-channel flow with multiple reactions are presented in extensive graphs and briefly characterized. Accuracy comparable to that of globally fine grid solutions is obtained with significant savings in CPU time.

Pervaiz, Mehtab M.↗

A parallel householder tridiagonalization stratagem using scattered row decomposition

Householder's method for tridiagonalizing a real symmetric matrix, a major step in evaluating eigenvalues of the matrix, is modified into a parallel algorithm for a concurrent machine of message passing type. Each processor of the concurrent machine has its own CPU, communications control and local memory. Messages are passed through connections between processors. Although the basic algorithm is inherently serial, the computations can be spread over all processors by scattering different rows of the matrix into processors, hence the term 'Scattered Row Decomposition'. The steps in the serial and the parallel algorithms are identified. Expressions for efficiency and speedup are given in terms of problem and machine parameters. For a concurrent machine of ring type interconnection, a selected representative problem of large order exhibits efficiency approaching 66 per cent.

Chang, H. Y.↗

Vectorization of a particle simulation method for hypersonic rarefied flow

An efficient particle simulation technique for hypersonic rarefied flows is presented at an algorithmic and implementation level. The implementation is for a vector computer architecture, specifically the Cray-2. The method models an ideal diatomic Maxwell molecule with three translational and two rotational degrees of freedom. Algorithms are designed specifically for compatibility with fine grain parallelism by reducing the number of data dependencies in the computation. By insisting on this compatibility, the method is capable of performing simulation on a much larger scale than previously possible. A two-dimensional simulation of supersonic flow over a wedge is carried out for the near-continuum limit where the gas is in equilibrium and the ideal solution can be used as a check on the accuracy of the gas model employed in the method. Also, a three-dimensional, Mach 8, rarefied flow about a finite-span flat plate at a 45 degree angle of attack was simulated. It utilized over 10 to the 7th particles carried through 400 discrete time steps in less than one hour of Cray-2 CPU time. This problem was chosen to exhibit the capability of the method in handling a large number of particles and a true three-dimensional geometry.

Mcdonald, Jeffrey D.↗

Frequency optimization of repetitive lattice beam-like structures using a continuum model

A new method for obtaining the maximum frequency design of a beam-like repetitive lattice structure is presented. Using existing techniques, the lattice is first modeled as an equivalent anisotropic Timoshenko beam. The computation of the stiffness and inertial properties of the beam, determined by matching the strain and kinetic energies of the beam with those of the lattice, is facilitated by the repetitive nature of the lattice. The optimum design is obtained by maximizing Rayleigh's quotient using methods of variational calculus. For the problem selected, results show excellent agreement with those obtained by traditional finite-element methods. Moreover, unlike FE methods, cpu time is relatively unaffected by the size of the truss.

Reiss, Robert↗

Computational unsteady aerodynamics for lifting surfaces

Two dimensional problems are solved using numerical techniques. Navier-Stokes equations are studied both in the vorticity-stream function formulation which appears to be the optimal choice for two dimensional problems, using a storage approach, and in the velocity pressure formulation which minimizes the number of unknowns in three dimensional problems. Analysis shows that compact centered conservative second order schemes for the vorticity equation are the most robust for high Reynolds number flows. Serious difficulties remain in the choice of turbulent models, to keep reasonable CPU efficiency.

Edwards, John W.↗