Conflict-free access to parallel memories

Charles J. Colbourn, Katherine Heinrich

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


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 languageEnglish (US)
Pages (from-to)193-200
Number of pages8
JournalJournal of Parallel and Distributed Computing
Issue number2
StatePublished - Feb 1992
Externally publishedYes

ASJC Scopus subject areas

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


Dive into the research topics of 'Conflict-free access to parallel memories'. Together they form a unique fingerprint.

Cite this