虫孔路由NOC的缓冲分配算法  

A Buffer Allocation Algorithm for Wormhole Routing Networks-on-Chip

作　　者：王力纬[1] 曹阳[1] 李晓辉[1] 朱小虎[1] 

机构地区：[1]武汉大学电子信息学院,武汉430079

出　　处：《北京邮电大学学报》2008年第4期29-32,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家“863计划”项目(2002AA1Z1490)

摘　　要：提出了一种可应用于虫孔路由片上网络(NOC)的缓冲分配算法.在满足系统总缓冲资源大小不变的情况下,该算法可以依据业务流量的特征在各个路由器的输入通道间分配缓冲资源.仿真结果表明,使用该算法后,系统缓冲资源得到了更有效的利用,数据包平均传输延迟小于均匀分配缓冲的NOC;在热点流量中,可节省约17%的缓冲资源.A buffer allocation algorithm for wormhole routing networks-on-chip was proposed. When the total budget of the available buffering space is fixed, the proposed algorithm automatically will, according to the traffic characteristics of the target application, assign the buffer depth for each input channel in different routers across the chip. The simulation results show that the buffer allocation result is more reasonable and smaller average packet latency can be achieved compared to the uniform buffer allocation. For hotspot traffic, about 17 % savings in buffering resources can be achieved using our algorithm.

关 键 词：虫孔路由 片上网络 缓冲分配算法 

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