A parallel algorithm for matrix multiplication based on optical transpose interconnection system (OTIS) network is proposed, and the time complexity is analyzed.
提出基于光交换互连系统(otis)网络结构的矩阵乘并行算法，分析它的时间复杂性。
First summarizes the differences on principle between two kinds of parallel algorithm of matrix-vector multiplication, namely, divided by row and divided by column.
文中首先总结按行划分和按列划分的并行矩阵向量乘法在原理上的异同。
应用推荐