Sparse matrix calculations on the CRAY-2

DOI10.1016/0167-8191(87)90006-8MaRDI QIDQ1094089zbMATH OpenOpenAlexFDO

Authors Ameet K. Dave, Iain S. Duff

Publication date 1987

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(87)90006-8

zbMATH Keywords

CRAY-2 computerfrontal matrixfrontal methodsGauss eliminationindirect addressinglinear algebra kernelsparallelismsparse matrix routinesvectorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Theory of operating systems (68N25)

Review text

This paper presents the results of preliminary testing of sparse matrix routines on a CRAY-2 computer. Initially the main architectural differences between the CRAY-1 and CRAY-2 are briefly outlined. The CRAY- 1 has an asymptotic rate of 150 Mflops on one processor, as against 459 Mflops for the CRAY-2 if both arithmetic pipes are kept busy, and it is shown that this rate is closely approached for large matrix-matrix multiplications. Various linear algebra kernels and corresponding codes have been tested in the sparse matrix case, giving particular emphasis to frontal methods. The frontal matrix is of the form \(\left[\begin{matrix} A\quad B\\ C\quad D\end{matrix} \right],\) where A and D are square matrices of size \(k\) and \(r\), respectively, with \(k\ll r\); and at this stage, \(k\) steps of Gauss elimination are performed on the frontal matrix [the second author, \textit{A. M. Erisman} and \textit{J. K. Reid}, Direct methods for sparse matrices. Oxford: Clarendon Press (1986; Zbl 0604.65011)]. Inner loops are given which lead to good rates. The paper concludes with comments on the use of indirect addressing.

Recommendations

• Sparse Matrix Computations on Parallel Processor Arrays
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• scientific article; zbMATH DE number 4117735
• Extra High Speed Matrix Multiplication on the Cray-2
• Parallel sparse matrix solution and performance
• scientific article; zbMATH DE number 833704
• Large-Scale Scientific Computing
• Sparse matrix-vector multiplication on GPGPUs

Cited in

(7)

• An efficient nonsymmetric Lanczos method on parallel vector computers
• Further measurements of \((r_{\infty},n_{1/2})\) on the CRAY-1 and CRAY X-MP
• SPARSE MATRIX MULTIPLICATION ON VECTOR COMPUTERS
• Extra High Speed Matrix Multiplication on the Cray-2
• scientific article; zbMATH DE number 1505545 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• An evaluation of the solution of linear systems arising from 3D elasticity problems

Describes a project that uses

Uses Software

• MA32

This page was built for publication: Sparse matrix calculations on the CRAY-2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094089)