• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (9): 64-70.

• 论文 • 上一篇    下一篇

面向稀疏矩阵访存特性的Cache划分

邓林,窦勇,郑义   

  1. (国防科学技术大学计算机学院,湖南 长沙,410073)
  • 收稿日期:2010-07-05 修回日期:2010-11-13 出版日期:2012-09-25 发布日期:2012-09-25
  • 基金资助:

    国家自然科学基金资助项目(60833004,60633050);国家863计划资助项目(2008AA01A201)

Memory Access Behavior CharacteristicsOriented Cache Partition for SPMV

DENG Lin,DOU Yong,ZHENG Yi   

  1. (School of Computer Science,National University of Defense Technology,Changsha 410073,China)
  • Received:2010-07-05 Revised:2010-11-13 Online:2012-09-25 Published:2012-09-25

摘要:

稀疏矩阵向量乘是许多科学计算的核心,计算中大量的间接和随机访存成为计算的主要瓶颈。本文通过分析稀疏矩阵向量乘运算的数据结构和计算过程,得到计算中不同数据的访存特征,并提出了一种面向数据访存特性的Cache划分方法。对12个稀疏矩阵向量乘的测试表明,本文的Cache划分方法能有效地提高可重用向量的Cache命中率,同时减少计算对Cache空间的需求。

关键词: 稀疏矩阵, 向量乘, Cache划分, 访存特性

Abstract:

The sparse matrix vector multiplication (SPMV) is the kernel of many scientific applications.Due to its indirect and random memory accesses,the SPMV is the bottleneck of scientific applications.In this paper,based on analyzing data structure and computation process,we present the memory access characteristics of the SPMV and propose a memory access behavior characteristicsorient cache partition method.According to the performance evaluation with 12 sparse matrix vector multiplications,the proposed cache partition method increase the hit ratio of reusable data and reduce the cache capacity request efficiently during the SPMV.

Key words: sparse matrix;vector multiplication;cache partition;memory access behavior character