Gauss-Jordan inversion with pivoting on the Caltech Mark II hypercube

Authors:
P. G. Hipes;A. Kuppermann
Affiliations:
Caltech Concurrent Computation Project, 206-49, California Institute of Technology, Pasadena, CA;Caltech Concurrent Computation Project, 206-49, California Institute of Technology, Pasadena, CA
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 4
Cited 7

Parallel Guassian elimination on an optically interconnected data flow computer

Mathematics and Computers in Simulation
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems

Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Implementing Gauss Jordan on a hypercube multicomputer

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
A Survey of Parallel Machine Organization and Programming

ACM Computing Surveys (CSUR)

What have we learnt from using real parallel machines to solve real problems?

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Chemical reaction dynamics: integration of coupled sets of ordinary differential equations on the Caltech hypercube

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Optimal matrix algorithms on homogeneous hypercubes

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Practical parallel supercomputing: examples from chemistry and physics

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Practical aspects and experiences Scalable massively parallel algorithms for computational nanoelectronics

Parallel Computing
Finite-Element Analysis on a PC

IEEE Software
Modelling and analysis of communication overhead for parallel matrix algorithms

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The performance of a parallel Gauss-Jordan matrix inversion1,2 algorithm on the Mark II hypercube3 at Caltech is discussed. We will show that parallel Gauss-Jordan inversion is superior to parallel Gaussian elimination for inversion, and discuss the reasons for this. Empirical and theoretical efficiencies for parallel Gauss-Jordan inversion as a function of matrix dimension for different numbers and configurations of processors are presented. The theoretical efficiencies are in quantitative agreement with the empirical efficiencies.