THE RESEARCH AND APPLICATION OF THE PARALLEL ALGORITHMFOR QR DECOMPOSITION OF MATRIX
With the ra pid development of high-speed network technology, the cluster systems have been the main platform of parallel algorithm. Because of their high communication delay, some parallel algorithms of fine grain are not fit for running 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 the coarse grain parallel algorithm is obtained. In the process of designing these parallel methods, the separately principle was based on, the original matrixes were divided into some blocks,then each block was distributed into various node machines,which run the submission in dependently. It was a much better proposal to the cluster system, which had no more nodes. At last, a simulation was given. The solution obtained shows that the designing parallel algorithm has much higher speedup in the cluster system.
Cluster System QR Decomposition Parallel Algorithm Speedup efficiency
Aimin Yang Chunfeng Liu Xinghua Ma Nan Ji Min An
College of Science, Hebei Polytechnic University, Tangshan, Hebei Province, 063000 China College of Science, Hebei Polytechnic University, Tangshan, Hebei Province, 063000 China;Hebei Unive
国际会议
杭州
英文
29-31
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）