SC

We have implemented Quantum Chromo-Dynamics (QCD) on the massively parallel Connection Machine in ^*Lisp. The code uses dynamical Wilson fermions and the Hybrid Monte Carlo Algorithm (HMCA) to update the lattice. We describe our program and give ...

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 ...

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 ...

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 ...

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 10⁶ hard sphere diatomic molecules using ...

Aerothermodynamics is defined¹ 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 ...

We use two large simulations, the chemical reaction dynamics of H + H₂ 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 ...

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 ...

The Circuit Analysis is very important in the development of LSI. We have been conducting the speed-up of the circuit analysis program SPICE-GT. SPICE-GT is based on the SPICE 2G.6 program from the University of California Berkely. We achieved speed-up ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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, ...

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 ...

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)¹. One of the most important computer codes developed at Watson is a ...

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 ...

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 ...

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) ...

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 ...

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 ...

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 = RR^T, where R is the lower triangular Cholesky factor. This is a compute ...

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 ...

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 ...

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 ...

The wavefront solver is a type of linear equation solver that is suitable for solving the system of linear equations that arises in many finite-element applications. A new version of the wavefront solver was recently introduced into the ANSYS® program ...

Integrated vision systems employ a sequence of image understanding algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute an integrated vision systems exhibit different ...

The singular value decomposition (SVD) has many real-time applications. Recently, there has been much interest in developing efficient methods to compute SVD in parallel machines. This paper presents an efficient method for computing SVD in a cube ...