一种Cholesky分解重叠算法  

A Cholesky Decomposition Overlapped Algorithm

作　　者：张德好[1] 刘青昆[1] 

机构地区：[1]辽宁师范大学计算机与信息技术学院,辽宁大连116086

出　　处：《计算机工程》2012年第18期262-264,共3页Computer Engineering

摘　　要：在图形处理单元(GPU)平台的计算中,GPU设备存储器和内存容量相差较大,待处理数据通常无法一次性从内存拷贝至显存中进行运算。为此,提出一种Cholesky分解重叠算法。采用预存取技术,拷贝数据和计算重叠,降低设备的等待时间,将设备存储器划分为2个缓冲区,轮流存放本次运算数据和下次待运算数据,在设备运算过程中完成设备存储器和内存之间的数据交换。实验结果表明,该算法可以有效提高运算效率。In the computation of Graphics Processing Unit（GPU） platform,GPU equipment storage and memory capacity is different.Processed data usually cannot finish operation from memory copy to the video memory in one-time.In order to solve this problem,this paper proposes a Cholesky decomposition overlapped algorithm.By dividing the device storage into two buffers,current data and next data for calculation are stored in turn,data swap between device storage and memory takes place in the process of computation.Experimental results show that the algorithm can increase the system efficiency.

关 键 词：图形处理单元 预存取 重叠算法 通用计算 CHOLESKY分解 集群系统 

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