Communication efficient matrix multiplication on hypercubes
type: Item
instance of: scholarly article
title: Communication efficient matrix multiplication on hypercubes
zbMATH Open document ID: 0689.65024
DOI: 10.1016/0167-8191(89)90091-4
author: Jarle Berntsen
published in: Parallel Computing
publication date: 1989-01-01T00:00:00Z
review text: A method is presented for matrix multiplication on hypercubes, that uses only nearest neighbour communication and reduces the asymptotic communication cost.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4129887
zbMATH Keywords: communication overhead
zbMATH Keywords: block algorithms
zbMATH Keywords: matrix multiplication
zbMATH Keywords: hypercubes
zbMATH Keywords: nearest neighbour communication
zbMATH Keywords: asymptotic communication cost
reviewed by: Volker Mehrmann
MaRDI profile type: Publication
full work available at URL: 0167-8191(89)90091-4
OpenAlex ID: W2036678384
Recommended article: Communication-efficient matrix multiplication on hypercubes
Recommended article: Communication lower bounds for distributed-memory matrix multiplication
Recommended article: Communication and matrix computations on large message passing systems
Recommended article: A method for exploiting communication/computation overlap in hypercubes
Recommended article: Graph expansion and communication costs of fast matrix multiplication
Recommended article: Matrix and vector operations on hypercube parallel processors
Recommended article: Communication balancing in parallel sparse matrix-vector multiplication
description: scientific article; zbMATH DE number 4129887