Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer performance”

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 1,765 records · Page 98

Estimation of 3D Woven Design Sensitivities Using a Rapid Multiscale Analysis Technique

Highly-refined finite element models of three-dimension (3D) woven composite systems currently require excessive computational demands that limit their use in sensitivity analysis, uncertainty quantification, and optimization. An alternative analysis methodology was developed using the NASA Multiscale Analysis Tool (NASMAT) where multiscale models of a 3D woven composite (including inter-tow matrix voids and constituent failure) can be completed on a single central processing unit(CPU)on the order of ~30 s. To develop inputs and validation data for the NASMAT model, coupon and acid-digesting testing and x-ray computed tomography were performed. The NASMAT inputs were parameterized using a set of 25 input variables and distributions. These inputs were randomly sampled to generate a total of 100,000 NASMAT analyses that could be used to understand the influence of different material and geometric properties on the warp and weft-direction stiffness and strength. These analyses (including pre/post-processing) were performed in less than eight hours on a 120 CPU cluster. The computational efficiency of the NASMAT model enabled a sensitivity analysis to be performed, and dominant input variables were able to be identified. Key results were consistent with theoretical and experimental observations for the specific 3D woven system studied in this work.

NASMAT↗

Estimation of 3D Woven Design Sensitivities Using a Rapid Multiscale Analysis Technique

Highly-refined finite element models of three-dimension (3D) woven composite systems currently require excessive computational demands that limit their use in sensitivity analysis, uncertainty quantification, and optimization. An alternative analysis methodology was developed using the NASA Multiscale Analysis Tool (NASMAT) where multiscale models of a 3D woven composite (including inter-tow matrix voids and constituent failure) can be completed on a single central processing unit (CPU) on the order of ~30s. To develop inputs and validation data for the NASMAT model, coupon and acid-digesting testing and x-ray computed tomography were performed. The NASMAT inputs were parameterized using a set of 25 input variables and distributions. These inputs were randomly sampled to generate a total of 100,000 NASMAT analyses that could be used to understand the influence of different material and geometric properties on the warp and weft-direction stiffness and strength. These analyses (including pre/post-processing) were performed in less than eight hours on a 120 CPU cluster. The computational efficiency of the NASMAT model enabled a sensitivity analysis to be performed, and dominant input variables were able to be identified. Key results were consistent with theoretical and experimental observations for the specific 3D woven system studied in this work.

NASMAT↗

Innovative architectures for dense multi-microprocessor computers

The purpose is to summarize a Phase 1 SBIR project performed for the NASA/Langley Computational Structural Mechanics Group. The project was performed from February to August 1987. The main objectives of the project were to: (1) expand upon previous research into the application of chordal ring architectures to the general problem of designing multi-microcomputer architectures, (2) attempt to identify a family of chordal rings such that each chordal ring can be simply expanded to produce the next member of the family, (3) perform a preliminary, high-level design of an expandable multi-microprocessor computer based upon chordal rings, (4) analyze the potential use of chordal ring based multi-microprocessors for sparse matrix problems and other applications arising in computational structural mechanics.

Larson, Robert E.↗

Systems cost/performance analysis (study 2.3). Volume 3: Programmer's manual and user's guide

The systems cost/performance model was implemented as a digital computer program to perform initial program planning, cost/performance tradeoffs, and sensitivity analyses. The computer is described along with the operating environment in which the program was written and checked, the program specifications such as discussions of logic and computational flow, the different subsystem models involved in the design of the spacecraft, and routines involved in the nondesign area such as costing and scheduling of the design. Preliminary results for the DSCS-II design are also included.

Janz, R. F.↗

Shaded-Color Picture Generation of Computer-Defined Arbitrary Shapes

SHADE computer program generates realistic color-shaded pictures from computer-defined arbitrary shapes. Objects defined for computer representation displayed as smooth, color-shaded surfaces, including varying degrees of transparency. Results also used for presentation of computational results. By performing color mapping, SHADE colors model surface to display analysis results as pressures, stresses, and temperatures. NASA has used SHADE extensively in sign and analysis of high-performance aircraft. Industry should find applications for SHADE in computer-aided design and computer-aided manufacturing. SHADE written in VAX FORTRAN and MACRO Assembler for either interactive or batch execution.

