ISCAS OpenIR  > 并行软件与计算科学实验室 
RAM(h)模型下SpMV存储访问复杂度的分析
Alternative Titlememory access complexity analysis of spmv in ram(h)model
袁娥; 张云泉; 孙相征
2009
Source计算机工程与设计
ISSN1000-7024
Volume30Issue:3Pages:613-618
English Abstract稀疏矩阵向量乘(SpMV)采取压缩行存储格式的算法性能非常差,而寄存器分块算法可以使得数据尽量在靠近处理器的存储层次中访问而提高性能.利用RAM(h)模型进行分析和比较不同算法形式的存储访问复杂度,可以比较两种算法的优劣.通过RAM(h)分析SpMV两种实现形式的存储访问复杂度,同时在奔腾四平台上,测试了7个稀疏矩阵的SpMV性能,并统计了这两种算法中L1,L2,和TLB的缺失率,实验结果与模型分析的数据一致.
Indexed Typewanfang,cscd
KeywordSpmv 稀疏矩阵向量乘 Ram(h)模型 存储访问复杂度 Spmv Spmv Sparse Matrix-vector Multiplication Ram (h) Model Memory Access Complexity
Department并行计算实验室
Language中文
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/4306
Collection并行软件与计算科学实验室 
Recommended Citation
GB/T 7714
袁娥,张云泉,孙相征. RAM(h)模型下SpMV存储访问复杂度的分析[J]. 计算机工程与设计,2009,30(3):613-618.
APA 袁娥,张云泉,&孙相征.(2009).RAM(h)模型下SpMV存储访问复杂度的分析.计算机工程与设计,30(3),613-618.
MLA 袁娥,et al."RAM(h)模型下SpMV存储访问复杂度的分析".计算机工程与设计 30.3(2009):613-618.
Files in This Item:
File Name/Size DocType Version Access License
15.pdf(515KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[袁娥]'s Articles
[张云泉]'s Articles
[孙相征]'s Articles
Baidu academic
Similar articles in Baidu academic
[袁娥]'s Articles
[张云泉]'s Articles
[孙相征]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[袁娥]'s Articles
[张云泉]'s Articles
[孙相征]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.