Implementing Gauss Jordan on a hypercube multicomputer

Authors:
A. Gerasoulis;N. Missirlis;I. Nelken;R. Peskin
Affiliations:
Rutgers University, New Brunswick, NJ;Rutgers University, New Brunswick, NJ;Rutgers University, New Brunswick, NJ;Rutgers University, New Brunswick, NJ
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 3
Cited 3

Automatic translation of FORTRAN programs to vector form

ACM Transactions on Programming Languages and Systems (TOPLAS)
Gaussian elimination on hypercubes

Proceedings of the international workshop on Parallel algorithms & architectures
Solving Linear Algebraic Equations on an MIMD Computer

Journal of the ACM (JACM)

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
Gauss-Jordan inversion with pivoting on the Caltech Mark II hypercube

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
A comparison of several methods of integrating stiff ordinary differential equations on parallel computing architectures

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the solution of dense algebraic systems on the NCUBE hypercube via the Gauss Jordan method. Advanced loop interchange techniques are used to determine the appropriate algorithm for MIMD architectures. For a computer with p = n processors, we show that Gauss Jordan is competitive to Gaussian elimination when pivoting is not used. We experiment with three mappings of columns to processors: block, wrap and reflection. We demonstrate that load balancing the processors results in a considerable reduction of execution time.