Test scheduling for core-based systems

We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However a commonly-encountered instance of this problem (m=2) can be solved in polynomial time. For the general case (m>2), we present a mixed-integer linear programming (MILP) model for optimal scheduling and apply it to a representative core-based system using an MILP solver. We also extend the MILP model to allow optimal test set selection from a set of alternatives. Finally we present an efficient heuristic algorithm for handling larger systems for which the MILP model may be infeasible.

[1]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[2]  Richard C. Larson,et al.  Model Building in Mathematical Programming , 1979 .

[3]  John D. C. Little,et al.  On model building , 1993 .

[4]  Yervant Zorian,et al.  Testing embedded-core based system chips , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

[5]  Makoto Sugihara,et al.  A novel test methodology for core-based system LSIs and a testing time minimization problem , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

[6]  Erik Jan Marinissen,et al.  A structured and scalable mechanism for test access to embedded reusable cores , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).