Implementation of the conjugate gradient algorithm on a vector hypercube multiprocessor

Authors:
C. Aykanat;F. Ozguner;D. S. Scott
Affiliations:
Department of Electrical Engineering, The Ohio State University, Columbus, Ohio;Department of Electrical Engineering, The Ohio State University, Columbus, Ohi;Intel Scientific Computers, Beaverton, Oregon
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Year:
1989

Citing 3
Cited 1

The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers

Parallel Computing
A microprocessor-based hypercube supercomputer

IEEE Micro
Nearest-neighbor mapping of finite element graphs onto processor meshes

IEEE Transactions on Computers

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, parallel implementation and vectorization of the Scaled Conjugate Gradient (SCG) algorithm for the solution of large sparse linear system of equations, on a vector hypercube multiprocessor (iPSC- VX), is described. Computations in the SCG algorithm consist mainly of matrix operations that can be vectorized and are implemented on the Vector Processor on each node of the hypercube. The implementation described here achieves efficient parallelization by overlapping vectorized computations with inter-node communication. A speed-up of 58 over a µVax II is obtained for large finite element meshes.