Parallel algorithms and architectures for matrix multiplication
type: Item
instance of: scholarly article
title: Parallel algorithms and architectures for matrix multiplication
zbMATH Open document ID: 0684.65043
DOI: 10.1016/0898-1221(89)90056-4
author: C. Puglisi
publication date: 1989-01-01T00:00:00Z
review text: Theoretical investigation of matrix multiplication for square matrices on message passing systems, namely a linear array, a binary tree and a mesh of trees, taking into account communication time. Timing formulas are presented. The important question of processor efficiency is not discussed.
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4121308
zbMATH Keywords: parallel computation
zbMATH Keywords: matrix multiplication
zbMATH Keywords: message passing systems
zbMATH Keywords: linear array
zbMATH Keywords: binary tree
zbMATH Keywords: mesh of trees
zbMATH Keywords: Timing formulas
MaRDI profile type: Publication
full work available at URL: 0898-1221(89)90056-4
OpenAlex ID: W2093034800
cites work: Some Complexity Results for Matrix Computations on Parallel Processors
cites work: Mapping Homogeneous Graphs on Linear Arrays
cites work: Modular Matrix Multiplication on a Linear Array
cites work: Matrix-vector multiplication: Parallel algorithms and architectures
cites work: Fast Parallel Matrix Inversion Algorithms
cites work: Q3687714
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4121308