Hypercube matrix multiplication

DOI10.1016/0167-8191(93)90064-RMaRDI QIDQ686633zbMATH OpenFDO

Authors P. A. Nelson

Publication date 10 October 1993

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

performancehypercubesparallel computersmatrix multiplication algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Communication-efficient matrix multiplication on hypercubes
• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Parallel algorithms and architectures for matrix multiplication
• Sparse matrix computations on the hypercube and related networks
• Matrix and vector operations on hypercube parallel processors

Cited in

(13)

• Parallel algorithms and architectures for matrix multiplication
• Hypercubes As Direct Products
• A RECURRENCE-FREE VARIANT OF STRASSEN'S ALGORITHM ON HYPERCUBE∗
• Matrix and vector operations on hypercube parallel processors
• Communication-efficient matrix multiplication on hypercubes
• On the performance of parallel matrix factorisation on the hypermesh
• Transposition of banded matrices in hypercubes: A nearly isotropic task
• scientific article; zbMATH DE number 4096756 (Why is no real title available?)
• Sparse matrix computations on the hypercube and related networks
• Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube
• An algorithm for multiplication of concatenated matrices
• Parallel matrix inversion on a subcube-grid
• Measuring the performance for parallel matrix multiplication algorithm

This page was built for publication: Hypercube matrix multiplication

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