Publication detail

Power-Constrained, Sessionless SOC Test Scheduling Based on Exploration of I-Schedule State-Space

STRNADEL, J.

Original Title

Power-Constrained, Sessionless SOC Test Scheduling Based on Exploration of I-Schedule State-Space

English Title

Power-Constrained, Sessionless SOC Test Scheduling Based on Exploration of I-Schedule State-Space

Type

conference paper

Language

en

Original Abstract

In the paper, novel sessionless approach to test-schedulling is presented. It utilizes so-called STEPs during special random-search based scheduling algorithm. The algorithm explores the state-space of so-called i-schedules whereas an i-schedule is an integer-vector encoded test-schedule represented by n-touple of STEPs. Proposed algorithm tries to link tests to STEPs in such a way there are no resource sharing conflicts in the best-found test schedule and hopefully, test schedule constraints are met maximally at minimal time and TAM values.

English abstract

In the paper, novel sessionless approach to test-schedulling is presented. It utilizes so-called STEPs during special random-search based scheduling algorithm. The algorithm explores the state-space of so-called i-schedules whereas an i-schedule is an integer-vector encoded test-schedule represented by n-touple of STEPs. Proposed algorithm tries to link tests to STEPs in such a way there are no resource sharing conflicts in the best-found test schedule and hopefully, test schedule constraints are met maximally at minimal time and TAM values.

Keywords

test scheduling, power constraint, test access mechanism, sessionless, test application graph

RIV year

2006

Released

20.04.2006

Publisher

Czech Technical University Publishing House

Location

Prague

ISBN

1-4244-0184-4

Book

Proceedings of the 2006 IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems

Pages from

161

Pages to

162

Pages count

2

Documents

BibTex


@inproceedings{BUT22186,
  author="Josef {Strnadel}",
  title="Power-Constrained, Sessionless SOC Test Scheduling Based on Exploration of I-Schedule State-Space",
  annote="In the paper, novel sessionless approach to test-schedulling is presented. It
utilizes so-called STEPs during special random-search based scheduling algorithm.
The algorithm explores the state-space of so-called i-schedules whereas an
i-schedule is an integer-vector encoded test-schedule represented by n-touple of
STEPs. Proposed algorithm tries to link tests to STEPs in such a way there are no
resource sharing conflicts in the best-found test schedule and hopefully, test
schedule constraints are met maximally at minimal time and TAM values.",
  address="Czech Technical University Publishing House",
  booktitle="Proceedings of the 2006 IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems",
  chapter="22186",
  institution="Czech Technical University Publishing House",
  year="2006",
  month="april",
  pages="161--162",
  publisher="Czech Technical University Publishing House",
  type="conference paper"
}