摘要
提出了计算一类连续运算的一种更有效的并行算法 ,当N足够大时 ,其加速Sp≈p/ 2 ,效率Ep≈ 1/ 2 .在此基础上建立了求解一阶线性递归方程组的一种新算法 ,其加速Sp≈ 2 p/ 5 ,效率Ep≈ 2 / 5 ,其中
a more efficient parallel algorithm for calculating a class of consecutive operations is proposed. When N is big enough, this algorithm achieves a speedup of S p≈p/2 , with efficiency E p≈1/2 . On the basis of the algorithm, a new algorithm for solving the 1 th order linear recurrence system of equations is presented, achieving a speedup of S p≈2p/5 with efficiency E p≈2/5 , where p is the number of processors required.
出处
《华中理工大学学报》
CSCD
北大核心
2000年第5期41-42,46,共3页
Journal of Huazhong University of Science and Technology