Implementing Gauss Jordan on a hypercube multicomputer

A. Gerasoulis, N. Missirlis, I. Nelken, R. Peskin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988
EditorsGeoffrey Fox
PublisherAssociation for Computing Machinery, Inc
Pages1569-1576
Number of pages8
ISBN (Electronic)0897912780, 9780897912785
DOIs
StatePublished - Jan 3 1989
Event3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 - Pasadena, United States
Duration: Jan 19 1988Jan 20 1988

Publication series

NameProceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, C3P 1988
Volume2

Other

Other3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988
Country/TerritoryUnited States
CityPasadena
Period1/19/881/20/88

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Computer Graphics and Computer-Aided Design
  • Software
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Implementing Gauss Jordan on a hypercube multicomputer'. Together they form a unique fingerprint.

Cite this