并行处理中的矩阵复位的算法实现

在并行计算中,矩阵与矩阵相乘的Cache利用率最高,为了提高并行计算的速度,在进行向量与向量的运算时,可以先把向量补成矩阵,参加运算后,再把相应的部分分离出来.其中的关键问题是将原来的向量下标复位,以确保计算结果与原来的向量运算结果相同.;In the parallel computing,the cache using ratio(CUR) of the multiplying of matrixes is the highest.To increase the parallel computational speed,when multiplying vector and vector,the vector can be transferred to matrix dealing.And when finished,it is restored to the former.The most important process is to restore the matrix's subscript to guarantee that the correct result is restored