片上网络有环通信集的实时调度算法  

Real-Time Scheduling Algorithms for Cyclic Communication Set in Networks-on-chip

作　　者：金曦[1] 李美锋[1] 邓庆绪[1] 孔繁鑫[1] 

机构地区：[1]东北大学物联网工程研究所,沈阳110819

出　　处：《小型微型计算机系统》2013年第8期1917-1920,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60973017)资助;中央高校基本科研业务费重大创新项目(N110804003)资助;博士学科点专项科研基金课题项目(20110042110021)资助;国家支撑计划项目(2012BAF13B08)资助;中央高校基本科研业务费项目(N100604011)资助

摘　　要：片上网络能够用来为多核/众核片上系统提供高速的核间通信.如何保证片上网络通信的实时性是目前片上网络研究亟待解决的问题之一.本文针对有环的通信集提出了两种实时调度算法CS-VC和CS-TI,并给出了通信集用这两种算法可调度的通信集利用率界限(也称为通信集可调度的充分条件).实验部分将CS-VC和CS-TI与目前最先进的能用于有环通信集的实时调度算法进行了比较,实验结果表明CS-VC和CS-TI有更高的接收率,并且当通信集和片上网络规模越小时,CS-VC和CS-TI的接收率越高.CS-TI与CS-VC相比虽然接收率较低,但CS-TI无需额外的片上网络结构作为支持更便于实现.Networks-on-chip （NoC} has been introduced to offer high on-chip communication bandwidth for large-scale multi-core systems. How to guarantee real-time in NoC is a key research problem. In this paper, we propose two real time scheduling algorithms （ CS-TI and CS-VC } for cyclic communication set and analyze the sufficient utilization bounds of two algo- rithms. We compare our algorithms with the existing fixed-priority algorithm which is the state of the art. Experimental results show that the acceptance rates of our algorithms are higher than that of the fixed-priority algorithm. And the smaller the communication set size and the NoC size, the higher the acceptance rate. Comparing with CS-VC, CS-TI has the lower acceptance rate. However CS-TI can be applied to common NoC as it does not require extra hardware support.

关 键 词：片上网络 有环通信集 实时 调度算法 

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