首页 | 本学科首页   官方微博 | 高级检索  
     检索      

机群系统中矩阵的并行QR分解算法
引用本文:陈一鸣,杨爱民,肖晓丹,陈杰,李霞,孙红霞.机群系统中矩阵的并行QR分解算法[J].燕山大学学报,2007,31(3):225-228.
作者姓名:陈一鸣  杨爱民  肖晓丹  陈杰  李霞  孙红霞
作者单位:燕山大学,理学院,河北,秦皇岛,066004
摘    要:随着高速网络技术的快速发展,机群系统已经成为并行计算的主要平台,由于它的高通信延迟,某些在并行机上实现的细粒度并行算法己不适合在该环境下运行,为此有必要研究它们在机群系统中的并行实现。基于这一点,本文对矩阵的QR分解提出了一种新的任务划分策略,并由此得到了它的一种粗粒度并行算法。实验结果表明,设计的并行算法在机群系统中具有较高的加速比。

关 键 词:机群  QR分解  并行算法  加速比
文章编号:1007-791X(2007)03-0225-04
修稿时间:2007-01-03

Parallel algorithm of QR decomposition of matrix in cluster system
CHEN Yi-ming,YANG Ai-min,XIAO Xiao-dan,CHEN Jie,LI Xia,SUN Hong-xia.Parallel algorithm of QR decomposition of matrix in cluster system[J].Journal of Yanshan University,2007,31(3):225-228.
Authors:CHEN Yi-ming  YANG Ai-min  XIAO Xiao-dan  CHEN Jie  LI Xia  SUN Hong-xia
Institution:1. College of Sciences, Yanshan University, Qinghuangdao, Hebei 066004, China
Abstract: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.
Keywords:cluster  QR decomposition  parallel algorithm  speedup ratio
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号