SEARCH · Engineering Papers

Results for “Scientific Computing”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1985

Magnetic tape user guide

This User Guide provides a general introduction to the structure, use, and handling of magnetic tapes at Langley Research Center (LaRC). The topics covered are tape terminology, physical characteristics, error prevention and detection, and creating, using, and maintaining tapes. Supplementary documentation is referenced where it might be helpful. The documentation is included for the tape utility programs, BLOCK, UNBLOCK, and TAPEDMP, which are available at the Central Scientific Computing Complex at LaRC.

Evans, A. B.↗

NASA NTRS1986

Communications oriented programming of parallel iterative solutions of sparse linear systems

Parallel algorithms are developed for a class of scientific computational problems by partitioning the problems into smaller problems which may be solved concurrently. The effectiveness of the resulting parallel solutions is determined by the amount and frequency of communication and synchronization and the extent to which communication can be overlapped with computation. Three different parallel algorithms for solving the same class of problems are presented, and their effectiveness is analyzed from this point of view. The algorithms are programmed using a new programming environment. Run-time statistics and experience obtained from the execution of these programs assist in measuring the effectiveness of these algorithms.

Patrick, M. L.↗

NASA NTRS1987

A bibliography on parallel and vector numerical algorithms

This is a bibliography of numerical methods. It also includes a number of other references on machine architecture, programming language, and other topics of interest to scientific computing. Certain conference proceedings and anthologies which have been published in book form are listed also.

Ortega, J. M.↗

NASA NTRS1987

A study of carbon monoxide distribution determinations for a global transport model

A system of programs which model the chemistry and transport of carbon monoxide and methane in the Earth's atmosphere on a global scale was installed onto the NASA-Langley central scientific computer network. This system, the GLOBAL system, consists of a user-friendly set of procedural files which allow for simplified pre-processing, execution, and post-processing for all program elements. The package includes procedures for obtaining the NMC meteorological data, calculating the vertical winds to satisfy mass conservation, determining the boundary layer, and executing the transport/chemical model for carbon monoxide. In addition, plotting, saving to tape, and reading from tape routines were developed. Final modifications to the subprograms for processing the input data for the transport/chemistry model have improved these data to more accurately reflect true atmospheric conditions. The transfer of the transport/chemistry model from the NCAR CRAY system to the NASA-Langley VPS-32 system was completed. The problems encountered during this process and their resolutions are discussed.

Peters, Leonard K.↗

NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗

NASA NTRS1988

Run-time parallelization and scheduling of loops

The class of problems that can be effectively compiled by parallelizing compilers is discussed. This is accomplished with the doconsider construct which would allow these compilers to parallelize many problems in which substantial loop-level parallelism is available but cannot be detected by standard compile-time analysis. We describe and experimentally analyze mechanisms used to parallelize the work required for these types of loops. In each of these methods, a new loop structure is produced by modifying the loop to be parallelized. We also present the rules by which these loop transformations may be automated in order that they be included in language compilers. The main application area of the research involves problems in scientific computations and engineering. The workload used in our experiment includes a mixture of real problems as well as synthetically generated inputs. From our extensive tests on the Encore Multimax/320, we have reached the conclusion that for the types of workloads we have investigated, self-execution almost always performs better than pre-scheduling. Further, the improvement in performance that accrues as a result of global topological sorting of indices as opposed to the less expensive local sorting, is not very significant in the case of self-execution.

Saltz, Joel H.↗

NASA NTRS1988

A bibliography on parallel and vector numerical algorithms

This is a bibliography on numerical methods. It also includes a number of other references on machine architecture, programming language, and other topics of interest to scientific computing. Certain conference proceedings and anthologies which have been published in book form are also listed.

Ortega, James M.↗

NASA NTRS1988

Solving large sparse eigenvalue problems on supercomputers

An important problem in scientific computing consists in finding a few eigenvalues and corresponding eigenvectors of a very large and sparse matrix. The most popular methods to solve these problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require the use of the matrix in the form of matrix by vector multiplications. The implementations on supercomputers of two such methods for symmetric matrices, namely Lanczos' method and Davidson's method are compared. Since one of the most important operations in these two methods is the multiplication of vectors by the sparse matrix, methods of performing this operation efficiently are discussed. The advantages and the disadvantages of each method are compared and implementation aspects are discussed. Numerical experiments on a one processor CRAY 2 and CRAY X-MP are reported. Possible parallel implementations are also discussed.

Philippe, Bernard↗

NASA NTRS1991

Distributed memory compiler design for sparse problems

A compiler and runtime support mechanism is described and demonstrated. The methods presented are capable of solving a wide range of sparse and unstructured problems in scientific computing. The compiler takes as input a FORTRAN 77 program enhanced with specifications for distributing data, and the compiler outputs a message passing program that runs on a distributed memory computer. The runtime support for this compiler is a library of primitives designed to efficiently support irregular patterns of distributed array accesses and irregular distributed array partitions. A variety of Intel iPSC/860 performance results obtained through the use of this compiler are presented.

Wu, Janet↗

NASA NTRS1991

Advanced visualization techniques

