摘要
提出基于光交换互连系统(OTIS)网络结构的矩阵乘并行算法,分析它的时间复杂性.采用一种新映射策略来处理一般OTIS网络结构上的矩阵映射,即矩阵映射策略是根据基图中的哈密尔顿路径来分配处理器的.通过OTIS网络的拓扑结构模拟实验,结果表明,OTIS网络矩阵乘算法的性能优于Cannon算法,更加优于O(n3)串行矩阵乘算法.
A parallel algorithm for matrix multiplication based on optical transpose interconnection system （OTIS） network is proposed, and the time complexity is analyzed. A new mapping scheme is used to map matrix to the general OTIS network, that is the matrix mapping scheme, processors are assigned according to Hamiltonian path in the basic graph of OTIS network. A simulation experiment about the topology of OTIS network is done, and the result shows that the algorithm for matrix multiplication on OTIS network is better than Cannon and the O（n3 ） serial algorithm.
出处
《华侨大学学报（自然科学版）》
CAS
北大核心
2008年第3期357-359,共3页
Journal of Huaqiao University(Natural Science)
基金
广东省自然科学基金资助项目(05011896)
广东省教育厅自然科学基金资助项目(Z03080)
关键词
矩阵乘法
并行算法
光交换互连系统
映射策略
拓扑结构
matrix multiplication
parallel algorithm
optical transpose interconnection system
mapping scheme
topology
