机群系统中矩阵的并行QR分解算法  

Parallel algorithm of QR decomposition of matrix in cluster system

作　　者：陈一鸣[1] 杨爱民[1] 肖晓丹[1] 陈杰[1] 李霞[1] 孙红霞[1] 

机构地区：[1]燕山大学理学院,河北秦皇岛066004

出　　处：《燕山大学学报》2007年第3期225-228,共4页Journal of Yanshan University

基　　金：河北省自然科学基金(No.E2007000381)

摘　　要：随着高速网络技术的快速发展,机群系统已经成为并行计算的主要平台,由于它的高通信延迟,某些在并行机上实现的细粒度并行算法已不适合在该环境下运行,为此有必要研究它们在机群系统中的并行实现。基于这一点,本文对矩阵的QR分解提出了一种新的任务划分策略,并由此得到了它的一种粗粒度并行算法。实验结果表明,设计的并行算法在机群系统中具有较高的加速比。With the rapid development of high-speed network technology, the cluster systems have been the main platform of parallel algorithm. Because their high communication delay, some parallel algorithms of fine grain are not fit to run in this environment. Therefore, it is necessary to study their parallel achievements in cluster systems. In terms of that, a new way for QR decomposition of matrix is proposed and coarse grain parallel algorithms is obtained in this paper. The example shows that the designing parallel algorithm has more higher speedup ratio in this cluster systerms.

关 键 词：机群 QR分解 并行算法 加速比 

分 类 号：O246[理学—计算数学]