Lower bounds for sparse matrix vector multiplication on hypercubic networksReport as inadecuate




Lower bounds for sparse matrix vector multiplication on hypercubic networks - Download this document for free, or read online. Document in PDF available to download.

1 DISTA - Dipartimento di Scienze e Tecnologie Avanzate

Abstract : In this paper we consider the problem of computing on a local memory machine the product y = Ax,where A is a random n×n sparse matrix with Θ n nonzero elements. To study the average case communication cost of this problem, we introduce four different probability measures on the set of sparse matrices. We prove that on most local memory machines with p processors, this computation requires Ω n-p \log p time on the average. We prove that the same lower bound also holds, in the worst case, for matrices with only 2n or 3n nonzero elements.

Keywords : bisection width lower bounds Sparse matrices pseudo expanders hypercubic networks





Author: Giovanni Manzini -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents