Abstract: Distance matrices are used for measuring the distance between two matrices. Using Distance matrices we can generate a Latin square which is also called as Sudoku code. Latin squares have a variety of different practical applications, for example they can be used to code messages, design tournaments or generate magic squares. The theory of Latin squares is very important tool in design theory. Like much of design theory, Latin squares have various applications in statistics, finite geometries and experimental design, to name a few. In this paper, attempt is made proposed an efficient parallel algorithm for Latin square design which have desirable properties for parallel array access. These squares provide conflict free access to various subsets of an n x n array using n memory modules. A transversal of such a square is a set of n entries such that no two entries share the same row, column or symbol. It will present a general construction method for building parallel Latin square of order n 2for all n. The proposed algorithm presents a quick method to produce a Latin square design. The simulation results of the proposed algorithm for Latin square design were compared with the traditional sequential algorithm Latin square design in terms of speedup and efficiency. The results of Latin Square design were very promising and showed a potential that this design could successfully be applied to the routing problems for conflict free data access.
Keywords: Efficiency, Time to execute, Cost, Latin square, Permutation.
Copyright Form