蜂窝网格的单播路由算法  

Unicast-routing Algorithms in Honeycomb Networks

作　　者：张伟文[1] 郭钢[2] 黄智[1] 

机构地区：[1]重庆大学机械工程学院,重庆400030 [2]重庆大学机械传动国家重点实验室,重庆400030

出　　处：《小型微型计算机系统》2011年第5期916-919,共4页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划项目(2007AA04Z1B1)资助;重庆市科技攻关计划项目(STC2008AB3014)资助

摘　　要：六角形蜂窝网格是一种具有良好网络拓扑性质的并行多处理机互连网络.蜂窝网格在某些特性上优于二维网格.不过,这种网络不存在单信道最短路径无死锁路由算法.文中针对该网络设计了两个部分自适应无死锁虫孔路由算法.一个是基于转弯模型单信道非最短路径路由算法,另一个则是采用了虚拟双信道的最短路径路由算法.对第二个算法,还进一步使用转弯模型对其改进.通过仿真实验,结果显示这两个路由算法都具有较好的性能.Honeycomb network is a newly introduced interconnection network for parallel computing.This network is like the 2D mesh,but some properties of honeycomb are better than those of 2D mesh.However,the honeycomb network does not have any single channel minimal wormhole-routing algorithms.Two wormhole-routing algorithms are designed for this network.One is a non-minimal routing algorithm which used the turn model;the other is a minimal routing algorithm which used the virtual channels technology.Both of them are adaptive and deadlock-free.The performances of these algorithms are also analyzed by simulations.

关 键 词：互连网络 虚信道 转弯模型 无死锁路由 虫孔 

分 类 号：TP338[自动化与计算机技术—计算机系统结构]