Hierarchical SoC Testing Scheduling Based on the Ant Colony Algorithm

摘要：

SoC testing scheduling is an NP hard problem,and it is more complex for the hierarchical SoC architecture.By formulating the SoC testing scheduling problem as a 2-D bin-packing model, this paper solves the problem for the hierarchical soC with the Ant Colony Optimization (ACO) algorithm to reduce testing application time.Experimental results on ITC02 benchmark circuits show that the ACO algorithm is more effective than earlier proposed methods.

关键词： Hierarchical SoC Testing scheduling Ant Colony Optimization

作者: Xiaole Cui Wei Cheng Xiaoye Wang Liang Yin Yachun Sun Yan Zhou

作者单位: Key Lab of Integrated Micorsystems,Shenzhen Graduate School of Peking University,Shenzhen,P.C.518055 Shenzhen National Integrated Circuit Industrial Center,Shenzhen.P.C.518057,China

会议类型: 国际会议

会议名称: 2009 IEEE 8th International Conference on ASIC(第八届IEEE国际专用集成电路大会)

会议地点: 长沙

会议语种:英文

页码: 1221-1224

在线出版日期: 2009-10-20（万方平台首次上网日期，不代表论文的发表时间）