Implementing Gauss Jordan on a hypercube multicomputer

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.