摘要
描述了DNS、Cannon、Fox、Systolic矩阵乘并行算法的原理,并对其时间复杂度进行了理论分析。通过对并行算法的各项性能参数的对比分析,得到的结论是DNS算法的时间复杂度最好,但加速比、效率和成本不是最优的。Cannon算法和Fox算法的算法思想类似,但是Cannon算法比Fox算法在数据播送上的花费少,因此整体性能较好。Systolic算法是基于流水线技术的并行矩阵乘算法,有较好的综合性能。
Description of the DNS, Cannon, Fox, Systolic parallel algorithm for matrix multiplication principle, and its time complexity is analyzed. The parallel algorithm of the performance parameters of the comparative analysis, the conclusion is that DNS algorithm time complexity is best, but accelerated ratio, efficiency and cost is not the best. Cannon algorithm and Fox algorithm idea is similar to, but Cannon al- gorithm than the Fox algorithm in data broadcast on cost less, so the overall performance is better. The al- gorithm Systolic based on Pipelining parallel algorithms for matrix multiplication, the better comprehen- sive properties.
出处
《新疆师范大学学报（自然科学版）》
2012年第3期5-10,共6页
Journal of Xinjiang Normal University(Natural Sciences Edition)
关键词
矩阵乘并行算法
时间复杂度
性能分析
Matrix multiplication parallel algorithm
Time complexity
Performance analysis
