Hypercube matrix multiplication
type: Item
instance of: scholarly article
title: Hypercube matrix multiplication
zbMATH Open document ID: 0783.65041
DOI: 10.1016/0167-8191(93)90064-R
author: P. A. Nelson
published in: Parallel Computing
publication date: 1993-10-10T00:00:00Z
review text: A matrix multiplication algorithm for parallel computers (hypercubes) is given. The algorithm has running times of \(O(n)\) and \(O(\log n)\) for \(n^ 2\) and \(n^ 3/2\) processors. The sub matrices are sent in a single communication to directly connected processors in the hypercube and are also involved in sequential matrix multiplication at each processor. Experimental evidence is provided, showing that the proposed algorithm performs well on both \(iPSC/1\) and \(iPSC/2\) hypercubes.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 428567
zbMATH Keywords: performance
zbMATH Keywords: hypercubes
zbMATH Keywords: matrix multiplication algorithm
zbMATH Keywords: parallel computers
reviewed by: R. P. Tewarson
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 428567