The Parallel Algorithm of QR Decomposition of Matrix in Cluster System
Yang Ai-min · 2006
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,this paper proposes a new way for QR decomposition of matrix and obtains coarse grain parallel algorithms.The example shows that the designing parallel algorithm has higher speed in this cluster systerms.