Communication balancing in parallel sparse matrix-vector multiplication
type: Item
instance of: scholarly article
title: Communication balancing in parallel sparse matrix-vector multiplication
zbMATH Open document ID: 1121.65318
author: R. H. Bisseling
author: Wouter Meesen
publication date: 2007-03-16T00:00:00Z
full work available at URL: https://eudml.org/doc/128024
full work available at URL: pp47-65.html
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 5134425
zbMATH Keywords: vector partitioning
zbMATH Keywords: parallel computing
zbMATH Keywords: sparse matrix
zbMATH Keywords: bulk synchronous parallel
zbMATH Keywords: NP-complete
describes a project that uses: Zoltan
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
Recommended article: COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
Recommended article: Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
Recommended article: Q3802488
Recommended article: Communications oriented programming of parallel iterative solutions of sparse linear systems
Recommended article: Modelling and analysis of communication overhead for parallel matrix algorithms
Recommended article: Communication efficient matrix multiplication on hypercubes
Recommended article: Communication-efficient matrix multiplication on hypercubes
Recommended article: Towards a fast parallel sparse symmetric matrix-vector multiplication
published in: ETNA - Electronic Transactions on Numerical Analysis
description: scientific article; zbMATH DE number 5134425