SELF-ROUTING ALGORITHMS FOR STRONGLY REGULAR MULTISTAGE INTERCONNECTION NETWORKS

被引：4

作者：

SENGUPTA, A ^{[1
]}

ZEMOUDEH, K ^{[1
]}

BANDYOPADHYAY, S ^{[1
]}

机构：

[1] UNIV WINDSOR,DEPT COMP SCI,WINDSOR N9B 3P4,ONTARIO,CANADA

来源：

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

关键词：

D O I：

10.1016/0743-7315(92)90115-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents a self-routing algorithm for a class of permutations that can be represented as linear transportations and complementations. This class includes bit-permute-complement (BPC) [6] and several of other frequently used permutations. The same problem for a Benes̃ or a shuffle-exchange network was considered earlier by Boppana and Raghavendra. This paper considers a more general problem by considering a broader class of multistage interconnection networks that includes these networks along with variety of others. For this class of interconnection networks, Nassimi presented a routing algorithm for BPC class. In effect, this paper considers the problem of routing a larger class of permutations than that considered by Nassimi for a broader class of networks than that considered by Boppana and Raghavendra. © 1992.

引用

页码：187 / 192

页数：6