By Topic

Supercomputing, 1989. Supercomputing '89. Proceedings of the 1989 ACM/IEEE Conference on

Date 12-17 Nov. 1989

Filter Results

Displaying Results 1 - 25 of 94
  • Vectorization on Monte Carlo particle transport: an architectural study using the LANL benchmark “GAMTEB”

    Publication Year: 1989 , Page(s): 10 - 20
    Cited by:  Papers (4)
    Click to expandAbstract | PDF file iconPDF (970 KB)  

    Fully vectorized versions of the Los Alamos National Laboratory benchmark code Gamteb, a Monte Carlo photon transport algorithm, were developed for the Cyber 205/ETA-10 and Cray X-MP/Y-MP architectures. Single-processor performance measurements of the vector and scalar implementations were modeled in a modified Amdahl's Law that accounts for additional data motion in the vector code. The performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing a large scientific code - methods, issues, and concerns

    Publication Year: 1989 , Page(s): 21 - 31
    Click to expandAbstract | PDF file iconPDF (1057 KB)  

    Objectives of this study were to develop techniques and methods for effective analysis of large codes; to determine the feasibility of parallelizing an existing large scientific code; and to estimate potential speedups attainable, and associated tradeoffs in design complexity and work effort, if the code were parallelized by redesign for a distributed memory system (NCube, iPSC hypercube), or stra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benchmark calculations with an unstructured grid flow solver on a SIMD computer

    Publication Year: 1989 , Page(s): 32 - 41
    Cited by:  Papers (1)
    Click to expandAbstract | PDF file iconPDF (924 KB)  

    An unstructured grid flow solver was implemented on a massively parallel computer, and benchmark computations were performed. The solver was a two-dimensional computational fluid dynamics (CFD) code that performs first-order, steady-state solutions of the Euler equations. The parallel computer employed was the Connection Machine made by Thinking Machines, Corp. The CFD code was programmed in *Lisp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of a hypersonic rarefied flow particle simulation on the connection machine

    Publication Year: 1989 , Page(s): 42 - 49
    Click to expandAbstract | PDF file iconPDF (895 KB)  

    A very efficient direct particle simulation algorithm for hypersonic rarefied flows is presented and its implementation on a Connection Machine is described. The implementation is capable of simulating up to 4 x 106 hard sphere diatomic molecules using 64k processors with a performance better than that of a similar, fully vectorized implementation using a single processor of the Cray 2. Results fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational aerothermodynamics

    Publication Year: 1989 , Page(s): 51 - 57
    Click to expandAbstract | PDF file iconPDF (636 KB)  

    Aerothermodynamics is defined1 as “the study of the relationship of heat and mechanical energy in gases, especially air”. To those familiar with fluid dynamics (the study of the flow properties of liquids and gases) this means that we must consider thermodynamic and chemical processes as they are coupled to the fluid motion. Computational fluid dynamics involves the numerical simul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical parallel supercomputing: examples from chemistry and physics

    Publication Year: 1989 , Page(s): 58 - 69
    Cited by:  Papers (1)
    Click to expandAbstract | PDF file iconPDF (1120 KB)  

    We use two large simulations, the chemical reaction dynamics of H + H2 and the collision of two galaxies to show that current parallel machines are capable of large supercomputer level calculations. We contrast the different architectural tradeoffs for these problems and draw some implications for future production parallel supercomputers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capability of current supercomputers for the computational fluid dynamics

    Publication Year: 1989 , Page(s): 71 - 80
    Click to expandAbstract | PDF file iconPDF (986 KB)  

    The computer code named LANS3D, one of the representative Navier-Stokes codes in Japan, is taken as a example and the capability of the current CFD technology is discussed. This code was developed for the numerical simulation of high-Reynolds number compressible flows. The algorithm used in this code and how it has been improved so far explain two important aspects of the computational fluid dynam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computations of soil temperature rise due to HVDC ground return

    Publication Year: 1989 , Page(s): 86 - 95
    Click to expandAbstract | PDF file iconPDF (711 KB)  

    The purpose of this paper is to present an application which historically, did not make use of computing methodology in the solution of design problems. The design of High Voltage Direct Current (HVDC) ground electrodes involves the careful selection of several parameters in order to meet strict operating constraints. In particular, the operation of HVDC ground electrodes, results in a rise of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A radar simulation program for a 1024-processor hypercube

    Publication Year: 1989 , Page(s): 96 - 105
    Cited by:  Papers (2)
    Click to expandAbstract | PDF file iconPDF (1092 KB)  

    We have developed a fast parallel version of an existing synthetic aperture radar (SAR) simulation program, SRIM. On a 1024-processor NCUBE hypercube it runs an order of magnitude faster than on a CRAY X-MP or CRAY Y-MP processor. This speed advantage is coupled with an order of magnitude advantage in machine acquisition cost. SRIM is a somewhat large (30,000 lines of Fortran 77) program designed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel MIMD programming for global models of atmospheric flow

    Publication Year: 1989 , Page(s): 106 - 112
    Cited by:  Papers (1)
    Click to expandAbstract | PDF file iconPDF (596 KB)  

    Modeling atmospheric flow is one application of supercomputers. In this paper we present some concepts for implementing global flow algorithms on shared memory multiprocessors. We describe how an analysis of the algorithms combined with the appropriate parallel programming language support allows an efficient and computationally correct implementation, which minimizes the synchronization difficult... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational fluid dynamic-current capabilities and directions for the future

    Publication Year: 1989 , Page(s): 113 - 122
    Click to expandAbstract | PDF file iconPDF (4935 KB)  

    Computational fluid dynamics (CFD) has made great strides in the detailed simulation of complex fluid flows, including some of those not before understood. It is now being routinely applied to some rather complicated problems, and starting to impact the design cycle of aerospace flight vehicles and their components. It is being used to complement and is being complemented by experimental studies. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel algorithm and VLSI architecture for a robot's inverse kinematics

    Publication Year: 1989 , Page(s): 123 - 132
    Click to expandAbstract | PDF file iconPDF (545 KB)  

    The inverse solutions of a robotic systems are generally produced by a serial process. Due to the computing time of processing geometry data and generating an inverse solution corresponding to a specified point in Cartesian trajectory is larger than the sampling period, the missing points in the joint space are generated by some interpolation schemes (linear or cubic spline interpolations) between... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supercomputers in computational ocean acoustics

    Publication Year: 1989 , Page(s): 133 - 140
    Click to expandAbstract | PDF file iconPDF (550 KB)  

    In this paper, we report on some computational experience in solving ocean acoustic propagation problems in three dimensions on supercomputers. The underlying Helmholtz equation is transformed into a parabolic-type equation in the Lee-Saad-Schultz model [5], which has a natural alternating direction implicit (ADI) implementation. We give estimates of the computing power required to solve problems ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study of dissipation operators for the euler equations and a three- dimensional channel flow

    Publication Year: 1989 , Page(s): 141 - 151
    Click to expandAbstract | PDF file iconPDF (1049 KB)  

    Explicit methods for the solution of fluid flow problems are of considerable interest in supercomputing. These methods parallelize well. The treatment of the boundaries is of particular interest both with respect to the numeric behavior of the solution, and the computational efficiency. We have solved the three-dimensional Euler equations for a twisted channel using second-order, centered differen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computer assisted optimal depth lower bound for sorting networks with nine inputs

    Publication Year: 1989 , Page(s): 152 - 161
    Click to expandAbstract | PDF file iconPDF (852 KB)  

    It is demonstrated that there is no nine-input sorting network of depth six. The proof was obtained by executing on a supercomputer a branch-and-bound algorithm which constructs and tests a critical subset of all possible candidates. Such proofs can be classified as experimental science, rather than mathematics. In keeping with the paradigms of experimental science, a high-level description of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realities associated with parallel processing

    Publication Year: 1989 , Page(s): 162 - 174
    Click to expandAbstract | PDF file iconPDF (742 KB)  

    At the T. J. Watson Research Center, there is a very active Condensed Matter Physics Group engaged in the study of semiconductors such as silicon (Si) and gallium-arsenide (Ga-As)1. One of the most important computer codes developed at Watson is a Density Functional Program which is used to study the electronic structure of semiconductors. This program also consumes the most CPU time of all other ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How a SIMD machine can implement a complex cellular automata? a case study: von Neumann's 29-state cellular automaton

    Publication Year: 1989 , Page(s): 175 - 186
    Cited by:  Papers (2)  |  Patents (1)
    Click to expandAbstract | PDF file iconPDF (850 KB)  

    This study is a part of an effort to simulate the 29-state self-reproducing cellular automaton described by John von Neumann in a manuscript that dates back to 1952. We are interested in the programming of very large SIMD arrays which, as a consequence of scaling them up, incorporate some features of cellular automata. Designing tools for programming them requires an experimental ground: consideri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic vectorization of character string manipulation and relational operations in Pascal

    Publication Year: 1989 , Page(s): 187 - 196
    Click to expandAbstract | PDF file iconPDF (824 KB)  

    In our paper of Supercomputing '88, an overview of V-Pascal, an automatic vectorizing compiler for Pascal, was presented with focus on its Version 1. In that paper, as one of those higher functions to be added to Version 2 V-Pascal, vector-mode execution of nonnummeric operations such as relational database operations and nonnumeric data manipulations was considered. This paper describes the actua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural network simulation on shared-memory vector multiprocessors

    Publication Year: 1989 , Page(s): 197 - 204
    Cited by:  Papers (2)
    Click to expandAbstract | PDF file iconPDF (500 KB)  

    We simulate three neural networks on a vector multiprocrssor. The training time can be reduced significantly especially when the training data size is large. These three neural networks are: 1) the feedforward network, 2) the recurrent network and 3) the Hopfield network. The training algorithms are programmed in such a way to best utilize 1) the inherent parallelism in neural computing, and 2) th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent and vectorized Monte Carlo simulation of the evolution of an assembly of particles increasing in number

    Publication Year: 1989 , Page(s): 205 - 214
    Click to expandAbstract | PDF file iconPDF (1124 KB)  

    Parallel Monte Carlo techniques for simulating the evolution of an assembly of charged particles interacting with a background gas medium under the influence of the electrical field are presented. This simulation problem has inherent parallelism in nature. All the particles can be traced independently in a short time interval. We have overcome three major difficulties: 1) the number of particles t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Protein structure prediction by a data-level parallel algorithm

    Publication Year: 1989 , Page(s): 215 - 223
    Cited by:  Papers (1)  |  Patents (1)
    Click to expandAbstract | PDF file iconPDF (739 KB)  

    We have developed a software system, PHI-PSI, on the Connection Machine that uses a parallel algorithm to retrieve and use information from a database of 112 known protein structures (selected from the Brookhaven Protein Databank) to predict the structures of other proteins. The φ and angles of each amino acid (the angles each amino acid forms with its immediate neighbors) in a protein are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector and parallel algorithms for Cholesky factorization on IBM 3090

    Publication Year: 1989 , Page(s): 225 - 233
    Cited by:  Papers (5)
    Click to expandAbstract | PDF file iconPDF (721 KB)  

    In many engineering applications, a solution of Fx = b is required, where F is a positive definite symmetric matrix. This is usually done by the Cholesky factorization, F = RRT, where R is the lower triangular Cholesky factor. This is a compute intensive problem. However, in order to achieve the best possible performance on IBM 3090 Vector Facility, the problem requires blocking at various levels ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FFTs in external or hierarchical memory

    Publication Year: 1989 , Page(s): 234 - 242
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (648 KB)  

    Conventional algorithms for computing large one-dimensional fast Fourier transforms (FFTs), even those algorithms recently developed for vector and parallel computers, are largely unsuitable for systems with external or hierarchical memory. The principal reason for this is the fact that most FFT algorithms require at least m complete passes through the data set to compute a 2m-point FFT. This pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Macrotasking the singluar value decomposition of block circulant matrices on the Cray-2

    Publication Year: 1989 , Page(s): 243 - 247
    Cited by:  Papers (1)
    Click to expandAbstract | PDF file iconPDF (371 KB)  

    A parallel algorithm to compute the singular value decomposition (SVD) of block circulant matrices on the Cray-2 is described. For a block circulant form described by M blocks with m x n elements in each block, the computation time using an SVD algorithm for general matrices has a lower bound (M3min(m, n)mn). Using a combination of fast Fourier transform (FFT) and SVD steps, the computation time f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A block QR factorization algorithm using restricted pivoting

    Publication Year: 1989 , Page(s): 248 - 256
    Click to expandAbstract | PDF file iconPDF (755 KB)  

    This paper presents a new algorithm for computing the QR factorization of a rank-deficient matrix on high-performance machines. The algorithm is based on the Householder QR factorization algorithm with column pivoting. The traditional pivoting strategy is not well suited for machines with a memory hierarchy since it precludes the use of matrix-matrix operations. However, matrix-matrix operations p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.