%0 Journal Article
%T A Kind of Multistage Interconnection Networks with Multiple Paths
%A Zhou Yingquan
%A Min Yinghua
%J 计算机科学技术学报
%D 1996
%I 
%X Mltistage Interconnection Networks(MINs)are orten used to provide interconnections in multiprocessor systems.A unique path MIN usually has lower hardware complexity and a simple control algorithm,but it lacks fault tolerance.This paper proposes a kind of multipat MINs,which are obtained by adding auxiliary links at the final stage in Quad Tree(QT) networks so that they can provide more paths between each source-destination pair,and presents their routing algorithm which is both destination tag based and adaptive.Starting with the routing tag for the minimum path between a given source-destination pair,the routing algorithm uses a set of rules to select switches and modify routing tag.In addition to trying the auxiliary link when link0 an link1 are unavilable,link1 will be tried when link0 ys unavailable.This feature distinguishing the proposed routing algorithm form that for QT networks makes better use of all the possible paths between the given source-destination pair.In the end,this paper introduces a performance index,which is called capacity,to compare different kinds of MINs .Comparison shows that the proposed MINs have better capacity than QT networks.
%K 通信网络
%K 多级互连网
%K 并行处理器
%K 分布处理器
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=16CBA246425ED72A718B5B1C4EA9DC0A&yid=8A15F8B0AA0E5323&vid=708DD6B15D2464E8&iid=E158A972A605785F&sid=396DD691E964F390&eid=B79ACB6EBBFC9730&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=0