A Graph-Based Approach to Power-Constrained SOC Test Scheduling

Chih Pin Su, Cheng Wen Wu

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

The test scheduling problem is one of the major issues in the test integration of system-on-chip (SOC), and a test schedule is usually influenced by the test access mechanism (TAM). In this paper we propose a graph-based approach to power-constrained test scheduling, with TAM assignment and test conflicts also considered. By mapping a test schedule to a subgraph of the test compatibility graph, an interval graph recognition method can be used to determine the order of the core tests. We then present a heuristic algorithm that can effectively assign TAM wires to the cores, given the test order. With the help of the tabu search method and the test compatibility graph, the proposed algorithm allows rapid exploration of the solution space. Experimental results for the ITC02 benchmarks show that short test length is achieved within reasonable computation time.

Original languageEnglish
Pages (from-to)45-60
Number of pages16
JournalJournal of Electronic Testing: Theory and Applications (JETTA)
Volume20
Issue number1
DOIs
Publication statusPublished - 2004 Feb 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Graph-Based Approach to Power-Constrained SOC Test Scheduling'. Together they form a unique fingerprint.

Cite this