Graphs on alphabets as models for large interconnection networks

The authors 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 n²×n² array using n² memory modules. The authors present a general construction method for building perfect Latin squares of order n² for all n. Some useful properties of the Latin squares built by the present construction method for parallel array access are also identified.