Optimization of Test Scheduling and Test Access for ITC-02 SOC Benchmark Circuits
P. Sakthivel, R. Delhi Babu & P. Narayanasamy
Journal of Computer Science, Volume 5, Issue 4, pp. 290–296 · doi.org/10.3844/jcssp.2009.290.296
Abstract
Problem statement: This study presented the optimized test scheduling and test access for ITC-02 SOC benchmark circuits using genetic algorithm. In the scheduling procedure of SOC, scheduling problem was formulated as a sequence of two problems and solved. Approach: Test access mechanism width was partitioned into two and three partitions and the applications of test vectors and test vector assignments for different partitions were scheduled using different operators of genetic algorithm. Results: The test application time was calculated in terms of CPU time cycles for two and three partitions of twelve ITC-02 SOC benchmark circuits and the results were compared with the integer linear programming approach. Conclusion: The results showed that the genetic algorithm based approach gives better results.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Sakthivel, P., Babu, R. D. & Narayanasamy, P. (2009). Optimization of Test Scheduling and Test Access for ITC-02 SOC Benchmark Circuits . Journal of Computer Science, 5(4), 290–296. https://doi.org/10.3844/jcssp.2009.290.296
- Licence
- © Science Publications
- Issue
- Volume 5, Issue 4
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
