网络并行计算中矩阵QR分解的并行算法  

THE PARALLEL ALGORITHM OF MATRIX QR DECOMPOSITION ON NETWORK OF WORKSTATIONS

作　　者：张艳[1] 孙世新[1] 

机构地区：[1]电子科技大学计算机学院,四川成都610054

出　　处：《计算机应用》2000年第10期29-32,共4页journal of Computer Applications

基　　金："九五"国防科技预研项目资助!(16 .1.4.1)

摘　　要：随着高速网络技术 (如ATM)的出现 ,网络并行计算系统 (NOW )已成为并行处理的主要平台 ,由于它的高通信延迟 ,某些在并行机上实现的细粒度并行算法已不适合在该环境下运行。为此 ,有必要对算法重新进行任务划分 ,研究它在网络环境中的并行实现。基于这一点 ,本文对矩阵的QR分解提出了一种新的任务划分策略 ,并由此得到了它的一种粗粒度并行算法。实验结果表明 ,设计的并行算法在网络并行计算环境中具有较高的加速比。With the advances in the high speed computers network technologies such as ATM, a network of workstations is becoming the main environment for parallel processing. Due to its high communication latency, some fine granularity algorithms that have been realized in parallel computers are not fit to NOW, so it is necessary to re partition the task and research its parallel implement on NOW. Based on this point, this paper proposes a new task partition scheme for matrix QR decomposition, and a new coarse granularity parallel algorithm is given. The experiment result show that the designed parallel algorithm has high speedup on NOW.

关 键 词：QR分解 并行算法 网络并行计算 矩阵 

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