CONFLICT-FREE ACCESS TO PARALLEL MEMORIES

被引：12

作者：

COLBOURN, CJ ^{[1
]}

HEINRICH, K ^{[1
]}

机构：

[1] SIMON FRASER UNIV,DEPT MATH & STAT,BURNABY V5A 1S6,BC,CANADA

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1992年 / 14卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1016/0743-7315(92)90116-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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. © 1992.

引用

页码：193 / 200

页数：8

共 19 条

[1]

BALAKRISHNAN M, 1988, 17TH P INT C PAR PRO, P103

[2] ORGANIZATION AND USE OF PARALLEL MEMORIES [J].

BUDNIK, P ;

KUCK, DJ .

IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (12) :1566-&

[3] TIME AND PARALLEL PROCESSOR BOUNDS FOR LINEAR RECURRENCE SYSTEMS [J].

CHEN, SC ;

KUCK, DJ .

IEEE TRANSACTIONS ON COMPUTERS, 1975, C 24 (07) :701-717

[4]

COLBOURN CJ, 1991, CONFLICT FREE ACCESS

[5] CONFLICT-FREE ACCESS OF ARRAYS - COUNTER EXAMPLE [J].

DEB, A .

INFORMATION PROCESSING LETTERS, 1980, 10 (01) :20-20

[6]

DENES J, ANN DISCRETE MATH, V46

[7] VECTOR ACCESS PERFORMANCE IN PARALLEL MEMORIES USING A SKEWED STORAGE SCHEME [J].

HARPER, DT ;

JUMP, JR .

IEEE TRANSACTIONS ON COMPUTERS, 1987, 36 (12) :1440-1449

[8]

HEINRICH K, 1990, PERFECT LATIN SQUARE

[9]

HOSSFELD F, 1983, INFORM SPEKTR, V6, P142

[10]

Kim K., 1989, 16th Annual International Symposium on Computer Architecture (Cat. No.89CH2705-2), P372

← 1 2 →