System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Tập 21 Số 9 - Trang 1088-1094 - 2002
Tóm tắt
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource conflicts, and limit power dissipation during test mode. In this paper, we present an integrated approach to several test scheduling problems. We first present a method to determine optimal schedules for reasonably sized SOCs with precedence relationships, i.e., schedules that preserve desirable orderings among tests. We also present an efficient heuristic algorithm to schedule tests for large SOCs with precedence constraints in polynomial time. We describe a novel algorithm that uses preemption of tests to obtain efficient schedules for SOCs. Experimental results for an academic SOC and an industrial SOC show that efficient test schedules can be obtained in reasonable CPU time.
Từ khóa
#System-on-a-chip #System testing #Optimal scheduling #Job shop scheduling #Automatic testing #Scheduling algorithm #Automation #Power dissipation #Heuristic algorithms #PolynomialsTài liệu tham khảo
10.1109/DATE.2001.915014
10.1109/ETW.1999.804248
10.1109/TEST.2000.894299
10.1109/TEST.1998.743187
10.1109/TEST.1998.743167
10.1109/2.769444
10.1145/371254.371258
10.1145/337292.337531
garey, 1979, Computers and Intractability A Guide to the Theory of $ \cal NP $ -Completeness
10.1109/92.585217
10.1023/A:1014916913577
10.1145/321978.321985
10.1109/43.875306
berkelaar, 0, $lpsolve$ 3 0
10.1109/VTEST.1999.766700