Optimal Test Access Mechanism Scheduling using Preemption and Reconfigurable Wrappers
2002 (English)Other (Other (popular science, discussion, etc.))
In this paper, we
show that the scheduling of tests on the test access mechanism
(TAM) is equal to independent job scheduling on identical machines
and we make use of an existing preemptive scheduling algorithm
producing an optimal solution in linear time. We extend the
algorithm to handle (1) test conflicts due to interconnection tests
and (2) cases when a test limits an optimal usage of the TAM by
using reconfigurable core test wrappers. Our extensions preserve
the production of an optimal solution in respect to test time and
minimizes the number of wrapper configurations and also the TAM
usage at each core, which implicitly minimizes the TAM routing.
Experiments with our implementation shows its efficiency in
comparison with previous approaches.
Place, publisher, year, edition, pages
Guam, USA: Workshop on RTL and High Level Testing , 2002.
test access mechanism, test wrappers, TAM routing
IdentifiersURN: urn:nbn:se:liu:diva-23399Local ID: 2841OAI: oai:DiVA.org:liu-23399DiVA: diva2:243713