摘要
针对目前片上网络自适应路由算法中存在的不足,对二维mesh结构进行分析和推导,提出一种基于全局信息的片上网络路由算法.首先计算路由关键区域各个节点的权重并将其存储在中央控制器中,然后由中央控制器计算各个节点的路由表,最后定时更新各个路由器节点的路由表.采用实际benchmark测试,并与传统的维序路由算法、贪心自适应算法相比的结果表明,该算法分别能平均减少32%,18%的延迟.
To improve the performance of routing algorithms of network-on-chip,leveraging more global information of network status is natural and necessary.However,from which region to obtain global information and how nodes in the region weight are not fully considered in current adaptive routing algorithms.This paper firstly analyzes the properties of 2D mesh topology and then proposes a novel routing algorithmleveraging global information.This algorithm calculates the weight of each node in critical area and stores in the central control module,then figures out the routing table and updates the routing table of each router in regular time.The experimental results of SPLASH-2 traces show there are 32% and 18% reduction of average packet latency in comparison with the traditional dimension order routing,and local greedy routing algorithm respectively.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2014年第6期1007-1014,共8页
Journal of Computer-Aided Design & Computer Graphics
基金
中国科学院先导计划(XDA06010403)
国家"核高基"科技重大专项课题(2009ZX01028-002-003
2009ZX01029-001-003)
国家自然科学基金(61221062
61100163
61133004
61173001
61232009
61222204)
国家"八六三"高技术研究发展计划(2012AA012202)
关键词
片上网络
路由算法
自适应路由
全局信息
network-on-chip
routing algorithm
adaptive routing
global information