期刊文献+

基于双核扫描链平衡的SoC测试调度 被引量:4

SoC Test Scheduling Based on Scan Chain Balance of Pair Cores
下载PDF
导出
摘要 由于芯核的测试时间与芯核内最长扫描链的长度成正比,通过将SoC中的芯核进行成对匹配,使双芯核内最长的扫描链比两个单芯核内最长的扫描链短,从而缩短测试时间.利用粒子群优化算法和分合策略,高效地匹配芯核、设置芯核的测试顺序并分配测试总线,以获得优化的测试计划.在ITC’02基准SoC集上的实验结果表明,相对于其他基于单核扫描链平衡的测试调度技术而言,文中的测试调度技术能获得具有最短测试时间的测试计划. Since the test application time of a core is proportional tO the length of its longest scan chain, this paper presents a technique to pair-wise match the cores in SoC to balance the scan chains of pair cores. The longest scan chain of pair cores is shorter than each longest scan chain of the single core. A division and union strategy is proposed, and by using an evolutionary algorithm named particle swarm optimization, the cores are efficiently matched, then are ordered and allocated to the test access mechanism bus to get an optimal test plan. Experimental results on ITC'02 SoC benchmarks reveal that the proposed test scheduling technique achieves the minimum test application time compared to the previous approaches that are based on the scan chain balance of single core.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2005年第10期2203-2208,共6页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(90207002 60242001) 北京市科技重点项目(H020120120130) 中国科学院计算技术研究所基础研究基金(20036160)
关键词 测试调度 扫描链平衡 系统芯片 粒子群优化算法 test scheduling scan chain balance system-on-a-chip particle swarm optimization
  • 相关文献

参考文献14

  • 1Zorian Y. Test requirement for embedded core-based systems and IEEE P1500 [A]. In: Proceedings of the International Test Conference, Washington D C, 1997. 191~199.
  • 2Benabdenebi M, Maroufi W, Marzouki M. CAS-BUS: A scalable and reconfigurable test access mechanism for systems on a chip [A]. In: Proceedings of the Design, Automation and Test in Europe, Paris, 2000. 141~145.
  • 3Varma P, Bhatia B. A structured test re-use methodology for core-based system chips [A]. In: Proceedings of the International Test Conference, Washington D C, 1998. 294~302.
  • 4Marinissen E J, Arendsen R, Bos G. A structured and scalable mechanisrm for test access to embedded reusable cores [A]. In:Proceedings of the International Test Conference, Washington D C, 1998. 284~293.
  • 5Benini L, Micheli G D. Networks on chips: A new SoC paradigm [J]. Computer, 2002, 35(1): 70~78.
  • 6Chakrabarty K. Optimal test access architectures for system-ona-chip [J]. ACM Transactions on Design Automation of Electronic Systems, 2001, 6(1): 26~49.
  • 7Huang Y, Cheng W T, Tsai C C. Resource allocation and test scheduling for concurrent test of core-based SOC design [A].In: Proceedings of the IEEE Asian Test Symposium, Kyoto,2001. 265~270.
  • 8Chattopadhyay S, Reddy K S. Genetic algorithm based test scheduling and test access mechanism design for system-on-chips[A]. In: Proceedings of the International Conference on VLSI Design, New Delhi, 2003. 341~346.
  • 9Larsson E, Peng Z, Carlsson G. The design and optimization of SOC test solutions [A]. In: Proceedings of the International Conference on Computer Aided Design, San Jose, 2001. 523~530.
  • 10Zou W, Reddy S M, Pomeranz I. SOC test scheduling using simulated annealing [A]. In: Proceedings of the 21st IEEE VLSI Test Symposium, Napa Valley, 2003. 325~330.

同被引文献34

  • 1胡瑜,韩银和,李晓维.SOC可测试性设计与测试技术[J].计算机研究与发展,2005,42(1):153-162. 被引量:42
  • 2Chakrabarty K. Test scheduling for core based systems using mixed-integer linear programming [J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000, 19(10): 1163-1174
  • 3Iyengar V, Chakrabarty K. System on-a-chip test scheduling with precedence relationships, preemption, and power constraints [J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002, 21 (9) 1088-1094
  • 4Chattopadhyay S, Reddy K S. Genetic algorithm based test scheduling and test access mechanism design for system- on- chips [C] //Proceedings of the 16th International Conference on VLSI Design, New Delhi, 2003:341-346
  • 5Huang Y, Cheng W T, Tsai C C, etal. On concurrent test of core based SOC design [J]. Journal of Electronic Testing: Theory and Applications, 2002, 18(4/5): 401-414
  • 6Baeten J C M. A brief history of process algebra [J]. Theoretical Computer Science, 2005, 335(2/3): 131-146
  • 7Lee I, Philippou A, Sokolsky O. A family of resource bound real-time process algebras [J]. Electronic Notes in Theoretical Computer Science, 2006, 162(1): 221-226
  • 8Koranne S. A novel reconfigurable wrapper for testing of embedded core-based SOCs and its associated scheduling algorithm [J]. Journal of Electronic Testing: Theory and Applications, 2002, 18(4/5): 415-434
  • 9Aydin H, Melhem R, Mosse D et al. Power-aware scheduling for periodic real-time tasks [J]. IEEE Transactions on Computers, 2004, 53(5): 584-600
  • 10Clarke D, Lee I, Xie H L. VERSA: a tool for the specification and analysis of resource-bound real-time systems [R]. Philadelphia: University of Pennsylvania, 1993, 1-31

引证文献4

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部