.png){kind=icon}
.png){kind=icon}
Return
Parallelization techniques for sparse matrix applications
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1996.0146.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse matrix problems are difficult to parallelize efficiently on distributed memory machines since data is often accessed indirectly. Inspector-executor strategies, which are typically used to parallelize loops with indirect references, incur substantial runtime preprocessing overheads when references with multiple levels of indirection are encountered-a frequent occurrence in sparse matrix algorithms. The sparse-array rolling (SAR) technique, introduced in [M. Ujaldon and E. L. Zapata, Proc. 9th ACM Int'l. Conf. on Supercomputing, Barcelona, July 1995, pp. 117-126], significantly reduces these preprocessing overheads. This paper outlines the SAR approach and describes its runtime support accompanied by a detailed performance evaluation. The results demonstrate that SAR yields significant reduction in preprocessing overheads compared to standard inspector-executor techniques. (C) 1996 Academic Press, Inc.
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
No organization information available