面向非规则大数据分析应用的多核帮助线程预取方法  

Multi-core helper thread prefetching for irregular data intensive applications

作　　者：张建勋[1,2] 古志民[1] 胡潇涵[1] 蔡旻[1] 

机构地区：[1]北京理工大学计算机学院,北京100081 [2]天津中医药大学网络中心,天津300193

出　　处：《通信学报》2014年第8期137-146,共10页Journal on Communications

基　　金：国家自然科学基金资助项目(61070029;61370062)~~

摘　　要：大数据分析应用往往采用基于大型稀疏图的遍历算法,其主要特点是非规则数据密集访存。以频繁使用的具有大型稀疏图遍历特征的介度中心算法为例,提出一种基于帮助线程的多参数预取控制模型和参数优化方法,从而达到提高非规则数据密集程序性能的目的。在商用多核平台Q6600和I7上运用该方法后,介度中心算法在不同规模输入下平均性能加速比分别为1.20和1.11。实验结果表明,帮助线程预取能够有效提升该类非规则应用程序的性能。Big data analysis applications often use sparse graph traversal algorithm which characterized by irregular data intensive memory access. For improving performance of memory access in sparse graph traversal algorithm, helper thread prefetching could convert discontinuous locality into continuous-instant spatial-temporal locality effectively by using the shared last level cache of chip multi-processor platforms. Betweenness centrality algorithm was used as a case study, the multi-parameter prefetching model of helper thread and optimized instances were presented and evaluated on commercial CMP platforms Q6600 and 17, the average speedup of betweenness centrality algorithm at different input scale is 1.20 and 1.11 respectively. The experiment results show that helper thread prefetching can improve the performance of irregular applications effectively.

关 键 词：帮助线程预取 非规则数据密集应用 介度中心性 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]