Cozzolongo, J. V.↗

Are Event Traces Really That Necessary?

Many performance monitoring tools are currently available to the super-computing community. The performance data gathered and analyzed by these tools fall under two categories: statistics and event traces. Statistical data is much more compact but lack the probative power event traces offer. Event traces, on the other hand, can easily fill up the entire file system during execution such that the instrumented execution have to be terminated. In this paper, we propose an innovative methodology for monitoring and trace representation that offers a middle ground. The user can trace-off trace data size vs. quality incrementally. Specifically, the user will be able to limit the amount of trace collected and, at the same time, carry out some of the analysis event traces offer for the entire execution. With the help of a few CFD examples, we illustrate the use of our technique in performance tuning. We also compare quantitatively, the quality of the traces we collected vs. event traces.

Schmidt, Melisa↗

Constructing Space-Time Views from Fixed Size Statistical Data: Getting the Best of Both Worlds

Many performance monitoring tools are currently available to the super-computing community. The performance data gathered and analyzed by these tools fall under two categories: statistics and event traces. Statistical data is much more compact but lacks the probative power event traces offer. Event traces, on the other hand, can easily fill up the entire file system during execution such that the instrumented execution may have to be terminated half way through. In this paper, we propose an innovative methodology for performance data gathering and representation that offers a middle ground. The user can trade-off tracing overhead, trace data size vs. data quality incrementally. In other words, the user will be able to limit the amount of trace collected and, at the same time, carry out some of the analysis event traces offer using spacetime views for the entire execution. Two basic ideas are employed: the use of averages to replace recording data for each instance and "formulae" to represent sequences associated with communication and control flow. With the help of a few simple examples, we illustrate the use of these techniques in performance tuning and compare the quality of the traces we collected vs. event traces. We found that the trace files thus obtained are, in deed, small, bounded and predictable before program execution and that the quality of the space time views generated from these statistical data are excellent. Furthermore, experimental results showed that the formulae proposed were able to capture 100% of all the sequences associated with 11 of the 15 applications tested. The performance of the formulae can be incrementally improved by allocating more memory at run-time to learn longer sequences.

Schmidt, Melisa↗

Constructing Space-Time Views from Fixed Size Statistical Data: Getting the Best of both Worlds

Many performance monitoring tools are currently available to the super-computing community. The performance data gathered and analyzed by these tools fall under two categories: statistics and event traces. Statistical data is much more compact but lacks the probative power event traces offer. Event traces, on the other hand, can easily fill up the entire file system during execution such that the instrumented execution may have to be terminated half way through. In this paper, we propose an innovative methodology for performance data gathering and representation that offers a middle ground. The user can trade-off tracing overhead, trace data size vs. data quality incrementally. In other words, the user will be able to limit the amount of trace collected and, at the same time, carry out some of the analysis event traces offer using space-time views for the entire execution. Two basic ideas arc employed: the use of averages to replace recording data for each instance and formulae to represent sequences associated with communication and control flow. With the help of a few simple examples, we illustrate the use of these techniques in performance tuning and compare the quality of the traces we collected vs. event traces. We found that the trace files thus obtained are, in deed, small, bounded and predictable before program execution and that the quality of the space time views generated from these statistical data are excellent. Furthermore, experimental results showed that the formulae proposed were able to capture 100% of all the sequences associated with 11 of the 15 applications tested. The performance of the formulae can be incrementally improved by allocating more memory at run-time to learn longer sequences.

Schmidt, Melisa↗

Computer Electromagnetics and Supercomputer Architecture

The dramatic increase in performance over the last decade for microporcessor computations is compared with that for the supercomputer computations. This performance, the projected performance, and a number of other issues such as cost and the inherent pysical limitations in curent supercomputer technology have naturally led to parallel supercomputers and ensemble of interconnected microprocessors.

Electromagnetics Microprocessors Computers↗

Noncoherent DTTLs for Symbol Synchronization

