并行存储器无冲突访问探讨

Non-Conflict Access of Parallel Storage

在并行存储中,访问的冲突是存储系统性能提升的瓶颈。对于任意一个整数n,n阶(n×n)的二维数组(矩阵),能不能用n个存储体实现无冲突存储?本文对二维数组进行了探讨,分析了两种可行性较大的存储方案,并对其中第二种方案进行了程序举例,最后对两种方案进行了进一步分析和比较。

Access Conflict of Parallel storage is the restrict of performance improvement. This paper discusses matrix and analyzes two useful methods of storing n × n matrix in n banks memory without access conflict, gives a c＋＋ source file for calculating the address and compare the two methods at last.