Abstract

Latin Sqaure is extensively used in computer games, sudoku, steganography, cryptography, digital watermarks, graph analysis, error correcting codes; generate magic squares, statistics and mathematical field. The Sudoku puzzles are a special case of Latin squares. When we have to make the latin computation using the sequential algorithm then it waste more clock time. By using parallel programming (OpenCL) the time taken is reduced and throughput is increased. Traditionally Latin square methodology is based on heuristic cell based technique and generates random Latin square using genetic algorithmic approach both consumes high processing time and decreases the throughput. Here we are presenting the an algorithm by using parallel processing environment using OpenCL for computing latin square of order-3.

Authors and Affiliations