Issue No. 04 - April (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.219753
<p>A parallel memory system for efficient parallel array access using perfect latin squares asskewing functions is discussed. Simple construction methods for building perfect latinsquares are presented. The resulting skewing scheme provides conflict free access toseveral important subsets of an array. The address generation can be performed inconstant time with simple circuitry. The skewing scheme can provide constant timeaccess to rows, columns, diagonals, and N/sup 1/2/*N/sup 1/2/ subarrays of an N*Narray with maximum memory utilization. Self-routing Benes networks can be used torealize the permutations needed between the processing elements and the memorymodules. Two skewing schemes that provide conflict free access to three-dimensionalarrays are also discussed. Combined with self-routing Benes networks, these schemesprovide efficient access to frequently used subsets of three-dimensional arrays.</p>
Index Termsparallel array access; parallel memory system; perfect latin squares; skewing functions;conflict free access; skewing scheme; self-routing Benes networks; multiprocessorinterconnection networks; shared memory systems; storage management
K. Kim and V. Prasanna, "Latin Squares for Parallel Array Access," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 361-370, 1993.