一种基于虫洞交换的竞争预测路由算法  

AN ALGORITHM OF CONTENTION-FORESEE SELF-ADAPTIVE ROUTING BASED ON WORMHOLE SWITCHING

作　　者：周迎春[1] 饶永[2] 

机构地区：[1]湛江师范学院信息科学与技术学院,广东湛江524048 [2]常德烟草机械有限责任公司,湖南常德415000

出　　处：《计算机应用与软件》2009年第8期199-202,255,共5页Computer Applications and Software

摘　　要：分析了基于虫洞交换技术的片上互连网络路由算法存在的一些问题:固定维序路由当出现竞争时,只能等待,直到链路空闲方可继续前进。热土豆路由在路由器从不等待,任意选择一个空闲的端口进行发送,但却有活锁问题。利用相邻路由节点之间提供的竞争感知信号,提出了一种竞争预测的自适应路由算法,并利用SystemC片上互连网络仿真实现该算法。实验表明,该路由算法的网络传输延时在竞争多发的情况下明显优于热土豆算法与传统的固定维序算法。In this paper,we analyze some issues in the on-chip-network routing algorithm based on wormhole switching. The dimension-ordered can＇t move until the link is free when contentions occur. Hot-potato router can arbitrarily choose one free output port without waiting, but it has the problem of livelock. Based on the contention sensing signals provided by the adjacent router nodes,we propose a contention-foresee self-adaptive routing algorithm, and realize it by the on-chip interconnection network simulation of the SystemC. Experiment results show that the transfer delay of the self-adaptive routing is better than that of the conventional hot-potato routing in the case of multiple contentions.

关 键 词：片上互连网络 虫洞交换 固定维序路由 SYSTEMC 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] P159[自动化与计算机技术—计算机科学与技术]