Geodesic
Lower bounds for sparse matrix vector multiplication on hypercubic networks
Discrete mathematics & theoretical computer science, Tome 2 (1998).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_1998_2_a2,
     author = {Manzini, Giovanni},
     title = {Lower bounds for sparse matrix vector multiplication on hypercubic networks},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {2},
     year = {1998},
     doi = {10.46298/dmtcs.249},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.249/}
}
TY  - JOUR
AU  - Manzini, Giovanni
TI  - Lower bounds for sparse matrix vector multiplication on hypercubic networks
JO  - Discrete mathematics & theoretical computer science
PY  - 1998
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.249/
DO  - 10.46298/dmtcs.249
LA  - en
ID  - DMTCS_1998_2_a2
ER  - 
%0 Journal Article
%A Manzini, Giovanni
%T Lower bounds for sparse matrix vector multiplication on hypercubic networks
%J Discrete mathematics & theoretical computer science
%D 1998
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.249/
%R 10.46298/dmtcs.249
%G en
%F DMTCS_1998_2_a2
Manzini, Giovanni. Lower bounds for sparse matrix vector multiplication on hypercubic networks. Discrete mathematics & theoretical computer science, Tome 2 (1998). doi : 10.46298/dmtcs.249. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.249/

Cité par Sources :