返回
Load-balanced sparse matrix-vector multiplication on parallel computers
DOI:10.1006/jpdc.1997.1361.png)
摘要
En 中文
We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors on parallel computers, We propose a method that combines fast load-balancing with efficient message-passing techniques to alleviate computational and inter-node communications challenges. The performance of the proposed method was evaluated on benchmark as well as on synthetically generated matrices and compared with the current work. It is shown that, by using our approach, a tangible improvement over prior work can be obtained, particularly for very sparse and skewed matrices, Moreover, it is also shown that I/O overhead for this problem can be efficiently amortized through I/O latency hiding and overall load-balancing. (C) 1997 Academic Press.
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Photosynthesis studies on European evergreen and deciduous oaks grown under Central European climate conditions: II. Photoinhibitory and light-independent violaxanthin deepoxidation and downregulation of photosystem II in evergreen, winter-acclimated European Quercus taxa
Trees
IF0
Surgical management of urachal tumors: Can the umbilicus be sparred in localized disease?
Rare Tumors
IF0
FIXATION OF PHOSPHATE BY IRON AND ALUMINUM AND REPLACEMENT BY ORGANIC AND INORGANIC IONS
Soil Science
IF0
没有更多内容

