A Comparison of Classical Scheduling Approaches in Power-Constrained Block-Test Scheduling

Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test schedul-ing under power dissipation constraints. List scheduling-like approaches are proposed j r s t as greedy algorithms to tackle the fore mentioned problem. Then, distribution-graph based approaches are described in order to achieve balanced test concurrency and test power dissipation. An extended tree growing technique is also used in combina-tion with these classical approaches in order to improve the test concurrency having assignedpower dissipation lim-its. A comparison between the results of the test scheduling experiments highlights the advantages and disadvantages of applying different classical scheduling algorithms to the power-constrained test scheduling problem