The Left Edge Algorithm and the Tree Growing Technique in Block-Test Scheduling under Power Constraints

Authors:
Valentin Muresan;Xiaojun Wang;Valentina Muresan;Mircea Vladutiu
Affiliations:
-;-;-;-
Venue:
VTS '00 Proceedings of the 18th IEEE VLSI Test Symposium
Year:
2000

Citing 0
Cited 7

Power Conscious Test Synthesis and Scheduling for BIST RTL Data Paths

ITC '00 Proceedings of the 2000 IEEE International Test Conference
A Comparison of Classical Scheduling Approaches in Power-Constrained Block-Test Scheduling

ITC '00 Proceedings of the 2000 IEEE International Test Conference
TACKLING TEST TRADE-OFFS FOR BIST RTL DATA PATHS: BIST AREA OVERHEAD, TEST APPLICATION TIME AND POWER DISSIPATION

ITC '01 Proceedings of the 2001 IEEE International Test Conference
Mixed Classical Scheduling Algorithms and Tree Growing Technique in Block-Test Scheduling under Power Constraints

RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Power-Conscious Test Synthesis and Scheduling

IEEE Design & Test
Greedy Tree Growing Heuristics on Block-Test Scheduling Under Power Constraints

Journal of Electronic Testing: Theory and Applications
Testability Trade-Offs for BIST Data Paths

Journal of Electronic Testing: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. Test scheduling example is discussed highlighting further research directions towards an efficient system-level test-scheduling algorithm.