Mixed classical scheduling algorithms and tree growing technique in block-test scheduling under power constraints

Mixed classical scheduling algorithms are proposed here to improve the test concurrency having assigned power dissipation limits. An extended tree growing technique is used together with these algorithms in order to model the power-constrained test scheduling problem. A sequence of list and distribution-graph based scheduling algorithms is adapted to tackle it. A constant additive model is employed for power dissipation analysis and estimation. Firstly, a list scheduling-like algorithm is run in order to achieve rapidly a test scheduling solution with a near-optimal test application time. Then the power dissipation distribution of this solution is balanced by applying a distribution-graph based scheduling algorithm. Test scheduling examples and experiments are used in order to assess the efficiency of this approach comparing to the other approaches proposed before