高级检索
欧阳一鸣, 杨鑫, 梁华国, 易茂祥, 高妍妍. NoC中基于路径树的无冲突测试调度方法[J]. 计算机辅助设计与图形学学报, 2015, 27(3): 533-541.
引用本文: 欧阳一鸣, 杨鑫, 梁华国, 易茂祥, 高妍妍. NoC中基于路径树的无冲突测试调度方法[J]. 计算机辅助设计与图形学学报, 2015, 27(3): 533-541.
Ouyang Yiming, Yang Xin, Liang Huaguo, Yi Maoxiang, Gao Yanyan. A Contention-Free Test Scheduling Method Based on Path-Tree in NoC[J]. Journal of Computer-Aided Design & Computer Graphics, 2015, 27(3): 533-541.
Citation: Ouyang Yiming, Yang Xin, Liang Huaguo, Yi Maoxiang, Gao Yanyan. A Contention-Free Test Scheduling Method Based on Path-Tree in NoC[J]. Journal of Computer-Aided Design & Computer Graphics, 2015, 27(3): 533-541.

NoC中基于路径树的无冲突测试调度方法

A Contention-Free Test Scheduling Method Based on Path-Tree in NoC

  • 摘要: 在复用片上网络(No C)架构作为测试访问机制对No C内嵌核进行测试时,如果有多个I/O接口并行测试就容易发生资源的冲突.为了解决多区域并行测试的资源冲突问题,提出一种无链路冲突的测试调度方法.首先使用分区算法将网络划分多个区域,然后使用链路分配算法对节点建立路径树来查找可连通路径,最后全局考虑各个区域的连通路径来分配链路使所有区域都连通,从而避免资源冲突、减少测试时间、保证测试可靠性.实验结果表明,相对于基准对象,该方法可减少测试时间14.13%~52.62%,比已有算法的测试时间最多减少了16.42%,是一种较优的无冲突测试调度方法.

     

    Abstract: In using on-chip network infrastructure as test access mechanism to test the embedded cores of NoC, it’s easy to lead to the confliction of resources if there are multiple I/O ports. This paper proposes a contention-free method to solve the resource confliction problem in parallel testing for NoC. After dividing the network into multiple partitions, a path tree is builded for every border node to find a connected path and then allocate links of the path to each partition. The ultimate goal of this paper is to make all partitions connected, thus removing the resource confliction, reducing the testing time and guaranteeing the reliability for the whole chip. Experimental results show that, the testing time can be reduced by 14.13%~52.62% when compared with general cases, and can be reduced by 16.42% at most while compared with the existing algorithm. Therefore, the proposed method is a relatively optimal contention-free test scheduling method.

     

/

返回文章
返回