REARRANGEABLE CIRCUIT-SWITCHED HYPERCUBE ARCHITECTURES FOR ROUTING PERMUTATIONS

被引：23

作者：

CHOI, SB ^{[1
]}

SOMANI, AK ^{[1
]}

机构：

[1] UNIV WASHINGTON,DEPT COMP SCI & ENGN,SEATTLE,WA 98195

来源：

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | 1993年 / 19卷 / 02期

关键词：

D O I：

10.1006/jpdc.1993.1097

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Rearrangeable hypercube architectures and routing algorithms are developed to realize arbitrary permutations in circuit switching. We prove that if each connection between two neighboring nodes consists of two pairs of links (two full-duplex communication lines), the hypercube can handle two arbitrary permutations simultaneously. We also prove that a hypercube is rearrangeable if one additional pair of links is provided in any one dimension of connections. © 1993 Academic Press, Inc.

引用

页码：125 / 130

页数：6

共 8 条

[1]

BENES VE, 1965, MATH THEORY CONNECTI

[2]

CHOI SB, 1991, IN PRESS NETWORKS

[3]

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

[4]

LEE KY, 1985, IEEE T COMPUT, V34, P412, DOI 10.1109/TC.1985.1676581

[5]

NASSIMI D, 1982, IEEE T COMPUT, V31, P148

[6] TOPOLOGICAL PROPERTIES OF HYPERCUBES [J].

SAAD, Y ;

SCHULTZ, MH .

IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (07) :867-872

[7]

SZYMANSKI T, 1989, 1989 P INT C PAR PRO, V1, P103

[8] A PERMUTATION NETWORK [J].

WAKSMAN, A .

JOURNAL OF THE ACM, 1968, 15 (01) :159-&

← 1 →