Perfect Latin Squares

Abstract We introduce new latin squares called perfect latin squares which have desirable properties for parallel array access. These squares provide conflict free access to various subsets of an n2×n2 array using n2 memory modules. We present a general construction method for building perfect latin squares of order n2 for all n. Some useful properties of the latin squares built by our construction method for parallel array access are also identified.

[1]  Paul Budnik,et al.  The Organization and Use of Parallel Memories , 1971, IEEE Transactions on Computers.

[2]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[3]  V. K. Prasanna-Kumar,et al.  Perfect Latin squares and parallel array access , 1989, ISCA '89.

[4]  Ervin Gergely,et al.  A Simple Method for Constructing Doubly Diagonalized Latin Squares , 1974, J. Comb. Theory, Ser. A.

[5]  Cauligi S. Raghavendra,et al.  On Array Storage for Conflict-Free Memory Access for Parallel Processors , 1988, International Conference on Parallel Processing.