摘要
在De Bruijn网络中进行并行矩阵乘法运算,算法简单,容易实现。首先介绍了De Bruijn网络结构,然后提出了一种基于De Bruijn网络结构的矩阵乘法的并行算法,分析了它的加速比、效率等性能及可扩展性,通过与Cannon算法的比较,证明它的时间复杂度等效于Cannon算法,最后通过实验验证了这个结论的正确性。
It is necessary to develop parallel matrix multiplication because of serial matrix multiplication costing much memory and time.Many different parallel matrix multiplications have been developed according to different network topologies.De Bruijn network is one of the most attractive network models,which has good parallel computing performance.It is simple to execute parallel matrix multiplication on De Bruijn network and easy to implement.In this paper,De Bruijn network was introduced,and then a parallel al...
出处
《计算机应用》
CSCD
北大核心
2009年第3期880-883,887,共5页
journal of Computer Applications
基金
国家自然科学基金资助项目(60763013)
广东省科技计划项目(2006B15401002)
