基于竞争概率的片上网络带宽分配方法  

Bandwidth Allocation Approach for Network-on-Chip Based on Contention Probability

作　　者：程爱莲[1] 潘赟[1] 严晓浪[1] 

机构地区：[1]浙江大学超大规模集成电路设计研究所,杭州310027

出　　处：《计算机工程》2012年第22期55-58,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(61204030);中央高校基本科研业务费专项基金资助项目(2010QNA5033);浙江省自然科学基金资助项目(LQ12F04002)

摘　　要：在面向特定应用的片上系统中,不同模块之间的通信量和延迟需求差异很大,均等位宽的链路不能充分利用带宽资源。为此,提出一种非均匀的带宽分配方案,根据流量特征和竞争状况设定各链路的数据宽度,采用异构的互联结构合理分配连线资源并优化吞吐量。实验结果表明,在均匀流量模式下,非均匀位宽的异构网络和同构架构的吞吐量相近,而连线资源节省16%。在热点流量模式下,异构网络能够有效缓解局部拥塞状况,提高网络吞吐量。In application-specific systems on chip, traffic load between different modules is imbalanced and the delay requirements vary largely, thus bandwidth cannot be fully used ha uniform links. This paper presents a non-uniform bandwidth allocation approach, which assigns different width of data wires to each link according to traffic patterns and contention probability. The proposed method employs a heterogeneous architecture to allocate wire resources and optimize throughput. Experimental results demonstrate that under uniform traffic pattern, the optimized heterogeneous network achieves 16% wire savings with similar throughput compared with a regular Network-on-Chip（NoC）. Under hotspot traffic pattern, it effectively alleviates local congestion and improves system throughput.

关 键 词：片上网络 异构互联结构 转发概率 端口竞争 资源分配方法 网络吞吐量 

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