The scientific computing needs of the Earth Science and Application Division (ESAD) were evaluated, and it was determined whether the existing visualization environment provides the proper tools for meeting those needs. Some of the deficiencies were corrected using off-the-shelf software. The following subject areas are covered: (1) evaluation of visualization environment at ESAD; (2) definition of science needs; (3) evaluation of available sortware/hardware; and (4) definition of software development environment.

Botts, Mike↗

NASA NTRS1990

A bibliography on parallel and vector numerical algorithms

Ortega, James M.↗

NASA NTRS1992

Image processing mini manual

The intent is to provide an introduction to the image processing capabilities available at the Langley Research Center (LaRC) Central Scientific Computing Complex (CSCC). Various image processing software components are described. Information is given concerning the use of these components in the Data Visualization and Animation Laboratory at LaRC.

Matthews, Christine G.↗

NASA NTRS1992

Rigid body mode identification of the PAH-2 helicopter using the eigensystem realization algorithm

The rigid body modes of the PAH-2 'Tiger' helicopter were identified using the Eigensystem Realization Algorithm (ERA). This work complements ground vibration tests performed using DLR's traditional phase resonance technique and the ISSPA (Identification of Structural System Parameters) method. Rigid body modal parameters are important for ground resonance prediction. Time-domain data for ERA were obtained by inverse Fourier transformation of frequency response functions measured with stepped-sine excitation. Mode purity (based on the Phase Resonance Criterion) was generally equal to or greater than corresponding results obtained in the ground vibration tests. All identified natural frequencies and mode shapes correlate well with corresponding ground vibration test results. The modal identification approach discussed in this report has become increasingly attractive in recent years due to the steadily declining cost and increased performance of scientific computers. As illustrated in this application, modern time-domain methods can be successfully applied to data acquired using DLR's existing test equipment. Some suggestions are made for future applications of time domain modal identification in this manner.

Schenk, Axel↗

NASA NTRS1992

Production of SSM/I data sets

This Final Report is a summary of the work that was performed under Contract NAS8-38075 between NASA Marshall Space Flight Center and Remote Sensing Systems from September 1989 to September 1992. The primary accomplishment was the delivery of Special Sensor Microwave/Imager (SSM/I) data tapes containing sensor and geophysical products. In all, 515 tapes (80 gigabytes) were delivered. These tapes contained the F08 SSM/I data for the period from July 1988 through December 1991 and the F10 SSM/I data for the period from December 1990 through December 1991. For the F08 SSM/I, a data inventory was compiled and an engineering assessment was done. Ephemeris tables for the F08 and F10 spacecrafts were computed. Scientific studies on the oceanic wind vector and water vapor field were published, and color atlases of monthly ocean products were produced. This investigation was part of NASA's WETNET program.

Wentz, Frank J.↗

NASA NTRS1992

Mass storage system experiences and future needs at the National Center for Atmospheric Research

This presentation is designed to relate some of the experiences of the Scientific Computing Division at NCAR dealing with the 'data problem'. A brief history and a development of some basic Mass Storage System (MSS) principles are given. An attempt is made to show how these principles apply to the integration of various components into NCAR's MSS. There is discussion of future MSS needs for future computing environments.

Olear, Bernard T.↗

NASA NTRS1991

Mass storage system experiences and future needs at the National Center for Atmospheric Research

A summary and viewgraphs of a discussion presented at the National Space Science Data Center (NSSDC) Mass Storage Workshop is included. Some of the experiences of the Scientific Computing Division at the National Center for Atmospheric Research (NCAR) dealing the the 'data problem' are discussed. A brief history and a development of some basic mass storage system (MSS) principles are given. An attempt is made to show how these principles apply to the integration of various components into NCAR's MSS. Future MSS needs for future computing environments is discussed.

Olear, Bernard T.↗

NASA NTRS1993

CRAY mini manual. Revision D

This document briefly describes the use of the CRAY supercomputers that are an integral part of the Supercomputing Network Subsystem of the Central Scientific Computing Complex at LaRC. Features of the CRAY supercomputers are covered, including: FORTRAN, C, PASCAL, architectures of the CRAY-2 and CRAY Y-MP, the CRAY UNICOS environment, batch job submittal, debugging, performance analysis, parallel processing, utilities unique to CRAY, and documentation. The document is intended for all CRAY users as a ready reference to frequently asked questions and to more detailed information contained in the vendor manuals. It is appropriate for both the novice and the experienced user.

Tennille, Geoffrey M.↗

NASA NTRS1993

Flexible language constructs for large parallel programs

The goal of the research described is to develop flexible language constructs for writing large data parallel numerical programs for distributed memory (MIMD) multiprocessors. Previously, several models have been developed to support synchronization and communication. Models for global synchronization include SIMD (Single Instruction Multiple Data), SPMD (Single Program Multiple Data), and sequential programs annotated with data distribution statements. The two primary models for communication include implicit communication based on shared memory and explicit communication based on messages. None of these models by themselves seem sufficient to permit the natural and efficient expression of the variety of algorithms that occur in large scientific computations. An overview of a new language that combines many of these programming models in a clean manner is given. This is done in a modular fashion such that different models can be combined to support large programs. Within a module, the selection of a model depends on the algorithm and its efficiency requirements. An overview of the language and discussion of some of the critical implementation details is given.

Rosing, Matthew↗