Optimal test time for system-on-chip designs using preemptive scheduling and reconfigurable wrappers

In this paper, we show that the test access mechanism (TAM) scheduling is equal to the independent job scheduling on independent machines. We make use of an existing preemptive scheduling algorithm, which produces an optimal solution in O(n) time. We extend the algorithm to handle test conflicts due to interconnection test and cases when a test limits an optimal usage of the TAM by using reconfigurable test wrappers, which in contrast to standard approaches allows several TAM bandwidths per core. Our extension produces optimal solution in respect to test time in O(n) time and it also minimizes the TAM usage, its routing as well as the number of wrapper configurations.http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=100033929&oldid=6119