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 n 2× n 2 array using n 2 memory modules. We present a general construction method for building perfect latin squares of order n 2 for all n. Some useful properties of the latin squares built by our construction method for parallel array access are also identified.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
