A Caltech Library Service

Optimal matrix algorithms on homogeneous hypercubes

Fox, Geoffrey C. and Furmanski, Wojtek and Walker, David W. (1988) Optimal matrix algorithms on homogeneous hypercubes. In: C3P Proceedings of the third conference on Hypercube concurrent computers and applications. Vol.2. ACM , New York, NY, pp. 1656-1673. ISBN 0-89791-278-0.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collective communication routines for the hypercube. We show how a systematic application of scattering reduces load imbalance. A number of examples are considered (Gaussian elimination, Gauss-Jordan matrix inversion, the power method for eigenvectors, and tridiagonalisation by Householder's method), and the concurrent efficiencies are discussed.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1988 ACM. The support of the Department of Energy, under grant number DE-FG03-85ER25009, is gratefully acknowledged. The initial study of the Householder algorithm was due to T. Delbruck, and we would like to thank Paul Hipes for emphasising the relevance of the Gauss-Jordan algorithm.
Funding AgencyGrant Number
Department of Energy (DOE)DE-FG03-85ER25009
Record Number:CaltechAUTHORS:20161024-165545288
Persistent URL:
Official Citation:G. C. Fox, W. Furmanski, and D. W. Walker. 1989. Optimal matrix algorithms on homogeneous hypercubes. In Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (C3P), Geoffrey Fox (Ed.), Vol. 2. ACM, New York, NY, USA, 1656-1673. DOI=
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:71422
Deposited By: Kristin Buxton
Deposited On:25 Oct 2016 16:59
Last Modified:11 Nov 2021 04:44

Repository Staff Only: item control page