Power constrained preemptive TAM scheduling
Erik G. Larsson, Hideo Fujiwara · 2003
We integrate scan-chain partitioning and preemptive test access mechanism (TAM) scheduling for core-based systems under power constraint. We also outline a flexible power conscious test wrapper to increase the flexibility in the scheduling process by (1) allowing several different bandwidths at cores and (2) controlling the cores test power consumption, which makes it possible to increase the test clock. We model the scheduling problem as a bin-packing problem and discuss the transformations: (1) TAM-time and (2) power-time and the possibilities of achieving an optimal solution and the limitations. We have implemented our proposed preemptive TAM scheduling algorithm and through experiments we demonstrate its efficiency.