Conflict-free access to parallel memories

Charles J. Colbourn; Katherine Heinrich

doi:10.1016/0743-7315(92)90116-5

Conflict-free access to parallel memories

Charles J. Colbourn, Katherine Heinrich

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

17 Scopus citations

Abstract

Conflict-free access to subsets of array elements is essential for the effective utilization of parallel memories. Skewing schemes for array storage that provide conflict-free access to all entries in r × s and s × r subarrays are developed, using a strong connection between conflict-free skewing schemes and latin squares.

Original language	English (US)
Pages (from-to)	193-200
Number of pages	8
Journal	Journal of Parallel and Distributed Computing
Volume	14
Issue number	2
DOIs	https://doi.org/10.1016/0743-7315(92)90116-5
State	Published - Feb 1992
Externally published	Yes

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/0743-7315(92)90116-5

Cite this

@article{7b88c20a4a754f9c84761aa55d1a26c4,

title = "Conflict-free access to parallel memories",

abstract = "Conflict-free access to subsets of array elements is essential for the effective utilization of parallel memories. Skewing schemes for array storage that provide conflict-free access to all entries in r × s and s × r subarrays are developed, using a strong connection between conflict-free skewing schemes and latin squares.",

author = "Colbourn, {Charles J.} and Katherine Heinrich",

note = "Funding Information: Research of the authors is supported by NSERC Canada under Grants A0579 (C.C.) and A7829 (K.H.). This research was begun while the first author was a Research Fellow in the Centre for Systems Science, Simon Fraser University; thanks are extended to Nick Cercone. Pavol Hell. and other members of CSS for making the visit possible.",

year = "1992",

month = feb,

doi = "10.1016/0743-7315(92)90116-5",

language = "English (US)",

volume = "14",

pages = "193--200",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Conflict-free access to parallel memories

AU - Colbourn, Charles J.

AU - Heinrich, Katherine

N1 - Funding Information: Research of the authors is supported by NSERC Canada under Grants A0579 (C.C.) and A7829 (K.H.). This research was begun while the first author was a Research Fellow in the Centre for Systems Science, Simon Fraser University; thanks are extended to Nick Cercone. Pavol Hell. and other members of CSS for making the visit possible.

PY - 1992/2

Y1 - 1992/2

N2 - Conflict-free access to subsets of array elements is essential for the effective utilization of parallel memories. Skewing schemes for array storage that provide conflict-free access to all entries in r × s and s × r subarrays are developed, using a strong connection between conflict-free skewing schemes and latin squares.

AB - Conflict-free access to subsets of array elements is essential for the effective utilization of parallel memories. Skewing schemes for array storage that provide conflict-free access to all entries in r × s and s × r subarrays are developed, using a strong connection between conflict-free skewing schemes and latin squares.

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

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

U2 - 10.1016/0743-7315(92)90116-5

DO - 10.1016/0743-7315(92)90116-5

M3 - Article

AN - SCOPUS:0026819609

SN - 0743-7315

VL - 14

SP - 193

EP - 200

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 2

ER -

Conflict-free access to parallel memories

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this