liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Optimal Test Access Mechanism Scheduling using Preemption and Reconfigurable Wrappers
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
Computer Design and Test Lab. Nara Inst. of Science and Technology.
2002 (English)Other (Other (popular science, discussion, etc.))
Abstract [en]

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.
Keyword [en]
test access mechanism, test wrappers, TAM routing
National Category
Computer Science
URN: urn:nbn:se:liu:diva-23399Local ID: 2841OAI: diva2:243713
Available from: 2009-10-07 Created: 2009-10-07

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Larsson, Erik
By organisation
The Institute of TechnologyESLAB - Embedded Systems Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 7 hits
ReferencesLink to record
Permanent link

Direct link