多核平台SpMV计算的最优线程数预测

Yunlan Wang, Yan Zhang, Tianhai Zhao, Jianhua Gu, Lu Li, Wei Jian
{"title":"多核平台SpMV计算的最优线程数预测","authors":"Yunlan Wang, Yan Zhang, Tianhai Zhao, Jianhua Gu, Lu Li, Wei Jian","doi":"10.1109/ISKE.2015.15","DOIUrl":null,"url":null,"abstract":"Sparse matrix-vector multiplication (SpMV) is a memory intensive kernel, executing with different thread quantity is very different in performance. In this paper, we present a new method based on knowledge discovery technology to give the optimal thread quantity to improve SpMV performance and reduce execution time. Considering the feature of sparse matrix, which affecting the efficiency of SpMV, we cluster sample matrices by hierarchical clustering algorithm. Record the attributes values of the matrix that has large arithmetic intensity with different thread quantity in each cluster. Then predict thread quantity by comparing similarity between the test and record matrices. We test 10 sparse matrices on the Xeon E5-2670 multi-core platform. The experimental results show that the thread quantities predicted by this method agree with the practical result, and the accuracy of prediction reaches 90%. The method we proposed can estimate the optimal thread quantity accurately that can improve SpMV efficiency and reduce the computation time effectively.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Predicting Optimal Thread Quantity for SpMV Computation on Multi-core Platform\",\"authors\":\"Yunlan Wang, Yan Zhang, Tianhai Zhao, Jianhua Gu, Lu Li, Wei Jian\",\"doi\":\"10.1109/ISKE.2015.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sparse matrix-vector multiplication (SpMV) is a memory intensive kernel, executing with different thread quantity is very different in performance. In this paper, we present a new method based on knowledge discovery technology to give the optimal thread quantity to improve SpMV performance and reduce execution time. Considering the feature of sparse matrix, which affecting the efficiency of SpMV, we cluster sample matrices by hierarchical clustering algorithm. Record the attributes values of the matrix that has large arithmetic intensity with different thread quantity in each cluster. Then predict thread quantity by comparing similarity between the test and record matrices. We test 10 sparse matrices on the Xeon E5-2670 multi-core platform. The experimental results show that the thread quantities predicted by this method agree with the practical result, and the accuracy of prediction reaches 90%. The method we proposed can estimate the optimal thread quantity accurately that can improve SpMV efficiency and reduce the computation time effectively.\",\"PeriodicalId\":312629,\"journal\":{\"name\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2015.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

稀疏矩阵向量乘法(SpMV)是一种内存密集型内核,在不同的线程数下执行会产生很大的性能差异。本文提出了一种基于知识发现技术给出最优线程数量的方法,以提高SpMV的性能并减少执行时间。考虑到稀疏矩阵影响SpMV效率的特点,采用分层聚类算法对样本矩阵进行聚类。记录每个集群中不同线程数下算术强度较大的矩阵的属性值。然后通过比较测试矩阵和记录矩阵之间的相似性来预测线程数量。我们在Xeon E5-2670多核平台上测试了10个稀疏矩阵。实验结果表明,该方法预测的螺纹量与实际结果吻合较好,预测精度达到90%。该方法能够准确地估计出最优线程数量,有效地提高了SpMV效率,减少了计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Predicting Optimal Thread Quantity for SpMV Computation on Multi-core Platform
Sparse matrix-vector multiplication (SpMV) is a memory intensive kernel, executing with different thread quantity is very different in performance. In this paper, we present a new method based on knowledge discovery technology to give the optimal thread quantity to improve SpMV performance and reduce execution time. Considering the feature of sparse matrix, which affecting the efficiency of SpMV, we cluster sample matrices by hierarchical clustering algorithm. Record the attributes values of the matrix that has large arithmetic intensity with different thread quantity in each cluster. Then predict thread quantity by comparing similarity between the test and record matrices. We test 10 sparse matrices on the Xeon E5-2670 multi-core platform. The experimental results show that the thread quantities predicted by this method agree with the practical result, and the accuracy of prediction reaches 90%. The method we proposed can estimate the optimal thread quantity accurately that can improve SpMV efficiency and reduce the computation time effectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信