Noncoherent data-transition tracking loops (DTTLs) have been proposed for use as symbol synchronizers in digital communication receivers. [Communication- receiver subsystems that can perform their assigned functions in the absence of synchronization with the phases of their carrier signals ( carrier synchronization ) are denoted by the term noncoherent, while receiver subsystems that cannot function without carrier synchronization are said to be coherent. ] The proposal applies, more specifically, to receivers of binary phase-shift-keying (BPSK) signals generated by directly phase-modulating binary non-return-to-zero (NRZ) data streams onto carrier signals having known frequencies but unknown phases. The proposed noncoherent DTTLs would be modified versions of traditional DTTLs, which are coherent. The symbol-synchronization problem is essentially the problem of recovering symbol timing from a received signal. In the traditional, coherent approach to symbol synchronization, it is necessary to establish carrier synchronization in order to recover symbol timing. A traditional DTTL effects an iterative process in which it first generates an estimate of the carrier phase in the absence of symbol-synchronization information, then uses the carrier-phase estimate to obtain an estimate of the symbol-synchronization information, then feeds the symbol-synchronization estimate back to the carrier-phase-estimation subprocess. In a noncoherent symbol-synchronization process, there is no need for carrier synchronization and, hence, no need for iteration between carrier-synchronization and symbol- synchronization subprocesses. The proposed noncoherent symbolsynchronization process is justified theoretically by a mathematical derivation that starts from a maximum a posteriori (MAP) method of estimation of symbol timing utilized in traditional, coherent DTTLs. In that MAP method, one chooses the value of a variable of interest (in this case, the offset in the estimated symbol timing) that causes a likelihood function of symbol estimates over some number of symbol periods to assume a maximum value. In terms that are necessarily oversimplified to fit within the space available for this article, it can be said that the mathematical derivation involves a modified interpretation of the likelihood function that lends itself to noncoherent DTTLs. The proposal encompasses both linear and nonlinear noncoherent DTTLs. The performances of both have been computationally simulated; for comparison, the performances of linear and nonlinear coherent DTTLs have also been computationally simulated. The results of these simulations show that, among other things, the expected mean-square timing errors of coherent and noncoherent DTTLs are relatively insensitive to window width. The results also show that at high signal-to-noise ratios (SNRs), the performances of the noncoherent DTTLs approach those of their coherent counterparts at, while at low SNRs, the noncoherent DTTLs incur penalties of the order of 1.5 to 2 dB.

Simon, Marvin↗

Numerical simulation of shrouded propellers

A numerical model was developed for the evaluation of the performance characteristics of a shrouded propeller. Using this model, a computational study was carried out to investigate the feasibility of improving the aerodynamic performance of a propeller by encasing it in a shroud. The propeller blade was modeled by a segmented bound vortex positioned along the span of the blade at its quarter-chord-line. The shroud was modeled by a number of discrete vortex rings. Due to the mutual dependence of shroud and propeller vortex strengths and the propeller vortex wake an iterative scheme was employed. Three shroud configurations were considered: a cylindrical and two conical shrouds. The computed performance of the shrouded propeller was compared with that of a free propeller of identical propeller geometry. The numerical results indicated that the cylindrical shroud outperformed the conical shroud configurations for the cases considered. Furthermore, when compared to the free propeller performance, the cylindrical shroud showed a considerable performance enhancement over the free propeller. However, the improvements were found to decrease with an increase in the advance ratio and to virtually diminish at advance ratios of about 2.5.

Afjeh, Abdollah A.↗

A flight investigation of a terminal area navigation and guidance concept for STOL aircraft

A digital avionics system referred to as STOLAND has been test-flown in the NASA CV-340 to obtain performance data for time-controlled guidance in the manual flight director mode. The advanced system components installed in the cockpit included an electronic attitude director indicator and an electronic multifunction display. Navigation guidance and control computations were all performed in the digital computer. Approach paths were flown which included a narrow 180-deg turn and a 1-min, 5-deg straight-in approach to the 30-m altitude go-around point. Results are presented for 20 approaches: (1) blended radio/inertial navigation using TACAN and a microwave scanning beam landing guidance system (MODILS) permitted a smooth transition from area navigation (TACAN) to precision terminal navigation (MODILS), (2) guidance system (flight director) performance measured at an altitude of 30.5 m was within that prescribed for category II CTOL operations on a standard runway, and (3) time of arrival at a point about 2 mi from touchdown was about 4 sec plus or minus sec later than the computed nominal arrival time.

Smith, D. W.↗

The effect of transponder imperfections on the error probability performance of a satellite communication system

