SELF-ROUTING TECHNIQUE IN PERFECT-SHUFFLE NETWORKS USING CONTROL TAGS

被引：10

作者：

HUANG, ST ^{[1
]}

TRIPATHI, SK ^{[1
]}

机构：

[1] UNIV MARYLAND,DEPT COMP SCI,COLLEGE PK,MD 20742

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1988年 / 37卷 / 02期

关键词：

D O I：

10.1109/12.2159

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The authors generalize the self-routing technique using control tags on multiple-pass perfect-shuffle networks. In particular, they show that bit-permute-complement permutations can be realized and unscrambled in (2n-1) passes or less, where n equals log//2N, N being the number of terminals on either side. They also show that most of the frequently used permutations are in the intersection of omega-realizing and inverse-omega-realizing sets and can be realized and unscrambled in n passes.

引用

页码：251 / 256

页数：6

共 18 条

[1]

BENES VE, 1965, MATH THEORY CONNECTI

[2]

CANNON L, 1969, THESIS MONTANA STATE

[3]

DEKEL E, 1979, 17TH P ANN ALL C COM, P27

[4]

FLANDERS PM, 1982, IEEE T COMPUT, V31, P809, DOI 10.1109/TC.1982.1676096

[5]

Herstein I.N, 1964, TOPICS ALGEBRA

[6]

HUANG ST, 1986, IEEE T COMPUT, V35, P591, DOI 10.1109/TC.1986.1676800

[7]

HUANG ST, 1985, THESIS U MARYLAND

[8] ACCESS AND ALIGNMENT OF DATA IN AN ARRAY PROCESSOR [J].

LAWRIE, DH .

IEEE TRANSACTIONS ON COMPUTERS, 1975, 24 (12) :1145-1155

[9]

LENFANT J, 1978, IEEE T COMPUT, V27, P637, DOI 10.1109/TC.1978.1675164

[10] PERMUTING DATA WITH THE OMEGA-NETWORK [J].

LENFANT, J ;

TAHE, S .

ACTA INFORMATICA, 1985, 21 (06) :629-641

← 1 2 →