The left edge algorithm and the tree growing technique in block-test scheduling under power constraints
Valentin Mureşan, X. Wang, V. Muresan, Mircea Vlăduţiu · 2000
The left-edge algorithm is adapted in this paper to deal with the problem of unequal-length block-test scheduling under power dissipation constraints. An extended tree growing technique is used in combination with the left-edge algorithm in order to improve the test concurrency under power dissipation limits. A test scheduling example is discussed highlighting further research directions towards an efficient system-level test scheduling algorithm.