A test scheduling algorithm based on two-stage GA

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present a new algorithm to co-optimize the core wrapper design and the SOC test scheduling. The SOC test scheduling problem is first formulated into a twodimension floorplan problem and a sequence pair architecture is used to represent it. Then we propose a two-stage GA (Genetic Algorithm) to solve the SOC test scheduling problem. Experiments on ITC'02 benchmark show that our algorithm can effectively reduce test time so as to decrease SOC test cost. © 2006 IOP Publishing Ltd.

Cite

CITATION STYLE

APA

Yu, Y., Peng, X. Y., & Peng, Y. (2006). A test scheduling algorithm based on two-stage GA. Journal of Physics: Conference Series, 48(1), 658–662. https://doi.org/10.1088/1742-6596/48/1/123

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free