The bit error rate (BER) performance analysis of a data communication system is generally based on the assumption that signal waveforms are ideal and hardware-induced distortion is absent. In a satellite communication system such distortion arises in the satellite transponder, as well as in the transmitter and receiver portions. NASA, which is in the process of developing its Tracking and Data Relay Satellite System (TDRSS), is very much interested in understanding the impact of numerous forms of hardware distortion that have been identified on BER performance. The present paper examines the cumulative impact of nine forms of distortion induced by the transponder on BPSK and QPSK signals. For the present analysis, the transmitter and receiver are assumed to operate in essentially ideal fashions. Computed results indicate that BPSK and QPSK performances are affected in substantially different manners, with QPSK generally more sensitive to a given form of distortion. Cumulative distortion effects are illustrated via computed performance curves.

Weinberg, A.↗

Evolution of a high-performance storage system based on magnetic tape instrumentation recorders

In order to provide transparent access to data in network computing environments, high performance storage systems are getting smarter as well as faster. Magnetic tape instrumentation recorders contain an increasing amount of intelligence in the form of software and firmware that manages the processes of capturing input signals and data, putting them on media and then reproducing or playing them back. Such intelligence makes them better recorders, ideally suited for applications requiring the high-speed capture and playback of large streams of signals or data. In order to make recorders better storage systems, intelligence is also being added to provide appropriate computer and network interfaces along with services that enable them to interoperate with host computers or network client and server entities. Thus, recorders are evolving into high-performance storage systems that become an integral part of a shared information system. Data tape has embarked on a program with the Caltech sponsored Concurrent Supercomputer Consortium to develop a smart mass storage system. Working within the framework of the emerging IEEE Mass Storage System Reference Model, a high-performance storage system that works with the STX File Server to provide storage services for the Intel Touchstone Delta Supercomputer is being built. Our objective is to provide the required high storage capacity and transfer rate to support grand challenge applications, such as global climate modeling.

Peters, Bruce↗

Prediction of antenna array performance from subarray measurements

Computer runs were used to determine the effect of mechanical distortions on array pattern performance. Subarray gain data, along with feed network insertion loss, and insertion phase data were combined with the analysis of Ruze on random errors to predict gain of a full array.

Huisjen, M. A.↗

An Integrated Low-Speed Performance and Noise Prediction Methodology for Subsonic Aircraft

An integrated methodology has been assembled to compute the engine performance, takeoff and landing trajectories, and community noise levels for a subsonic commercial aircraft. Where feasible, physics-based noise analysis methods have been used to make the results more applicable to newer, revolutionary designs and to allow for a more direct evaluation of new technologies. The methodology is intended to be used with approximation methods and risk analysis techniques to allow for the analysis of a greater number of variable combinations while retaining the advantages of physics-based analysis. Details of the methodology are described and limited results are presented for a representative subsonic commercial aircraft.

Olson, E. D.↗

Contextual classification on PASM

The use of N microprocessors in the SIMD mode of parallel processing to do classifications almost N times faster than a single microprocessor is discussed. Examples of contextual classifiers are given, uniprocessor algorithms for performing contextual classifications are presented, and their computational complexity is analyzed. The SIMD mode of parallel processing is defined and PASM is overviewed. The presented uniprocessor algorithms are used as a basis for developing parallel algorithms for performing computationally intensive contextual classifications.

Siegel, H. J.↗

Performance Modeling of an Experimental Laser Propelled Lightcraft

A computational plasma aerodynamics model is developed to study the performance of an experimental laser propelled lightcraft. The computational methodology is based on a time-accurate, three-dimensional, finite-difference, chemically reacting, unstructured grid, pressure- based formulation. The underlying physics are added and tested systematically using a building-block approach. The physics modeled include non-equilibn'um thermodynamics, non-equilibrium air-plasma finite-rate kinetics, specular ray tracing, laser beam energy absorption and equi refraction by plasma, non-equilibrium plasma radiation, and plasma resonance. A series of transient computations are performed at several laser pulse energy levels and the simulated physics are discussed and compared with those of tests and literature. The predicted coupling coefficients for the lightcraft compared reasonably well with those of tests conducted on a pendulum apparatus.

Wang, Ten-See↗