Perfect latin squares

Katherine Heinrich; Kichul Kim; V. K.Prasanna Kumar

doi:10.1016/0166-218X(92)90139-2

Perfect latin squares

Katherine Heinrich, Kichul Kim, V. K.Prasanna Kumar

School of Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

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²×n² array using n² memory modules. We 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 our construction method for parallel array access are also identified.

Original language	English
Pages (from-to)	281-286
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	37-38
Issue number	C
DOIs	https://doi.org/10.1016/0166-218X(92)90139-2
State	Published - 15 Jul 1992

Access to Document

10.1016/0166-218X(92)90139-2

Cite this

@article{72bc6adb8d0a49f18044b45b12d24d2d,

title = "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.",

author = "Katherine Heinrich and Kichul Kim and Kumar, {V. K.Prasanna}",

year = "1992",

month = jul,

day = "15",

doi = "10.1016/0166-218X(92)90139-2",

language = "English",

volume = "37-38",

pages = "281--286",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "C",

}

TY - JOUR

T1 - Perfect latin squares

AU - Heinrich, Katherine

AU - Kim, Kichul

AU - Kumar, V. K.Prasanna

PY - 1992/7/15

Y1 - 1992/7/15

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0041011195&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(92)90139-2

DO - 10.1016/0166-218X(92)90139-2

M3 - Article

AN - SCOPUS:0041011195

SN - 0166-218X

VL - 37-38

SP - 281

EP - 286

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - C

ER -

Perfect latin squares

Abstract

Access to Document

Other files and links

Fingerprint

Cite this