Issue No. 05 - May (1978 vol. 27)
H.D. Shapiro , Sperry Research Center
The effective utilization of single-instruction-multiple-data stream machines depends heavily on being able to arrange the data elements of arrays in parallel memory modules so that memory conflicts are avoided when the data are fetched. Several classes of storage algorithms are presented. Necessary and sufficient conditions are derived which can be used to determine if all conflict can be avoided. For the matrix subparts most often demanded in numerical analysis computations, whenever the class of storage algorithms called periodic skewing schemes provides conflict-free access, the subclass called linear skewing schemes also provides such access.
skewing schemes, Array processors, memory-processor connection networks, parallel memories, SIMD machines
H. Shapiro, "Theoretical Limitations on the Efficient Use of Parallel Memories," in IEEE Transactions on Computers, vol. 27, no. , pp. 421-428, 1978.