一种六边形循环分块的Jacobi计算优化方法  

Hexagonal Loop Tiling for Jacobi Computation Optimization Method

作　　者：屈彬 刘松[1] 张增源 马洁 伍卫国[1] QU Bin;LIU Song;ZHANG Zeng-Yuan;MA Jie;WU Wei-Guo(School of Computer Science and Technology,Xi’an Jiaotong University,Xi’an 710049,China)

机构地区：[1]西安交通大学计算机科学与技术学院,陕西西安710049

出　　处：《软件学报》2024年第8期3721-3738,共18页Journal of Software

基　　金：国家自然科学基金(62002279);陕西省自然科学基础研究计划一般项目(青年)(2020JQ-077)。

摘　　要：Jacobi计算是一种模板计算,在科学计算领域具有广泛的应用.围绕Jacobi计算的性能优化是一个经典的课题,其中循环分块是一种较有效的优化方法.现有的循环分块主要关注分块对并行通信和程序局部性的影响,缺少对负载均衡和向量化等其他因素的考虑.面向多核计算架构,分析比较不同分块方法,并选择一种先进的六边形分块作为加速Jacobi计算的主要方法.在分块大小选择上,综合考虑分块对程序向量化效率、局部性和计算核负载均衡等多方面的影响,提出一种六边形分块大小选择算法Hexagon_TSS.实验结果表明所提算法相对于原始串行程序计算方法,最好情况可将L1数据缓存失效率降低至其5.46%,最大加速比可达24.48,并且具有良好的可扩展性.Jacobi computation is a kind of stencil computation,which has been widely applied in the field of scientific computing.The performance optimization of Jacobi computation is a classic topic,where loop tiling is an effective optimization method.The existing loop tiling methods mainly focus on the impact of tiling on parallel communication and program locality and fail to consider other factors such as load balancing and vectorization.This study analyzes and compares several tiling methods based on multi-core computing architecture and chooses an advanced hexagonal tiling as the main method to accelerate Jacobi computation.For tile size selection,this study proposes a hexagonal tile size selection algorithm called Hexagon_TSS by comprehensively considering the impact of tiling on load balancing,vectorization efficiency,and locality.The experimental results show that the L1 data cache miss rate can be reduced to 5.46%of original serial program computation in the best case by Hexagon_TSS,and the maximum speedup reaches 24.48.The proposed method also has excellent scalability.

关 键 词：Jacobi计算 六边形分块方法 分块大小选择 性能优化 多核架构 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]