THE PARALLEL ALGORITHM OF MATRIX QR DECOMPOSITION ON NETWORK OF WORKSTATIONS
Sun Shi-xin · Jisuanji gongcheng · 2000
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.